A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Proceedings of the 29th annual symposium on Symposuim on computational geometry - SoCG '13
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 O(d) (n log n + m)), where n is the input size, m is the output point set size, and d is the ambient dimension. The constants only depend on the desired element quality bounds. To gain this new e ciency, the algorithm approximatelydoi:10.1145/2493132.2462404 fatcat:dwxs2lxp2jfxph52xd375n4xgm