Approximate proximity drawings

Angelini, 2011, On the area requirements of Euclidean minimum spanning trees, vol. 6844, 25 Aronov, 2011, Witness (Delaunay) graphs, Computational Geometry, 44, 329, 10.1016/j.comgeo.2011.01.001 Aronov, 2011, Witness rectangle graphs, vol. 6844, 73 B. Aronov, M. Dulieu, F. Hurtado, Witness Gabriel graphs, Computational Geometry (2013), in press, http://dx.doi.org/10.1016/j.comgeo.2011.06.004. Bose, 1996, Characterizing proximity trees, Algorithmica, 16, 83, 10.1007/BF02086609 de Fraysseix, 1990, How to draw a planar graph on a grid, Combinatorica, 10, 41, 10.1007/BF02122694 Di Battista, 1994, Proximity drawability: a survey, vol. 894, 328 Di Battista, 2006, The strength of weak proximity, Journal of Discrete Algorithms, 4, 384, 10.1016/j.jda.2005.12.004 Di Giacomo, 2012, Drawing a tree as a minimum spanning tree approximation, Journal of Computer and System Sciences, 78, 491, 10.1016/j.jcss.2011.06.001 E. Di Giacomo, G. Liotta, H. Meijer, The approximate rectangle of influence drawability problem, in: Proceedings of the International Symposium on Graph Drawing, GD 2012, in: LNCS, Springer, 2012, in press. Dillencourt, 1990, Toughness and Delaunay triangulations, Discrete & Computational Geometry, 5, 575, 10.1007/BF02187810 Dillencourt, 1993, A simple method for resolving degeneracies in Delaunay triangulations, vol. 700, 177 Jaromczyk, 1992, Relative neighborhood graphs and their relatives, Proceedings of the IEEE, 80, 1502, 10.1109/5.163414 Lenhart, 1996, Proximity drawings of outerplanar graphs, vol. 1190, 286 Li, 2004, Applications of computational geometry in wireless networks, 197 G. Liotta, Proximity drawings, in: R. Tamassia (Ed.), Handbook of Graph Drawing and Visualization, CRC Press, available online.