The rectangle of influence drawability problem

Computational Geometry: Theory and Applications

Volumn 10, Issue 1, 1998, Pages 1-22

  Liotta, G ^a   Lubiw, A ^b   Meijer, H ^c   Whitesides, S H ^d  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF WATERLOO   (Canada)

^c QUEEN S UNIVERSITY   (Canada)

^d MCGILL UNIVERSITY   (Canada)

Author keywords

Graph drawing; Proximity; Rectangle of influence

Indexed keywords

EID: 0039938990     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(97)00018-7     Document Type: Article

References (28)

1. C. Batini, M. Talamo, R. Tamassia, Computer aided layout of entity-relationship diagrams, J. Systems Software 4 (1984) 163-173.
2. J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, Elsevier, New York, 1976.
3. P. Bose, W. Lenhart, G. Liotta, Characterizing proximity trees, Algorithmica 16, Special Issue on Graph Drawing (1996) 83-110.
4. P. Bose, G. Di Battista, W. Lenhart, G. Liotta, Proximity constraints and representable trees, in: R. Tamassia, I.G. Tollis (Eds.), Graph Drawing, Proceedings of the DIMACS International Workshop GD '94, New Jersey, USA, October 1994, Lecture Notes in Computer Science 894, Springer, Berlin, 1995.
5. R.J. Cimikowski, Properties of some Euclidean proximity graphs, Pattern Recognition Lett. 13 (1992) 417-423.
6. M. de Berg, S. Carlsson, M.H. Overmars, A general approach to dominance in the plane, J. Algorithms 13 (1992) 274-296.
7. G. Di Battista, P. Eades, R. Tamassia, I.G. Tollis, Algorithms for automatic graph drawing: an annotated bibliography, Computational Geometry: Theory and Applications 4 (1994) 235-282.
8. G. Di Battista, W. Lenhart, G. Liotta, Proximity drawability: A survey, in: R. Tamassia, I.G. Tollis (Eds.), Graph Drawing, Proceedings of the DIMACS International Workshop GD '94, New Jersey, USA, October 1994, Lecture Notes in Computer Science 894, Springer, Berlin, 1995, pp. 328-339.
9. G. Di Battista, E. Pietrosanti, R. Tamassia, I.G. Tollis, Automatic layout of PERT diagrams with X-PERT, in: Proceedings IEEE Workshop on Visual Languages, Rome, Italy, 1989, pp. 171-176.
10. G. Di Battista, L. Vismara, Angles of planar triangular graphs, SIAM J. Discrete Math. 9 (1996) 349-359.
11. M.B. Dillencourt, W.D. Smith, Graph-theoretical conditions for inscribability and Delaunay realizability, in: Proceedings of the 6th Canadian Conference on Computational Geometry, Saskatoon, Canada, 1994, pp. 287-292.
12. P. Eades, S. Whitesides, The realization problem for Euclidean minimum spanning tree is NP-hard, Algorithmica 16, Special Issue on Graph Drawing (1996) 60-82.
13. P. Eades, S. Whitesides, Nearest neighbor graph realizability is NP-hard, in: R. Baeza-Yates, E. Goles, P Poblete (Eds.), Proceedings Latin '95, Valparaiso, Chile, 1995, Lecture Notes in Computer Science 911, Springer, Berlin, 1995, pp. 245-256.
14. H. ElGindy, G. Liotta, A. Lubiw, H. Meijer, S.H. Whitesides, Recognizing rectangle of influence drawable graphs, in: R. Tamassia, I.G. Tollis (Eds.), Graph Drawing, Proceedings of the DIMACS International Workshop GD '94, New Jersey, USA, October 1994, Lecture Notes in Computer Science 894, Springer, Berlin, 1995, pp. 352-363.
15. P. Erdös, G. Szekeres, A combinatorial problem in geometry, Compositio Mathematica 2 (1935) 463-470.
16. M. Ichino, J. Sklansky, The relative neighborhood graph for mixed feature variables, Pattern Recognition 18 (1985) 161-167.
17. J.W. Jaromczyk, G.T. Toussaint, Relative neighborhood graphs and their relatives, Proc. IEEE 80 (1992) 1502-1517.
18. D.G. Kirkpatrick, J.D. Radke, A framework for computational morphology, in: G.T. Toussaint (Ed.), Computational Geometry, Elsevier, Amsterdam, 1985, pp. 217-248.
19. W. Lenhart, G. Liotta, Proximity drawings of outerplanar graphs, in: Proceedings of the Symposium on Graph Drawing GD '96, Berkeley, CA, USA, 1996, Lecture Notes in Computer Science 1190, Springer, Berlin, 1997, pp. 286-302.
20. G. Liotta, G. Di Battista, Computing proximity drawings of trees in the 3-dimensional space, in: S.L. Akl, F. Dehne, J.R. Sack, N. Santoro (Eds.), Proceedings of the International Workshop on Algorithms and Data Structures, WADS '95, Kingston, Canada, August 1995, Lecture Notes in Computer Science 995, Springer, Berlin, 1995, pp. 239-250.
21. A. Lubiw, N. Sleumer, All maximal outerplanar graphs are relative neighborhood graphs, in: Proceedings 5th Canadian Conference on Computational Geometry, Waterloo, Canada, 1993, pp. 198-203.
22. D.W. Matula, R.R. Sokal, Properties of Gabriel graphs relevant to geographic variation research and the clustering of points in the plane, Geographical Analysis 12 (1980) 205-222.
23. M.H. Overmars, D. Wood, On rectangular visibility, J. Algorithms 9 (1988) 372-390.
24. M.S. Paterson, F.F. Yao, On nearest-neighbor graphs, in: Proceedings Annual International Colloqium on Automata, Languages and Programming, ICALP '92, Lecture Notes in Computer Science 623, Springer, Berlin, 1992, pp. 416-426.
25. F.P. Preparata, M.I. Shamos, Computational Geometry: An Introduction, Springer, New York, 1985.
26. J.D. Radke, On the shape of a set of points, in: G.T. Toussaint (Ed.), Computational Morphology, Elsevier, Amsterdam, 1988, pp. 105-136.
27. R. Tamassia, G. Di Battista, C. Batini, Automatic graph drawing and readability of diagrams, IEEE Trans. Systems Man Cybernet. 18 (1988) 61-79.
28. G.T. Toussaint, The relative neighborhood graph of a finite planar set, Pattern Recognition 12 (1980) 261-268.