Approximating largest convex hulls for imprecise points

DOI10.1016/j.jda.2008.04.002zbMath1154.68544OpenAlexW2026291033MaRDI QIDQ1002103

Maarten Löffler, Marc J. van Kreveld

Publication date: 23 February 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2008.04.002

zbMATH Keywords

convex hullcomputational geometrydata imprecisioncore-sets

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (9)

On the Power of the Semi-Separated Pair Decomposition ⋮ Minimum color spanning circle of imprecise points ⋮ Convex hulls under uncertainty ⋮ Visibility testing and counting for uncertain segments ⋮ Minimum-perimeter intersecting polygons ⋮ On the power of the semi-separated pair decomposition ⋮ New results on stabbing segments with a polygon ⋮ Scandinavian thins on top of cake: new and improved algorithms for stacking and packing ⋮ Largest bounding box, smallest diameter, and related problems on imprecise points

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robustness of numerical methods in geometric computation when problem data is uncertain
• Largest and smallest convex hulls for imprecise points
• Constructing strongly convex hulls using exact or rounded arithmetic
• Structural tolerance and Delaunay triangulation
• Systems of distant representatives
• Constructing strongly convex approximate hulls with inaccurate primitives
• APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
• An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Analysis of incomplete data and an intrinsic-dimension Helly theorem

This page was built for publication: Approximating largest convex hulls for imprecise points