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

DOI10.1007/S10878-012-9488-5MaRDI QIDQ386441zbMATH OpenOpenAlexFDO

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

Publication date 9 December 2013

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-012-9488-5

zbMATH Keywords

imprecise datacomputational geometryconvex hull

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Largest area convex hull of axis-aligned squares based on imprecise data
• 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

Cites work

• An efficient algorithm for determining the convex hull of a finite planar set
• Introduction to algorithms.
• Largest and smallest convex hulls for imprecise points

Cited in

(7)

• Preclustering algorithms for imprecise points
• Largest convex hulls for constant size, convex-hull disjoint clusters
• Largest area convex hull of axis-aligned squares based on imprecise data
• Largest and smallest area triangles on imprecise points
• A fully polynomial time approximation scheme for the smallest diameter of imprecise points
• Expected computations on color spanning sets
• Approximation algorithm for the largest area convex hull of same size non-overlapping axis-aligned squares

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

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