Largest area convex hull of axis-aligned squares based on imprecise data

DOI10.1007/978-3-642-22685-4_17MaRDI QIDQ3087950zbMATH OpenOpenAlexFDO

Authors Ovidiu Daescu, Wenqi Ju, Jun Luo, Binhai Zhu

Publication date 17 August 2011

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

Full work available at URL https://doi.org/10.1007/978-3-642-22685-4_17

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Largest area convex hull of imprecise data based on axis-aligned squares
• Largest and smallest convex hulls for imprecise points
• Approximation algorithm for the largest area convex hull of same size non-overlapping axis-aligned squares
• Approximating Largest Convex Hulls for Imprecise Points
• Approximating largest convex hulls for imprecise points

Cited in

(5)

• Approximating largest convex hulls for imprecise points
• Approximation algorithm for the largest area convex hull of same size non-overlapping axis-aligned squares
• Largest area convex hull of imprecise data based on axis-aligned squares
• Approximating Largest Convex Hulls for Imprecise Points
• Largest and smallest convex hulls for imprecise points

This page was built for publication: Largest area convex hull of axis-aligned squares based on imprecise data

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