Clear Unit-Distance Graphs

We introduce a variation of unit-distance graphs which we call clear unit-distance graphs. They require the pairwise distances of the representing points to be either exactly 1 or not close to 1. We discuss properties and applications of clear unit-distance graphs.

keywords: Computational Geometry, Graph Drawing, Graphs Theory, UDG

Workshop or Poster (weakly reviewed)

Frank Staals, Maarten Löffler, Marc van Kreveld
Clear Unit-Distance Graphs
Proc. 29th European Workshop on Computational Geometry
213–216, 2013

back to list