Largest bounding box, smallest diameter, and related problems on imprecise points

Authors:
Maarten Löffler;Marc van Kreveld
Affiliations:
Department of Information and Computing Sciences, Utrecht University, The Netherlands;Department of Information and Computing Sciences, Utrecht University, The Netherlands
Venue:
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Year:
2007

Citing 10
Cited 6

On the ball spanned by balls

Discrete & Computational Geometry
A convex hull algorithm for discs, and applications

Computational Geometry: Theory and Applications
An optimal algorithm for the intersection radius of a set of convex polygons

Journal of Algorithms
Structural tolerance and delauny triangulation

Information Processing Letters
Tight Error Bounds of Geometric Problems on Convex Objects with Imprecise Coordinates

JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Convex Hull Problem with Imprecise Input

JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Approximation algorithms for spreading points

Journal of Algorithms
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
Facility location problems with uncertainty on the plane

Discrete Optimization

Triangulating input-constrained planar point sets

Information Processing Letters
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
Delaunay triangulation of imprecise points in linear time after preprocessing

Computational Geometry: Theory and Applications
The Directed Hausdorff Distance between Imprecise Point Sets

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Approximating largest convex hulls for imprecise points

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
On some geometric problems of color-spanning sets

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Imprecise points are regions in which one point should be placed. We study computing the largest and smallest possible values of various basic geometric measures on sets of imprecise points, such as the diameter, width, closest pair, smallest enclosing circle, and smallest enclosing bounding box. We give efficient algorithms for most of these problems, and identify the hardness of others.