Largest and Smallest Tours and Convex Hulls for Imprecise Points

DOI10.1007/11785293_35MaRDI QIDQ5757883zbMATH OpenOpenAlexFDO

Authors Maarten Löffler, Marc Van Kreveld

Publication date 7 September 2007

Published in Algorithm Theory – SWAT 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11785293_35

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Largest and smallest convex hulls for imprecise points
• Approximating Largest Convex Hulls for Imprecise Points
• Approximating largest convex hulls for imprecise points
• Existence and computation of tours through imprecise points
• Largest bounding box, smallest diameter, and related problems on imprecise points

This page was built for publication: Largest and Smallest Tours and Convex Hulls for Imprecise Points

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