Minimum perimeter convex hull of imprecise points in convex regions

Authors:
Christophe Weibel;Linqiao Zhang
Affiliations:
Dartmouth College, Hanover, NH, USA;Dartmouth College, Hanover, NH, USA
Venue:
Proceedings of the twenty-seventh annual symposium on Computational geometry
Year:
2011

Citing 3
Cited 0

A PTAS for TSP with neighborhoods among fat regions in the plane

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Largest and Smallest Convex Hulls for Imprecise Points

Algorithmica

Quantified Score

Hi-index	0.00

Visualization

Abstract

Imprecise points are points in R2 whose exact location is unknown. For each point, we only know it is contained in a region of R2, which is called the uncertainty region of the point. The research we present in this video focuses on the problem of finding the minimum perimeter convex hull of a set of imprecise points, where each uncertainty region is closed, convex, and the regions may intersect. We first present and animate our theoretical findings: as each point moves inside its uncertainty region, the perimeter of the resulting convex hull is a convex function on the position of the points; as a consequence, any local minimum of the perimeter is a global minimum. We then show the possible positions of imprecise points inside their uncertainty region. Finally, we demonstrate an algorithm for finding the minimum perimeter convex hull of a set of imprecise points.