Topology-oriented divide-and-conquer algorithm for voronoi diagrams

Graphical Models and Image Processing

Volumn 57, Issue 4, 1995, Pages 303-314

  Oishi, Yasuaki ^a   Sugihara, Kokichi ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; COMPUTER SOFTWARE; ERROR ANALYSIS; ERRORS; TOPOLOGY;

DIVIDE AND CONQUER ALGORITHM; ERROR BOUND; NUMERICAL ROBUSTNESS; VORONOI DIAGRAMS;

ALGORITHMS;

EID: 0029342464     PISSN: 10773169     EISSN: None     Source Type: Journal    
DOI: 10.1006/gmip.1995.1027     Document Type: Article

References (20)

1. J. M. Benouamer, D. Michelucci, and B. Peroche, Error-free boundary evaluation using lazy rational arithmetic-A detailed implementation, in Proceedings of the 2nd Symposium on Solid Modeling and Applications, Montreal, 1993, pp. 115-126.
2. M. B. Dillencourt, Toughness and Delaunay triangulations, Discrete Comput. Geom. 5, 1990, 575-601.
3. J.W. B. Dillencourt, Reliazability of Delaunay triangulations, Inform. Process. Lett. 33, 1990, 283-287.
4. L. Guibas, D. Salesin, and J. Stolfi, Epsilon geometry-Building robust algorithms from imprecise computations, in Proceedings of the 5th ACM Annual Symposium on Computational Geometry, Saarbrücken, 1989, pp. 208-217.
5. L. Guibas and J. Stolft, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams, ACM Trans. Graphics 4, 1985, 74-123.
6. C-M. Hoffmann, Geometric and Solid Modeling, Morgan Kaufmann, San Mateo, CA, 1989.
7. C. M. Hoffmann, The problems of accuracy and robustness in geometric computation, Computer 22(3), 1989, 31-41.
8. J. Katajainen and M. Koppinen, Constructing Delaunay triangulations by merging buckets in quadtree order, Fundament. Inform. 11, 1988, 275-288.
9. D. T. Lee and B. J. Schächter, Two algorithms for constructing a Delaunay triangulation, Int. J. Comput. Inform. Sci. 9, 1980, 219-242.
10. V. Milenkovic, Verifiable implementations of geometric algorithms using finite-precision arithmetic, Artif Inteli 37, 1988, 377-401.
11. T. Ohya, M. Iri, and K. Murota, Improvements of the incremental method for the Voronoi diagram with computational comparisons of various algorithms, J. Oper. Res. Soc. Jpn. 27, 1984, 306-336.
12. Y. Oishi, Numerical stabilization of the divide-and-conquer algorithm for computing Voronoi diagrams. Dissertation for the Bachelor’s Degree, Department of Mathematical Engineering and Information Physics, Faculty of Engineering, University of Tokyo, 1990.
13. Y. Oishi and K. Sugihara, Numerically robust divide-and-conqueT algorithm for constructing Voronoi diagrams, J. Inform. Process. Soc. Jpn. 32, 1991, 709-720.
14. T. Ottmann, G. Thiemt, and C. Ullrich, Numerical stability of geometric algorithms, in Proceedings of the 3rd ACM Annual Symposium on Computational Geometry, Waterloo, 1987, pp. 119-125.
15. F. P. Preparata and M. I. Shamos, Computational Geometry-An Introduction, Springer-Verlag, New York, 1985.
16. K. Sugihara, Topologically consistent algorithms related to convex polyhedra, in Proceedings of the 3rd International Symposium on Algorithms and Computation, ISAAC’92, Nagoya (Lecture Notes in Computer Science 650), 1992, pp. 209-218.
17. K. Sugihara, Simpler proof of a realizability theorem on Delaunay triangulations, Inform. Process. Lett. 50, 1994, 173-176.
18. K. Sugihara and M. Iri, A solid modelling system free from topological inconsistency, J. Inform. Process. 12, 1989, 380-393.
19. K. Sugihara and M. Iri, Construction of the Voronoi diagram for "‘one million” generators in single-precision arithmetic, Proc. IEEE 80, 1992, 1471-1484.
20. K. Sugihara and M. Iri, A robust topology-oriented incremental algorithm for Voronoi diagrams, Int. J. Comput. Geom. Appl 4, 1994, 179-228.