Checking the convexity of polytopes and the planarity of subdivisions

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

Volumn 1272, Issue , 1997, Pages 186-199

  Devillers, O ^a   Liotta, G ^b   Preparata, F P ^c   Tamassia, R ^c  

^a INRIA   (France)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; TRIANGULATION;

CONVEX POLYTOPES; DELAU-NAY TRIANGULATIONS; GEOMETRIC STRUCTURE; HIGHER DIMENSIONS; PLANAR SUBDIVISION; PLANARITY; POLYTOPES;

TOPOLOGY;

EID: 84896787572     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63307-3_59     Document Type: Conference Paper

References (21)

1. N. Amenta. Directory of computational geometry software, http://www.geom.umn.edu/software/cglist/.
2. G. Barequet, S. S. Bridgeman, C. A. Duncan, M. T. Goodrich, and R. Tamassia. Classic computational geometry with GeomNet. In Proc. ACM Symp. Computational Geometry, 1997.
3. J. L. Bentley and T. A. Ottmann. Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput., C-28:643-647, 1979.
4. M. Blum and S, Katman. Designing programs that check their work. J. ACM, 42(1):269-291, Jan. 1995.
5. C. Bumikel. Exact Computation of Voronoi Diagrams and Line Segment Intersections. Ph.D thesis, Universität des Saarlandes, Mar. 1996.
6. B. Chazelle. Triangulating a simple polygon in linear time. Discrete Comput. Geom., 6:485-524, 1991.
7. G. Di Battista, R. Tamassia, and L. Vismara. On-line convex planarity testing. In Graph-Theoretic Concepts in Computer Science (Proc. WG 94), Lecture Notes in Computer Science. Springer-Verlag, 1994.
8. G. Di Battista, R. Tamassia, and L. Vismara. On-line convex planarity testing. Technical Report CS-95-26, Dept. Computer Science, Brown Univ., 1995. ftp://ftp.cs.brown.βdu/pub/techrβports/95/cs95-26.ps.Z.
9. G. Di Battista and L. Vismara. Angles of planar triangular graphs. SIAM J. Discrete Math., 9(3):349-359, 1996.
10. I. Fary. On straight lines representation of planar graphs. Acta Sci. Math. Szeged., 11:229-233, 1948.
11. S. Gottschalk, M. C. Lin, and D. Manocha. OBB-tree: A hierarchical structure for rapid interference detection. Comput. Graph., 1996. Proc. SIGGRAPH’96.
12. F. Harary. Graph Theory. Addison-Wesley, Reading, MA, 1972.
13. J. Hopcroft and R. E. Tarjan. Efficient planarity testing. J. ACM, 21(4):549-568, 1974.
14. D. G. Kirkpatrick. Establishing order in planar subdivisions. Discrete Comput. Geom., 3:267-280, 1988.
15. C. Levcopoulos and A. Lingas. On approximation behavior of the greedy triangulation for convex polygons. Algorithmica, 2:175-193, 1987.
16. G. Liotta, F. P. Preparata, and R. Tamassia. Robust proximity queries: an illustration of degree-driven algorithm design. SIAM J. Computing, to appear.
17. G. Liotta, F. P. Preparata, and R. Tamassia. Robust proximity queries: an illustration of degree-driven algorithm design. In Proc. ACM Symp. Computational Geometry, 1997.
18. K. Mehlhorn and S. Näher. Checking Geometric Structures, December 1996. Manual.
19. K. Mehlhorn, S. Näher, T. Sehilz, 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.
20. K. Mehlhorn, S. Näher, T. Sehilz, S. Schirra, M. Seel, R. Seidel, and C. Uhrig. Checking geometric programs or verification of geometric structures. Manuscript, 1997.
21. G. F. Sullivan, D. S. Wilson, and G. M. Masson. Certification of computational results. IEEE Transactions on Computers, 44(7):833-847, 1995.