How to make geometric algorithms robust

IEICE Transactions on Information and Systems

Volumn E83-D, Issue 3, 2000, Pages 447-454

  Sugihara, Kokichi ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

Computational geometry; Exact arithmetic; Lazy evaluation; Robust computation; Symbolic perturbation; Topology oriented method

Indexed keywords

COMPUTATIONAL GEOMETRY; GRAPH THEORY; MATRIX ALGEBRA; POLYNOMIALS; TOPOLOGY;

EXACT ARITHMETIC; GEOMETRIC ALGORITHMS; LAZY EVALUATION; SYMBOLIC PERTURBATION; TOPOLOGY ORIENTED METHOD;

ALGORITHMS;

EID: 0034156821     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (29)

1. M. Benouamer D. Michelucci and B. Peroche "Error-free boundary evaluation using lazy rational arithmetic - A detailed implementation" Proc. 2nd Symposium on Solid Modeling and Applications pp.115-126 Montreal 1993.
2. D. Dobkin and D. Silver ''Recipes for geometric and numerical analysis - Part I an empirical study" Proc. 4th ACM Annual Symposium on Computational Geometry UrbanaChampaign pp.93-105 1988.
3. H. Edelsbrunner and E.P. Mücke ''Simulation of simplicity - A technique to cope with degenerate cases in geometric algorithms" Proc. 4th ACM Annual Symposium on Computational Geometry Urbana-Champaign pp. 118-133 1988.
4. D.A. Field "Mathematical problems in solid modeling -
5. A brief survey" ed. G.E. Farin Geometric Modeling - -Algorithms and New Trends SIAM Philadelphia pp.91-107 1987.
6. S. Fortune "Stable maintenance of point-set triangulations in two dimensions" Proc. 30th IEEE Annual Symposium on Foundations of Computer Science Research Triangle Park California pp.494-499 1989.
7. S. Fortune and C. von Wyk "Efficient exact arithmetic for computational geometry" Proc. 9th ACM Annual Symposium on Computational Geometry San Diego pp.163-172 1993.
8. L. Guibas D. Salesin and J. Stolfi "Epsilon geometry - Building robust algorithms from imprecise computations" Proc. 5th ACM Annual Symposium on Computational Geometry pp.208-217 Saarbrücken May 1989.
9. C.M. Hoffmann "The problems of accuracy and robustness in geometric computation" IEEE Comput. vol.22 no.3 pp.31-41 March 1989.
10. C.M. Hoffmann Geometric and Solid Modeling Morgan Kaufmann Publisher San Mateo 1989.
11. T. Imai "A topology-oriented algorithm for the Voronoi diagram of polygon" Proc. 8th Canadian Conference on Computational Geometry pp.107-112 1996.
12. H. Inagaki K. Sugihara and N.N. Sugie "Numerically robust incremental algorithm for constructing three-dimensional Voronoi diagrams" Proc. 4th Canadian Conference Computational Geometry Newfoundland pp.334-339 Aug. 1992.
13. M. Karasick D. Lieber and L.R. Nackman "Efficient Delaunay triangulation using rational arithmetic" ACM Trans. Graphics vol.10 pp.71-91 1991.
14. V. Milenkovic "Verifiable implementations of geometric algorithms using finite precision arithmetic" Artificial Intelligence vol.37 pp.377-401 1988.
15. T. Minakawa and K. Sugihara "Topology oriented vs. exact arithmetic -Experience in implementing the threedimensional convex hull algorithm" Algorithms and Computation 8th International Symposium ISAAC'97 eds. H.W. Leong H. Imai and S. Jain (Lecture Notes in Computer Science 1350) pp.273-282 Singapore Dec. 1997.
16. T. Minakawa and K. Sugihara "Topology-oriented construction of three-dimensional convex hulls" Optimization Methods and Software vol.10 pp.357-371 1998.
17. Y. Oishi and K. Sugihara "Topology-oriented divide-andconquer algorithm for Voronoi diagrams" Computer Vision Graphics and Image Processing: Graphical Models and Image Processing vol.57 pp.303-314 1995.
18. T. Ottmann G. Thiemt and C. Ullrich "Numerical stability of geometric algorithms" Proc. 3rd ACM Annual Symposium on Computational Geometry Waterloo pp.119-125 1987.
19. P. Schorn "Robust algorithms in a program library for geometric computation" Dissertation submitted to the Swiss Federal Institute of Technology (ETH) Zürich for the degree of Doctor of Technical Sciences 1991.
20. M. Segal and C.H. Sequin "Consistent calculations for solid modeling" Proc. ACM Annual Symposium on Computational Geometry pp.29-38 Baltimore 1985.
21. K. Sugihara "A simple method for avoiding numerical errors and degeneracy in Voronoi diagram construction" IEICE Trans. Fundamentals vol.E75-A pp.468-477 1992.
22. K. Sugihara "A robust and consistent algorithm for intersecting convex polyhedra" Computer Graphics Forum EUROGRAPHICS '94 Oslo pp.C-45-C-54 1994.
23. K. Sugihara "Robust gift wrapping for the threedimensional convex hull" J. Computer and System Sciences vol.49 pp.391-407 1994.
24. K. Sugihara "Experimental study on acceleration of an exact-arithmetic geometric algorithm" Proc. 1997 International Conference on Shape Modeling and Applications pp.160-168 Aizu-Wakamatsu 1997.
25. K. Sugihara and M. Iri "A solid modelling system free from topological inconsistency" J. Info. Process. vol.12 pp.380-393 1989.
26. K. Sugihara and M. Iri "Construction of the Voronoi diagram for "one million" generators in single-precision arithmetic" Proc. IEEE vol.80 pp.1471-1484 1992.
27. K. Sugihara and M. Iri "A robust topology-oriented incremental algorithm for Voronoi diagrams" International Journal of Computational Geometry and Applications vol.4 pp.179-228 1994.
28. C.K. Yap "The exact computation paradigm" Computing in Euclidean Geometry 2nd edition eds. D.-Z. Du and F. Hwang pp.452-492 World Scientific Singapore 1995.
29. C.K. Yap "A geometric consistency theorem for a symbolic perturbation scheme" Proc. 4th Annual ACM Symposium on Computational Geometry pp.134-142 UrbanaChampaign 1988.