 
Summary: A Dynamic Algorithm for WellSpaced Point Sets
(Abstract)
Umut A. Acar
Beno^it Hudson
Duru Tšurkoglu
Figure 1: A wellspaced superset.
Solid points (·) are input. Empty
points () are Steiner vertices.
The Motivation and the Problem. A set of points is wellspaced if
the Voronoi cell of each point has a bounded aspect ratio, i.e., the ratio
of the distance to the farthest point in the Voronoi cell divided by the
nearest neighbor distance is small. Informally, a set of points is well
spaced if its density varies smoothly. Wellspaced points sets relate
strongly to meshing and triangulation for scientific computing: with
minimal processing, they lead to quality meshes (e.g., no small angles)
in two and higher dimensions. The Voronoi diagram of a wellspaced
point set is also immediately useful for the Control Volume Method.
Given a finite set of points N in the ddimensional unit hypercube
[0, 1]d, the static wellspaced superset problem is to find a small, well
spaced set M N by inserting so called Steiner points. This problem
