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

DOI10.1007/s10878-012-9488-5zbMath1282.90151OpenAlexW2003718637MaRDI QIDQ386441

Jun Luo, Ovidiu Daescu, Wenqi Ju, Binhai Zhu

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

convex hullcomputational geometryimprecise data

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (5)

Preclustering algorithms for imprecise points ⋮ Largest convex hulls for constant size, convex-hull disjoint clusters ⋮ 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

Cites Work

• Unnamed Item
• Largest and smallest convex hulls for imprecise points
• An efficient algorithm for determining the convex hull of a finite planar set

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