Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points

DOI10.1007/978-3-540-73951-7_39MaRDI QIDQ3603548zbMATH OpenOpenAlexFDO

Authors Maarten Löffler, Marc Van Kreveld

Publication date 17 February 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73951-7_39

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Largest bounding box, smallest diameter, and related problems on imprecise points
• Data imprecision under \(\lambda\)-geometry model
• Largest and smallest convex hulls for imprecise points
• Largest and Smallest Tours and Convex Hulls for Imprecise Points
• Approximating largest convex hulls for imprecise points

Cited in

(9)

• Largest and smallest convex hulls for imprecise points
• On some proximity problems of colored sets
• Approximating Largest Convex Hulls for Imprecise Points
• Largest bounding box, smallest diameter, and related problems on imprecise points
• Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments
• A fully polynomial time approximation scheme for the smallest diameter of imprecise points
• Triangulating input-constrained planar point sets
• Minimizing the diameter of a spanning tree for imprecise points
• Data imprecision under \(\lambda\)-geometry model

This page was built for publication: Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603548)