Constructing strongly convex hulls using exact or rounded arithmetic

DOI10.1007/BF01758851zbMath0772.68104MaRDI QIDQ1201743

Zhen-Yu Li, Victor J. Milenkovic

Publication date: 17 January 1993

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

convex hullrobust geometryexact rational arithmeticstrong and weak convexity

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Roundoff error (65G50)

Related Items (10)

Constructing strongly convex approximate hulls with inaccurate primitives ⋮ Largest and smallest convex hulls for imprecise points ⋮ Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties ⋮ Three-dimensional unstructured mesh generation. III: Volume meshes ⋮ EXISTENCE AND COMPUTATION OF TOURS THROUGH IMPRECISE POINTS ⋮ Euclidean minimum spanning trees with independent and dependent geometric uncertainties ⋮ CONSTRUCTING A STRONGLY CONVEX SUPERHULL OF POINTS ⋮ Approximating largest convex hulls for imprecise points ⋮ Robust algorithms for constructing strongly convex hulls in parallel. ⋮ Structural tolerance and Delaunay triangulation

Cites Work

• Verifiable implementations of geometric algorithms using finite precision arithmetic
• Constructing strongly convex approximate hulls with inaccurate primitives
• An efficient algorithm for determining the convex hull of a finite planar set

This page was built for publication: Constructing strongly convex hulls using exact or rounded arithmetic