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

DOI10.1007/978-3-540-73951-7_39zbMath1209.68586OpenAlexW1737711602MaRDI QIDQ3603548

Maarten Löffler, Marc J. 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)

Related Items (6)

Largest and smallest convex hulls for imprecise points ⋮ Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments ⋮ Data imprecision under \(\lambda\)-geometry model ⋮ Triangulating input-constrained planar point sets ⋮ Approximating Largest Convex Hulls for Imprecise Points ⋮ On Some Proximity Problems of Colored Sets

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