Robust gift wrapping for the three-dimensional convex hull

Journal of Computer and System Sciences

Volumn 49, Issue 2, 1994, Pages 391-407

  Sugihara, Kokichi ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; DIGITAL ARITHMETIC; GEOMETRY; MANY VALUED LOGICS; ROBUSTNESS (CONTROL SYSTEMS); THREE DIMENSIONAL; TOPOLOGY;

COMPUTATIONAL GEOMETRY; ISOMORPHIC BOUNDARY; ROBUST GIFT WRAPPING; THREE DIMENSIONAL CONVEX HULLS;

ALGORITHMS;

EID: 0028517947     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/S0022-0000(05)80056-X     Document Type: Article

References (20)

1. C. E. Buckley, A divide-and-conquer algorithm for computing 4-dimensional convex hull, in “International Workshop on Computational Geometry, Wurzburg, March 1988,” Lecture Notes in Computer Science, Vol. 333, pp. 113-135, Springer-Verlag, Berlin, 1988.
2. D. R. Chand and S. S. Kapur, An algorithm for convex polytopes, J. Assoc. Comput. Mach. 17 (1970), 78-86.
3. B. M. Chazelle, “An Optimal Convex Hull Algorithm for Point Sets in Any Dimension,” Technical Report CS-TR-336-91, Princeton University, 1991.
4. W. Eddy, A new convex hull algorithm for planar sets, ACM Trans. Math. Software 3 (1977), 398-403.
5. S. Fortune, Stable maintenance of point-set triangulations in two dimensions, in “Proceedings, 30th Annual Symposium on Foundations of Computer Science,” pp. 494-499, IEEE Comput. Soc. Press, Los Alamitos, CA, 1989.
6. R. L. Graham, An efficient algorithm for determining the convex hull of a finite planar set, Inform. Process. Lett. 1 (1972), 132-133.
7. L. Guibas, D. Salesin, and J. Stolfi, Epsilon geometry—Building robust algorithms from imprecise calculations, in “Proceedings, 5th Annual Symposium on Computational Geometry,” pp. 208-217, ACM Press, New York, 1989.
8. J E. Hopcroft and P. J. Kahn, “A Paradigm for Robust Geometric Algorithms,” Technical Report TR89-1044, Department of Computer Science, Cornell University, 1989.
9. R. A. Jarvis, On the identification of the convex hull of a finite set of points in the plane, Inform. Process. Lett. 2 (1973), 18-21.
10. L. A. Lyusternik (T. J. Smith, trans.), “Convex Figures and Polyhedra,” Dover, New York, 1963.
11. V. J. Milenkovic, Verifiable implementations of geometric algorithms using finite precision arithmetic, in “Geometric Reasoning” (D. Kapur and J. L. Mundy, Eds.), pp. 377-401, MIT Press, Cambridge, MA, 1989.
12. W. O. J. Moser, Problems, problems, problems, Discrete App. Math. 31 (1991), 201-225.
13. F. P. Preparata and S. J. Hong, Convex hulls of finite sets of points in two and three dimensions, Comm. ACM 2 (1977), 87-93.
14. F. P. Preparata and M. I. Shamos, “Computational Geometry—An Introduction,” Springer- Verlag, New York, 1985.
15. R. Seidel, Constructing higher-dimensional convex hulls at logarithmic cost per face, in “Proceedings, 18th Annual ACM Symposium on Theory of Computing, 1986,” pp. 404-413.
16. E. Steinitz, Polyeder und Raumeinteilungen, in “Encyklopadie der mathematischen Wissen- schaften,” Band III, Teil 1, 2. Halfte, IIIAB12, pp. 1-139, 1916.
17. K. Sugihara, Topologically consistent algorithms related to convex polyhedra, in “Third International Symposium on Algorithms and Computation, Nagoya, 1992,” Lecture Notes in Computer Science, Vol. 650, pp. 209-218. Springer-Verlag, Berlin, 1992.
18. K. Sugihara and M. Iri, Two design principles of geometric algorithms in finite-precision arithmetic, Appl. Math. Lett. 2 (1989), 203-206.
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. G. Swart, Finding the convex hull facet by facet, J. Algorithms 6 (1985), 17-48.