Checking the convexity of polytopes and the planarity of subdivisions

Computational Geometry: Theory and Applications

Volumn 11, Issue 3-4, 1998, Pages 187-208

  Devillers, Olivier ^a   Liotta, Giuseppe ^b   Preparata, Franco P ^c   Tamassia, Roberto ^c  

^a INRIA   (France)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346838140     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(98)00039-X     Document Type: Article

References (24)

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, R. Tamassia, Classical computational geometry in GeomNet, in: Proc. 13th Annu. ACM Sympos. Comput. Geom., 1997, pp. 412-414.
3. J.L. Bentley, T.A. Ottmann, Algorithms for reporting and counting geometric intersections, IEEE Trans. Comput. 28 (1979) 643-647.
4. M. Blum, S. Kannan, Designing programs that check their work, J. ACM 42 (1) (1995) 269-291.
5. C. Burnikel, Exact computation of Voronoi diagrams and line segment intersections, Ph.D Thesis, Universität des Saarlandes, 1996.
6. B. Chazelle, Triangulating a simple polygon in linear time, Discrete Comput. Geom. 6 (1991) 485-524.
7. F. d'Amore, P.G. Franciosa, G. Liotta, A robust region approach to the computation of geometric graphs, in: Proceedings the 6th European Symposium on Algorithms, Lecture Notes Computer Science, Vol. 1461, Springer, New York, 1998, pp. 175-186.
8. G. Di Battista, R. Tamassia, L. Vismara, On-line convex planarity testing, in: Graph-Theoretic Concepts in Computer Science (Proc. WG '94), Lecture Notes Computer Science, Vol. 903, Springer, New York, 1995, pp. 242-255.
9. G. Di Battista, R. Tamassia, L. Vismara, On-line convex planarity testing, Technical Report CS-95-26, Department of Computer Science, Brown University, August 1995.
10. G. Di Battista, L. Vismara, Angles of planar triangular graphs, SIAM J. Discrete Math. 9 (3) (1996) 349-359.
11. I. Fary, On straight lines representation of planar graphs, Acta Sci. Math. Szeged 11 (1948) 229-233.
12. S. Gottschalk, M.C. Lin, D. Manocha, OBB-tree: A hierarchical structure for rapid interference detection, Comput. Graphics (1996) 171-180.
13. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1972.
14. J. Hopcroft, R.E. Tarjan, Efficient planarity testing, J. ACM 21 (4) (1974) 549-568.
15. D.G. Kirkpatrick, Establishing order in planar subdivisions, Discrete Comput. Geom. 3 (1988) 267-280.
16. S.M. Lane, A structural characterization of planar combinatorial graphs, Duke Math. J. 3 (3) (1937) 460-472.
17. C. Levcopoulos, A. Lingas, On approximation behavior of the greedy triangulation for convex polygons, Algorithmica 2 (1987) 175-193.
18. G. Liotta, F.P. Preparata, R. Tamassia, Robust proximity queries: an illustration of degree-driven algorithm design, SIAM J. Comput., to appear.
19. G. Liotta, F.P. Preparata, R. Tamassia, Robust proximity queries: an illustration of degree-driven algorithm design, in: Proc. 13th Annu. ACM Sympos. Comput. Geom., 1997, pp. 156-165.
20. K. Mehlhorn, S. Näher, Checking Geometric Structures, Program Documentation, December 1996.
21. K. Mehlhorn, S. Näher, T. Schilz, S. Schirra, M. Seel, R. Seidel, C. Uhrig, Checking geometric programs or verification of geometric structures, in: Proc. 12th Annu. ACM Sympos. Comput. Geom., 1996, pp. 159-165.
22. K. Mehlhorn, S. Näher, T. Schilz, S. Schirra, M. Seel, R. Seidel, C. Uhrig, Checking geometric programs or verification of geometric structures, Manuscript, 1997.
23. G.F. Sullivan, D.S. Wilson, G.M. Masson, Certification of computational results, IEEE Trans. Comput. 44 (7) (1995) 833-847.
24. C. Yap, Towards exact geometric computation, Computational Geometry 7 (1-2) (1997) 3-23.