A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions
Abstract
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.