Dynamic well-spaced point sets

  • Authors:

  • Umut A. Acar;Andrew Cotter;Benoit Hudson;Duru Türkoglu

  • Affiliations:

  • Max-Planck Institute for Software Systems, Kaiserslautern, IL, USA;Toyota Technological Institute at Chicago, Chicago, IL, USA;Toyota Technological Institute at Chicago, Chicago, IL, USA;University of Chicago, Chicago, IL, USA

  • Venue:
  • Proceedings of the twenty-sixth annual symposium on Computational geometry
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In a well-spaced point set, when there is a bounding hypercube, the Voronoi cells all have bounded aspect ratio, i.e., the distance from the Voronoi site to the farthest point in the Voronoi cell divided by the distance to the nearest neighbor in the set is bounded by a small constant. Well-spaced point sets satisfy some important geometric properties and yield quality Voronoi or simplicial meshes that can be important in scientific computations. In this paper, we consider the dynamic well-spaced point sets problem, which requires computing the well-spaced superset of a dynamically changing input set, e.g., as input points are inserted or deleted. We present a dynamic algorithm that allows inserting/deleting points into/from the input in worst-case O(log Δ) time, where Δ is the geometric spread, a natural measure that is bounded by O(log n) when input points are represented by log-size words. We show that the runtime of the dynamic update algorithm is optimal in the worst case. Our algorithm generates size-optimal outputs: the resulting output sets are never more than a constant factor larger than the minimum size necessary. A preliminary implementation indicates that the algorithm is indeed fast in practice. To the best of our knowledge, this is the first time- and size-optimal dynamic algorithm for well-spaced point sets.