Computational geometry with imprecise data and arithmetic
Computational geometry with imprecise data and arithmetic
An optimal algorithm for the intersection radius of a set of convex polygons
Journal of Algorithms
Handbook of discrete and computational geometry
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
Constructing Strongly Convex Approximate Hulls with Inaccurate Primitives
SIGAL '90 Proceedings of the International Symposium on Algorithms
Almost-Delaunay simplices: nearest neighbor relations for imprecise points
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Systems of distant representatives
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
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
On the Power of the Semi-Separated Pair Decomposition
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Largest bounding box, smallest diameter, and related problems on imprecise points
Computational Geometry: Theory and Applications
Minimum-perimeter intersecting polygons
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
On the power of the semi-separated pair decomposition
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
Assume that a set of imprecise points in the plane 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.