  In this paper we discuss the connected components of underlying graphs of
halving lines' configurations. We show how to create a configuration whose
underlying graph is the union of two given underlying graphs. We also prove
that every connected component of the underlying graph is itself an underlying
graph.
