Robust geometric computation based on topological consistency

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

Volumn 2073, Issue , 2001, Pages 12-26

  Sugihara, Kokichi ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; TOPOLOGY;

GEOMETRIC ALGORITHM; GEOMETRIC COMPUTATIONS; GEOMETRIC OBJECTS; NUMERICAL ERRORS; NUMERICAL VALUES; NUMERICALLY ROBUST; TOPOLOGICAL CONSISTENCY; TOPOLOGICAL STRUCTURE;

NUMERICAL METHODS;

EID: 84949665115     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45545-0_10     Document Type: Conference Paper

References (46)

1. M. Benouamer, D. Michelucci and B. Peroche: Error-free boundary evaluation using lazy rational arithmetic—A detailed implementation. Proceedings of the 2nd Symposium on Solid Modeling and Applications, Montreal, 1993, pp. 115–126.
2. H. Brönnimann, I. Z. Emiris, V. Y. Pan and S. Pion: Computing exact geometric predicates using modular arithmetic with single precision. Proceedings of the 13th Annual ACM Symposium on Computational Geometry, Nice, June 1997, pp. 1-182.
3. H. Brönnimann and M. Yvinec: Efficient exact evaluation of signs of determinants. Proceedings of the 13th Annual ACM Symposium on Computational Geometry, Nice, June 1997, pp. 166-173.
4. K. L. Clarkson: Safe and effective determinant evaluation. Proceedings of the 33rd IEEE Symposium on Foundation of Computer Science, pp. 387-395.
5. D. Dobkin and D. Silver: Recipes for geometric and numerical analysis—Part I, An empirical study. Proceedings of the 4th ACM Annual Symposium on Computational Geometry, Urbana-Champaign, 1988, pp. 93–105.
6. H. Edelsbrunner and E. P. Mücke: Simulation of simplicity—A technique to cope with degenerate cases in geometric algorithms. Proceedings of the 4th ACM Annual Symposium on Computational Geometry, Urbana-Champaign, 1988, pp. 118–133.
7. D. A. Field: Mathematical problems in solid modeling—A brief survey. G. E. Farin (ed.), Geometric Modeling—Algorithms and New Trends, SIAM, Philadelphia, 1987, pp. 91–107.
8. S. Fortune: Stable maintenance of point-set triangulations in two dimensions. Proceedings of the 30th IEEE Annual Symposium on Foundations of Computer Science, Research Triangle Park, California, 1989, pp.94–499.
9. S. Fortune: Numerical stability of algorithms for 2D Delaunay triangulations. International Journal of Computational Geometry and Applications, vol. 5 (1995), pp. 193-213.
10. S. Fortune and C. von Wyk: Efficient exact arithmetic for computational geometry. Proceedings of the 9th ACM Annual Symposium on Computational Geometry, San Diego, 1993, pp. 163–172.
11. D. H. Greene and F. Yao: Finite resolution computational geometry. Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, Toronto, October 1986, pp. 3-152.
12. L. Guibas, D. Salesin and J. Stolfi: Epsilon geometry—Building robust algorithms from imprecise computations. Proc. 5th ACM Annual Symposium on Computational Geometry (Saarbrücken, May 1989), pp. 208–217.
13. T. Hiroshima, Y. Miyamoto and K. Sugihara: Another proof of polynomial-time recognizability of Delaunay graphs. IEICE Transactions on Fundamentals, Vol. E83-A (2000), pp. 627-638.
14. C. D. Hodgson, I. Rivin and W. D. Smith: A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere. Bulletin of the American Mathematical Society, vol. 27 (1992), pp. 6-251.
15. C. M. Hoffmann: The problems of accuracy and robustness in geometric computation. IEEE Computer, vol. 22, no. 3 (March 1989), pp. 31-1.
16. C. M. Hoffmann: Geometric and Solid Modeling. Morgan Kaufmann Publisher, San Mateo, 1989.
17. T. Imai: A topology-oriented algorithm for the Voronoi diagram of polygon. Proceedings of the 8th Canadian Conference on Computational Geometry, 1996, pp. 107–112.
18. T. Imai: How to get the sign of integers from their residuals. Abstracts of the 9th Franco-Japan Days on Combinatorics and Optimization, 1996, p. 7.
19. H. Inagaki and K. Sugihara: Numerically robust algorithm for constructing constrained Delaunay triangulation. Proceedings of the 6th Canadian Conference on Computational Geometry, Saskatoon, August 19, pp. 171-176.
20. H. Inagaki, K. Sugihara and N. Sugie, N.: Numerically robust incremental algorithm for constructing three-dimensional Voronoi diagrams. Proceedings of the 6th Canadian Conference Computational Geometry, Newfoundland, August 1992, pp. 3–339.
21. M. Karasick, D. Lieber and L. R. Nackman: Efficient Delaunay triangulation using rational arithmetic. ACM Transactions on Graphics, vol. 10 (1991), pp. 71–91.
22. D. E. Knuth: Axioms and Hulls. Lecture Notes in Computer Science, no. 606, Springer-Verlag, Berlin, 1992.
23. G. Liotta, F. P. Preparata and R. Tamassia: Robust proximity queries — An illustration of degree-driven algorithm design. Proceedings of the 13th Annual ACM Symposium on Computational Geometry, 1997, pp. 156-165.
24. K. Mehlhorn and S. Näher: A platform for combinatorial and geometric computing. Communications of the ACM, January 1995, pp. 96-102.
25. V. Milenkovic: Verifiable implementations of geometric algorithms using finite precision arithmetic. Artificial Intelligence, vol. 37 (1988), pp. 377-01.
26. T. Minakawa and K. Sugihara: Topology oriented vs. exact arithmetic—experience in implementing the three-dimensional convex hull algorithm. H. W. Leong, H. Imai and S. Jain (eds.): Algorithms and Computation, 8th International Symposium, ISAAC’97 (Lecture Notes in Computer Science 1350), (December, 1997, Singapore), pp. 273–282.
27. T. Minakawa and K. Sugihara: Topology-oriented construction of threedimensional convex hulls. Optimization Methods and Software, vol. 10 (1998), pp. 357–371.
28. Y. Oishi and K. Sugihara: Topology-oriented divide-and-conquer algorithm for Voronoi diagrams. Computer Vision, Graphics, and Image Processing: Graphical Models and Image Processing, vol. 57 (1995), pp. 303–3.
29. T. Ottmann, G. Thiemt and C. Ullrich: Numerical stability of geometric algorithms. Proceedings of the 3rd ACM Annual Symposium on Computational Geometry, Waterloo, 1987, pp. 119–125.
30. 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.
31. M. Segal and C. H. Sequin: Consistent calculations for solid modeling. Proceedings of the ACM Annual Symposium on Computational Geometry, Baltimore, 1985, pp. 29–38.
32. J. R. Shewchuk: Robust adaptive floating-point geometric predicates. Proceedings of the 12th Annual ACM Symposium on Computational Geometry, Philadelphia, May 1996, pp. 1-150.
33. E. Steinitz: Polyheder und Raumeinteilungen. Encyklopädie der mathematischen Wissenchaften, Band III, Teil 1, 2. Hälfte, IIIAB12, pp. 1-139.
34. A. J. Steward: Local robustness and its application to polyhedral intersection. International Journal of Computational Geometry and Applications, vol. (1994), pp. 87-118.
35. K. Sugihara: A simple method for avoiding numerical errors and degeneracy in Voronoi diagram construction. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E75-A (1992), pp.68–477.
36. K. Sugihara: An intersection algorithm based on Delaunay triangulation. IEEE Computer Graphics and Applications, vol. 12, no. 2 (March 1992), pp. 59-67.
37. K. Sugihara: Approximation of generalized Voronoi diagrams by ordinary Voronoi diagrams. Computer Vision, Graphics, and Image Processing: Graphical Models and Image Processing, vol. 55 (1993), pp. 522-531.
38. K. Sugihara: A robust and consistent algorithm for intersecting convex polyhedra. Computer Graphics Forum, EUROGRAPHICS’94, Oslo, 1994, pp. C-45-54.
39. K. Sugihara: Robust gift wrapping for the three-dimensional convex hull. Journal of Computer and System Sciences, vol.9 (1994), pp. 391–407.
40. K. Sugihara: Experimental study on acceleration of an exact-arithmetic geometric algorithm. Proceedings of the 1997 International Conference on Shape Modeling and Applications, Aizu-Wakamatsu, 1997, pp. 160–168.
41. K. Sugihara and M. Iri: A solid modelling system free from topological inconsistency. Journal of Information Processing, vol. 12 (1989), pp. 380–393.
42. K. Sugihara and M. Iri: Construction of the Voronoi diagram for “one million” generators in single-precision arithmetic. Proceedings of the IEEE, vol. 80 (1992), pp. 71–1484.
43. K. Sugihara and M. Iri: A robust topology-oriented incremental algorithm for Voronoi diagrams. International Journal of Computational Geometry and Applications, vol. (1994), pp. 179–228.
44. C. K. Yap: A geometric consistency theorem for a symbolic perturbation scheme. Proceedings of the 4th Annual ACM Symposium on Computational Geometry, Urbana-Champaign, 1988, pp. 1–142.
45. C. K. Yap: The exact computation paradigm. D.-Z. Du and F. Hwang (eds.): Computing in Euclidean Geometry, 2nd edition. World Scientific, Singapore, 1995, pp.52–492.
46. X. Zhu, S. Fang and B. D. Brüderlin: Obtaining robust Boolean set operations for manifold solids by avoiding and eliminating redundancy. Proceedings of the 2nd Symposium on Solid Modeling and Applications, Montreal, May 1993, pp. 7-154.