An optimal algorithm for the intersection radius of a set of convex polygons
Journal of Algorithms
Structural tolerance and delauny triangulation
Information Processing Letters
Maintaining approximate extent measures of moving points
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Almost-Delaunay simplices: nearest neighbor relations for imprecise points
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Analysis of incomplete data and an intrinsic-dimension Helly theorem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A fast k-means implementation using coresets
Proceedings of the twenty-second annual symposium on Computational geometry
Systems of distant representatives
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Largest and smallest tours and convex hulls for imprecise points
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Largest bounding box, smallest diameter, and related problems on imprecise points
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
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
Hi-index | 0.00 |
Assume that a set of imprecise points is given, where each point is specified by a region in which the point will lie. Such a region can be modelled as a circle, square, line segment, etc. We study the problem of maximising the area of the convex hull of such a set. We prove NP-hardness when the imprecise points are modelled as line segments, and give linear time approximation schemes for a variety of models, based on the core-set paradigm.