Implementing geometric algorithms robustly

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

Volumn 1148, Issue , 1995, Pages 15-22

  Guibas, Leonidas J ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY;

GEOMETRIC ALGORITHM; GEOMETRIC STRUCTURE; NUMERICAL DATA; ROBUSTNESS ISSUES;

GEOMETRY;

EID: 84947997584     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (14)

1. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, Mass., 1990.
2. S. Fortune and V. Milenkovic. Numerical stability of algorithms for line ar­rangements. In Proc. 7th Annu. ACM Sympos. Comput. Geom., pages 334­-341, 1991.
3. S. Fortune. Computational geometry. In R. Martin, editor, Directions in Computational Geometry. Information Geometers, 1993. To appear.
4. S. Fortune. Numerical stability of algorithms for 2-d Delaunay triangulations. Internat. J. Comput. Geom. Appl., 5(1):193-213, 1995.
5. S. Fortune. Robustness issues in geometric algorithms. In Proc. 1996 Work­shop on Applied Computational Geometry, page in these proceedings, 1996.
6. S. Fortune and C. J. Van Wyk. Efficient exact arithmetic for computational geometry. In Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 163-172, 1993.
7. Leonidas Guibas and David Marimont. Rounding arrangements dynamically. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 190-199, 1995.
8. L. J. Guibas, D. Salesin, and J. Stolfi. Epsilon geometry: building robust algorithms from imprecise computations. In Proc. 5th Annu. ACM Sympos. Comput. Geom., pages 208-217, 1989.
9. L. Guibas, D. Salesin, and J. Stolfi. Constructing strongly convex approxi­mate hulls with inaccurate primitives. In Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms, volume 450 of Lecture Notes in Computer Science, pages 261-270. Springer-Verlag, 1990.
10. D. H. Greene and F. F. Yao. Finite-resolution computational geometry. In Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci., pages 143-152, 1986.
11. V. J. Milenkovic. Verifiable implementations of geometric algorithms using finite precision arithmetic. Artif. Intell., 37:377-401, 1988.
12. V. Milenkovic. Rounding face lattices in d dimensions. In Proc. 2nd Canad. Conf. Comput. Geom., pages 40-45, 1990.
13. N. E. Mnev. The universality thorems on the classification problem of config­uration varieties and convex polytope varieties. In O.Y. Viro, editor, Topology and Geometry - Rohlin Seminar, pages 527-544. Springer Verlag, 1989.
14. D. Pedoe. Geometry, a comprehensive course. Dover Publications, New York, 1970.