A fast algorithm for well-spaced points and approximate delaunay graphs


We present a new algorithm that produces a well-spaced superset of points conforming to a given input set in any dimension with guaranteed optimal output size. We also provide an approximate Delaunay graph on the output points. Our algorithm runs in expected time O(2<sup>O(d)</sup>(n log n + m)), where n is the input size, m is the output point set size… (More)
DOI: 10.1145/2462356.2462404


1 Figure or Table

Slides referencing similar topics