Approximate Proximity Drawings [chapter]

William Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner
2012 Lecture Notes in Computer Science  
We introduce and study a generalization of the well-known region of influence proximity drawings, called (ε1, ε2)-proximity drawings. Intuitively, given a definition of proximity and two real numbers ε1 ≥ 0 and ε2 ≥ 0, an (ε1, ε2)-proximity drawing of a graph is a planar straight-line drawing Γ such that: (i) for every pair of adjacent vertices u, v, their proximity region "shrunk" by the multiplicative factor 1 1+ε 1 does not contain any vertices of Γ ; (ii) for every pair of non-adjacent
more » ... ces u, v, their proximity region "blown-up" by the factor (1 + ε2) contains some vertices of Γ other than u and v. We show that by using this generalization, we can significantly enlarge the family of the representable planar graphs for relevant definitions of proximity drawings, including Gabriel drawings, Delaunay drawings, and β-drawings, even for arbitrarily small values of ε1 and ε2. We also study the extremal case of (0, ε2)-proximity drawings, which generalizes the well-known weak proximity drawing model.
doi:10.1007/978-3-642-25878-7_17 fatcat:ozreaic7r5hhhni2knk42mexfa