Optimal algorithms to embed trees in a point set

Journal of Graph Algorithms and Applications

Volumn 1, Issue , 1997, Pages 1-15

  Bose, Prosenjit ^a   McAllister, Michael ^b   Snoeyink, Jack ^b  

^a CARLETON UNIVERSITY   (Canada)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3042656563     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00002     Document Type: Article

References (24)

1. P. Bose. On embedding an outer-planar graph in a point set. In Proceedings of Graph Drawing 97, page to appear, Rome, Italy, 1997.
2. P. Bose, G. Di Battista, W. Lenhart, and G. Liotta. Proximity constraints and representable trees. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes in Computer Science, pages 340-351. Springer-Verlag, 1995.
3. P. Bose, W. Lenhart, and G. Liotta. Characterizing proximity trees. Algorithmica: Special Issue on Graph Drawing, 16:83-110, 1996.
4. B. Chazelle. On the convex layers of a planar set. IEEE Trans. Info. Theory, IT-31:509-517, 1985.
5. P. Crescenzi and A. Piperno. Optimal-area upward drawings of AVL trees. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes in Computer Science, pages 307-317. Springer-Verlag, 1995.
6. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4:235-282, 1994.
7. P. Eades and S. Whitesides. The realization problem for Euclidean minimum spanning trees is NP-hard. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 49-56, 1994.
8. P. Gritzmann, B. Mohar, J. Pach, and R. Pollack. Embedding a planar triangulation with vertices at specified points (solution to problem e3341). American Mathematical Monthly, 98:165-166, 1991.
9. J. Hershberger and S. Suri. Applications of a semi-dynamic convex hull algorithm. BIT, 32:249-267, 1992.
10. Y. Ikebe, M. Perles, A. Tamura, and S. Tokunaga. The rooted tree embedding problem into points in the plane. Discrete & Computational Geometry, 11:51-63, 1994.
11. G. Kant, G. Liotta, R. Tamassia, and I. Tollis. Area requirement of visibility representations of trees. In Proc. 5th Canad. Conf. Comput. Geom., pages 192-197, Waterloo, Canada, 1993.
12. D. E. Knuth. Fundamental Algorithms, volume 1 of The Art of Computer Programming. Addison-Wesley, second edition, 1973.
13. J. Manning and M. J. Atallah. Fast detection and display of symmetry in trees. Congressus Numerantium, 64:159-169, 1988.
14. A. Melkman. On-line construction of the convex hull of a simple polyline. Information Processing Letters, 25:11-12, 1987.
15. C. Monma and S. Suri. Transitions in geometric minimum spanning trees. In Proc. 7th Annu. ACM Sympos. Comput. Geom., pages 239-249, 1991.
16. N. C. neda and J. Urrutia. Straight line embeddings of planar graphs on point sets. In Proc. 8th Canad. Conf. Comput. Geom., pages 312-318, 1996.
17. A. Okabe, B. Boots, and K. Sugihara. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. John Wiley & Sons, 1992.
18. J. O'Rourke. Computational Geometry in C. Cambridge Univ. Press, 1994.
19. M. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. J. Comp. Sys. Sci., 23:166-204, 1981.
20. J. Pach and J. Törocsik. Layout of rooted trees. In W. T. Trotter, editor, Planar Graphs, volume 9 of DIMACS Series, pages 131-137. American Mathematical Society, 1993.
21. W. Paul and J. Simon. Decision trees and random access machines. Logic and Algorithmics, Monograph 30, L'Enseignement Mathématique, 1987.
22. F. P. Preparata and M. I. Shamos. Computational Geometry: an Introduction. Springer-Verlag, New York, NY, 1985.
23. O. Schwarzkopf. The extendible drawing editor Ipe. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages C10-C11, 1995.
24. A. Tamura and Y. Tamura. Degree constrained tree embedding into points in the plane. Information Processing Letters, 44:211-1214, 1992.