Hausdorff approximation of 3D convex polytopes

Information Processing Letters

Volumn 107, Issue 2, 2008, Pages 76-82

  Lopez, Mario A ^a   Reisner, Shlomo ^b  

^a UNIVERSITY OF DENVER   (United States)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

Approximation algorithms; Convex polytopes; Hausdorff distance

Indexed keywords

APPROXIMATION THEORY; OPTIMIZATION; RANDOM PROCESSES; THREE DIMENSIONAL;

CONVEX POLYTOPES; HAUSDORFF ALGORITHMS; HAUSDORFF DISTANCE; VOLUME DIFFERENCE APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 44449158047     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.01.010     Document Type: Article

References (20)

1. Brönnimann H., and Goodrich M. Almost optimal set covers in finite VC-dimensions. Discrete Comput. Geom. 14 (1995) 463-479
2. Bronshtein E.M., and Ivanov L.D. The approximation of convex sets by polyhedra. Siberian Math. J. 16 (1975) 852-853 (English translation)
3. Chan T.M. Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete Comput. Geom. 16 (1996) 361-368
4. Chan T.M. Faster core-set constructions and data-stream algorithms in fixed dimensions. Comput. Geom. 35 (2006) 20-35
5. Chazelle B., and Matoušek J. Derandomizing an output-sensitive convex hull algorithm in three dimensions. Comput. Geom. 5 (1995) 27-32
6. Clarkson K.L. Algorithms for polytope covering and approximation. Proceedings of the 3rd Workshop on Algorithms and Data Structures. Lecture Notes in Computer Science vol. 709 (1993), Springer-Verlag 246-252
7. Dobkin D.P., and Kirkpatrick D.G. Determining the separation of preprocessed polyhedra-a unified approach. Proc. 17th Internat. Colloq. Automata Lang. Program. Lecture Notes in Computer Science vol. 443 (1990), Springer-Verlag 400-413
8. Dudley R.M. Metric entropy of some classes of sets with differentiable boundaries. J. Approx. Theory 10 (1974) 227-236
9. Gordon Y., Meyer M., and Reisner S. Constructing a polytope to approximate a convex body. Geom. Dedicata 57 (1995) 217-222
10. Gordon Y., Reisner S., and Schütt C. Umbrellas and polytopal approximation of the Euclidean ball. J. Approx. Theory 90 (1997) 9-22
11. Gruber P.M. Aspects of approximation of convex bodies. In: Gruber P.M., and Wills J.M. (Eds). Handbook of Convex Geometry (1993), North-Holland 319-345
12. Gruber P.M. Approximation by convex polytopes. In: Bistriczky T., et al. (Ed). Polytopes: Abstract, Convex and Computational (1994), Kluwer Academic Publishers 173-203
13. Kirkpatrick D.G. Optimal search in planar subdivisions. SIAM J. Comput. 12 (1983) 28-35
14. Lopez M.A., and Reisner S. Algorithms for polyhedral approximation of multidimensional ellipsoids. J. Algorithms 33 (1999) 140-165
15. Lopez M.A., and Reisner S. Linear time approximation of 3D convex polytopes. Comput. Geom. 23 (2002) 291-301
16. Lopez M.A., and Reisner S. Hausdorff approximation of convex polygons. Comput. Geom. 32 (2005) 139-158
17. Mankiewicz P., and Schütt C. On the Delone triangulation numbers. J. Approx. Theory 111 (2001) 139-142
18. O'Rourke J. Computational Geometry in C. second ed. (1998), Cambridge University Press
19. Preparata F.P., and Hong S.J. Convex hulls of finite sets of points in two and three dimensions. Comm. ACM 20 (1977) 87-93
20. Reisner S., Schütt C., and Werner E. Dropping a vertex or a facet from a convex polytope. Forum Math. 13 (2001) 359-378