Approximating Largest Convex Hulls for Imprecise Points

DOI10.1007/978-3-540-77918-6_8zbMath1130.90390MaRDI QIDQ5443375

Maarten Löffler, Marc J. van Kreveld

Publication date: 20 February 2008

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77918-6_8

Mathematics Subject Classification ID

90C27: Combinatorial optimization

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W25: Approximation algorithms

Related Items

Largest and smallest convex hulls for imprecise points, Delaunay triangulation of imprecise points in linear time after preprocessing, Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structural tolerance and Delaunay triangulation
• Systems of distant representatives
• Constructing strongly convex approximate hulls with inaccurate primitives
• Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points
• 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
• Largest and Smallest Tours and Convex Hulls for Imprecise Points
• Analysis of incomplete data and an intrinsic-dimension Helly theorem