A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions
Har-Peled, Sariel · Ungor, Alper
Original · EN
We propose a new refinement algorithm to generate size-optimal quality-guaranteed Delaunay triangulations in the plane. The algorithm takes O(n n + m) time, where n is the input size and m is the output size. This is the first time-optimal Delaunay refinement algorithm.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.