A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
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-adjacentdoi:10.1007/978-3-642-25878-7_17 fatcat:ozreaic7r5hhhni2knk42mexfa