Topology-oriented construction of three-dimensional convex hulls

Optimization Methods and Software

Volumn 10, Issue 2, 1998, Pages 357-371

  Minakawa, Tsuyoshi ^a   Sugihara, Kokichi ^b  

^a HITACHI LTD   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

Convex hull; Divide and conquer; Robustness; Topological barrier; Topology oriented algorithm

Indexed keywords

EID: 0345758006     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556789808805719     Document Type: Article

References (20)

1. F. Aurenhammer (1991) Voronoi diagrams - A survey of a fundamental geometric data structure, ACM Computing Surveys, 22, 345-405.
2. M. Benouamer, D. Michelucci and B. Peroche (1993) Error-free boundary evaluation using lazy rational arithmetic, A detailed implementation. Proceedings of the 2nd Symposium on Solid Modeling and Applications, Montreal, pp. 115-126.
3. A.M. Day (1990) The implementation of an algorithm to find the convex hull of a set of three-dimensional points, ACM Transactions on Graphics, 9, 105-132.
4. H. Edelsbrunner (1987) Algorithms in Combinatorial Geometry, Springer-Verlag, Berlin.
5. H. Edelsbrunner and E.P. Mücke (1988) Simulation of simplicity - A technique to cope with degenerate cases in geometric algorithms, Proceedings of the 4th ACM Symposium on Computational Geometry, Urbana-Champaign, pp. 118-133.
6. S. Fortune (1992) Voronoi diagrams and Delaunay triangulations. in D.-Z. Du and F. Hwang (eds.), Computing in Euclidean Geometry, World Scientific, Singapore, pp. 193-234.
7. S. Fortune and C. von Wyk (1993) Efficient exact arithmetic for computational geometry, Proceedings of the 9th ACM Annual Symposium on Computational Geometry, San Diego, pp. 163-172.
8. L. Guibas, D. Salesin and J. Stolfi (1989) Epsilon geometry - Building robust algorithms from imprecise calculations, Proceedings of the 5th ACM Annual Symposium on Computational Geometry, Saarbrücken, pp. 208-217.
9. H. Inagaki, K. Sugihara and N. Sugie (1992) Numerically robust incremental algorithm for constructing three-dimensional Voronoi diagrams, Proceedings of the 4th Canadian Conference on Computational Geometry, St. John's, pp. 334-449.
10. V. Milenkovic (1988) Verifiable implementation of geometric algorithms using finite precision arithmetic, Artificial Intelligence, 37, 377-401.
11. A. Okabe, B. Boots and K. Sugihara (1992) Spatial Tessellations - Concepts and Applications of Voronoi Diagrams, John Wiley and Sons, Inc., Chichester.
12. T. Ono (1994) An eight-way perturbation technique for the three-dimensional convex hull, Proceedings of the 6th Canadian Conference on Computational Geometry, Saskatoon, pp. 159-164.
13. F.P. Preparata and M.I. Shamos (1985) Computational Geometry - An Introduction. Springer-Verlag, New York.
14. P. Schorn (1991) Robust algorithms in a program library for geometric computation, Dissertation submitted to the Swiss Federal Institute of Technology (ETH) Zurick for the degree of Doctor of Technical Sciences.
15. E. Steinitz (1916) Polyeder und Raumeinteilungen, Encyklopädie der mathematischen Wissenschaften, Band III, Teil 1, 2. Halfte, IIIAB12, 1-139.
16. K. Sugihara (1994) A robust and consistent algorithm for intersecting convex polyhedra, EUROGRAPHICS'94, Oslo, C-45-C-54.
17. K. Sugihara (1997) Experimental study on acceleration of an exact-arithmetic geometric algorithm, Proceedings of the 1997 International Conference on Shape Modeling and Applications, Aizu-Wakamatsu, pp. 160-168.
18. K. Sugihara and M. Iri (1992) Construction of the Voronoi diagram for "one million" generators in single-precision arithmetic, Proceedings of the IEEE, 80, pp. 1471-1488.
19. C.-K. Yap (1990) Symbolic treatment of geometric degeneracies, Journal of Symbolic Computation, 10, 349-370.
20. C.-K. Yap (1993) Toward exact geometric computation, Proceedings of the 5th Canadian Conference on Computational Geometry, Waterloo, pp. 405-419.