Upward planarity checking: “faces are more than polygons”

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1547, Issue , 1999, Pages 72-86

  Di Battista, Giuseppe ^a   Liotta, Giuseppe ^b  

^a ROMA TRE UNIVERSITY   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957863642     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-37623-2_6     Document Type: Conference Paper

References (21)

1. [1] P. Bertolazzi, G. D. Battista, and W. Didimo. Quasi upward planarity. Manuscript, 1998.
2. [2] P. Bertolazzi, G. Di Battista, G. Liotta, and C. Mannino. Upward drawings of triconnected digraphs. Algorithmica, 6(12):476-497, 1994.
3. [3] B. Chazelle. Triangulating a simple polygon in linear time. Discrete Comput. Geom., 6:485-524, 1991.
4. [4] B. Chazelle and J. Incerpi. Triangulation and shape-complexity. ACM Trans. Graph., 3(2):135-152, 1984.
5. [5] O. Devillers, G. Liotta, R. Tamassia, and F. Preparata. Cecking the convexity of polytopes and the planarity of subdivisions. In Algorithms and Data Structures (Proc. WADS 97), volume 1272 of Lecture Notes Comput. Sci., pages 186-199. Springer-Verlag, 1997.
6. [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. [7] G. Di Battista and R. Tamassia. Algorithms for plane representations of acyclic digraphs. Theoret. Comput. Sci., 61:175-198, 1988.
8. [8] H. ElGindy, D. Avis, and G. T. Toussaint. Applications of a two-dimensional hidden-line algorithm to other geometric problems. Computing, 31:191-202, 1983.
9. [9] K. R. Gabriel and R. R. Sokal. A new statistical approach to geographic variation analysis. Systematic Zoology, 18:259-278, 1969.
10. [10] M. R. Garey, D. S. Johnson, F. P. Preparata, and R. E. Tarjan. Triangulating a simple polygon. Inform. Process. Lett., 7:175-179, 1978.
11. [11] F. Harary. Graph Theory. Addison-Wesley, Reading, MA, 1972.
12. [12] S. Hertel and K. Mehlhorn. Fast triangulation of simple polygons. In Proc. 4th Internat. Conf. Found. Comput. Theory, volume 158 of Lecture Notes Comput. Sci., pages 207-218. Springer-Verlag, 1983.
13. [13] D. Kelly. Fundamentals of planar ordered sets. Discrete Math., 63:197-216, 1987.
14. [14] G. Liotta, F. P. Preparata, and R. Tamassia. Robust proximity queries: an illustration of degree-driven algorithm design. SIAM J. Comput. to appear.
15. [15] G. Liotta, F. P. Preparata, and R. Tamassia. Robust proximity queries: an illustration of degree-driven algorithm design. In Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 156-165, 1997.
16. [16] K. Mehlhorn and S. Näher. Checking Geometric Structures, Dec. 1996. Manual.
17. [17] K. Mehlhorn, S. Näher, T. Schilz, S. Schirra, M. Seel, R. Seidel, and C. Uhrig. Checking geometric programs or verification of geometric structures. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 159-165, 1996.
18. [18] K. Mehlhorn, S. Näher, T. Schilz, S. Schirra, M. Seel, R. Seidel, and C. Uhrig. Checking geometric programs or verification of geometric structures. Manuscript, 1997.
19. [19] F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985.
20. [20] G. Toussaint. Efficient triangulation of simple polygons. Visual Comput., 7:280-295, 1991.
21. [21] G. T. Toussaint. The relative neighbourhood graph of a finite planar set. Pattern Recogn., 12:261-268, 1980.