Abstract

We present early results on a dynamic mesh refinement algorithm. Using a variant of the Sparse Voronoi Refinement algorithm and applying the technique of Self-Adjusting Computation, we find that we expect to run in O(polylog n) time per update on points sets in arbitrary dimension. This is based on some theoretical results, along with experimental results from an implementation.

Citations