Approximation algorithm for the largest area convex hull of same size non-overlapping axis-aligned squares

DOI10.1007/978-3-642-14553-7_28MaRDI QIDQ3587361zbMATH OpenOpenAlexFDO

Authors Wenqi Ju, Jun Luo

Publication date 7 September 2010

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14553-7_28

zbMATH Keywords

imprecise datacomputational geometryconvex hull

Mathematics Subject Classification ID

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

Recommendations

• Largest area convex hull of axis-aligned squares based on imprecise data
• Largest area convex hull of imprecise data based on axis-aligned squares
• Constrained square-center problems
• Approximating Largest Convex Hulls for Imprecise Points
• Approximating largest convex hulls for imprecise points

Cited in

(2)

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

This page was built for publication: Approximation algorithm for the largest area convex hull of same size non-overlapping axis-aligned squares

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