The strength of weak proximity ?
This paper studies weak proximity drawings of graphs and demonstrates their advantages over strong proximity drawings in certain cases. Weak proximity drawings are straight line drawings such that if the proximity region of two points p and q  representing vertices is devoid of other points representing vertices, then segment (p,q) ( p , q ) is allowed, but not forced, to appear in the drawing. This differs from the usual, strong, notion of proximity drawing in which such segments must appear in the drawing. Most previously studied proximity regions are associated with a parameter ? , 0???? 0 ? ? ? ? . For fixed ?, weak ?-drawability is at least as expressive as strong ?-drawability, as a strong ?-drawing is also a weak one. We give examples of graph families and ? values where the two notions coincide, and a situation in which it is NP-hard to determine weak ?-drawability. On the other hand, we give situations where weak proximity significantly increases the expressive power of ?-drawability: we show that every graph has, for all sufficiently small ?, a weak ?-proximity drawing that is computable in linear time, and we show that every tree has, for every ? less than 2, a weak ?-drawing that is computable in linear time.
proximity graph drawing sensor networks visualization computational geometry layout