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:
Computational Geometry: Theory and Applications
Year:
2010

Citing 12
Cited 9

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
On linear-time deterministic algorithms for optimization problems in fixed dimension

Journal of Algorithms
Fuzzy geometry: an updated overview

Information Sciences: an International Journal
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
Computational geometry.

Computational geometry.
Approximation algorithms for spreading points

Journal of Algorithms
Approximating largest convex hulls for imprecise points

Journal of Discrete Algorithms
Systems of distant representatives

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Facility location problems with uncertainty on the plane

Discrete Optimization

Preprocessing Imprecise Points and Splitting Triangulations

SIAM Journal on Computing
Stochastic minimum spanning trees in euclidean spaces

Proceedings of the twenty-seventh annual symposium on Computational geometry
The Geometric Stability of Voronoi Diagrams with Respect to Small Changes of the Sites

Proceedings of the twenty-seventh annual symposium on Computational geometry
The directed Hausdorff distance between imprecise point sets

Theoretical Computer Science
Geometric computations on indecisive points

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Covering and piercing disks with two centers

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Nearest-neighbor searching under uncertainty

PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Covering and piercing disks with two centers

Computational Geometry: Theory and Applications
Range counting coresets for uncertain data

Proceedings of the twenty-ninth annual symposium on Computational geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract

Imprecision of input data is one of the main obstacles that prevent geometric algorithms from being used in practice. We model an imprecise point by a region in which the point must lie. Given a set of imprecise points, we study computing the largest and smallest possible values of various basic geometric measures on point sets, 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.