A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions
Sariel Har-Peled, Alper Ungor
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.
Create a lesson
Related papers
Polyominoes Folding into Four and Five Distinct Boxes
Erik D. Demaine, Toshihiro Shirakawa, Conner Silverstein et al.
Quadratic Reconfiguration of Plane Spanning Paths on Two-Layer Point Sets
Samuel Avril, Yan Gerard, Guilherme D. da Fonseca
From Static Models to Editable CAD: A Design-Intent-Aware Framework for Reverse Parametrization
Yurim Lee, Sumin Lee, Namwoo Kang
Representation-Aware Closed-Surface Parameterization: Exact Sensitivity Analysis and Pole-Aware Planar Preconditioning
Zixi Yi, Gary P. T. Choi
Hamiltonian Cycle Construction in Rectangular Grid Graphs with Three-Stacked Triangular Holes
Cecilia Chen, Dianna Xu
Catenary Visibility: A Geometric Framework for Planning with Tethered Robots
B. Ábrego, J. M. Díaz-Báñez, S. Fernández et al.