Characterizing Proximity Trees

Algorithmica (New York)

Volumn 16, Issue 1, 1996, Pages 83-110

  Bose, P ^a,b   Lenhart, W ^b,c   Liotta, G ^b,d  

^a UNIVERSITÉ DU QUÉBEC À TROIS RIVIÈRES   (Canada)

^b MCGILL UNIVERSITY   (Canada)

^c WILLIAMS COLLEGE   (United States)

^d SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Delaunay triangulation; Gabriel graph; Graph drawing; Minimum spanning tree; Proximity graphs; Relative neighborhood graph; Relatively closest graph; Trees

Indexed keywords

EID: 0006886803     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02086609     Document Type: Article

References (27)

1. P.K. Agarwal and J. Matoušek. Relative Neighbourhood Graphs in Three Dimensions. Computational Geometry: Theory and Applications, 2 (1992), 1-14.
2. J. A. Bondy and U. S. R. Murty. Graph Theory with Applications. Elsevier, New York, 1976.
3. R. J. Cimikowski. Properties of Some Euclidean Proximity Graphs. Pattern Recognition Letters, 13 (1992), 417-423.
4. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for Automatic Graph Drawing: An Annotated Bibliography. Computational Geometry: Theory and Applications, 4 (1994), 235-282.
5. G. Di Battista and L. Vismara. Angles of Planar Triangular Graphs. Proceedings of the ACM Symposium on Theory of Computing, 1993, pp. 431-437.
6. M. B. Dillencourt. Graph-Theoretical Conditions for Inscribability and Delaunay Realizability. Technical Report 92-90, University of Califoria Irvine.
7. P. Eades and S. Whitesides. Personal communication, 1993.
8. H. Edelsbrunner, D. G. Kirkpatrick, and R. Seidel. On the Shape of a Set of Points in the Plane. IEEE Transaction on Information Theory, 29 (1983), 551-559.
9. I. Fary. On Straight Lines Representation of Planar Graphs. Acta Scientiarum Mathematicarum (Szeged), 11 (1948), 229-233.
10. K. R. Gabriel and R. R. Sokal. A New Statistical Approach to Geographical Analysis. Systematic Zoology, 18 (1969), 54-64.
11. J. Garcia. A Counter-Example to a Theorem of Sendov. Manuscript in preparation.
12. M. S. Jacobson, M. J. Lipman, and F. R. McMorris. Trees That Are Sphere-of-Influence Graphs. Technical Report 0191/2, University of Louisville.
13. J. W. Jaromczyk and G. T. Toussaint. Relative Neighborhood Graphs and Their Relatives. Proceedings of the IEEE, 80(9) (1992), 1502-1517.
14. D. G. Kirkpatrick and J. D. Radke. A Framework for Computational Morphology. In Computational Geometry, ed. G. T. Toussaint. Elsevier, Amsterdam, 1985, pp. 217-248.
15. P.M. Lankford. Regionalization: Theory and Alternative Algorithms. Geographical Analysis, 1 (1969), 196-212.
16. A. Lubiw, and N. Sleumer, All Maximal Outerplanar Graphs Are Relative Neighborhood Graphs. Proceedings of the Fifth Canadian Conference on Computational Geometry, Waterloo, 1993, pp. 198-203.
17. D. W. Matula and R. R. Sokal. Properties of Gabriel Graphs Relevant to Geographic Variation Research and the Clustering of Points in the Plane. Geographical Analysis, 12(3) (1980), 205-222.
18. C. Monma and S. Suri. Transitions in Geometric Minimum Spanning Trees. Proceedings of the ACM Symposium on Computational Geometry, 1991, pp. 239-249.
19. F. P. Preparata and M. I. Shamos, Computational Geometry - An Introduction. Springer-Verlag, New York, 1985.
20. J. D. Radke. On the Shape of a Set of Points. In Computational Morphology, ed. G. T. Toussaint. Elsevier, Amsterdam, 1988, pp. 105-136.
21. B. Sendov. Planar Neighbourhood Graphs Without Cycles. Comptes Rendus de l'Academie Bulgare des Sciences, 44(4) (1991), 23-25.
22. M. I. Shamos and D. Hoey. Closest Point Problem. Proceedings of the 8th Annual IEEE Symposium on the Foundations of Computer Science, 1975, pp. 151-162.
23. G. T. Toussaint. The Relative Neighborhood Graph of a Finite Planar Set. Pattern Recognition, 12 (1980), 261-268.
24. G. T. Toussaint. Pattern Recognition and Geometrical Complexity. Proceedings of the Fifth International Conference on Pattern Recognition, Miami Beach, 1980, pp. 1340-1347.
25. G. T. Toussaint. A Graph-Theoretical Primal Sketch. In Computational Morphology, ed. G. T. Toussaint. Elsevier, Amsterdam, 1988, pp. 229-260.
26. R. B. Urquhart. Some Properties of the Planar Euclidean Relative Neighbourhood Graph. Pattern Recognition Letters, 1(5), 1983, 317-322.
27. R. C. Vetkamp. The γ-Neighbourhood Graph. Computational Geometry: Theory and Applications, 1 (1992), 227-246.