For a set P of n points in Rd, we define a new type of space decomposition. The new diagram provides an ε-approximation to the distance function associated with the Voronoi diagram of P, while being of near linear size, for d≥2. This contrasts with the standard Voronoi diagram that has Ω (n[d2]/) complexity in the worst case.
Published in:
Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on
Date of Conference: 8-11 Oct. 2001