A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions

Simple item page
dc.creatorHar-Peled, Sariel
dc.creatorUngor, Alper
dc.date2005-01-04
dc.date.accessioned2026-07-07T03:22:20Z
dc.date.available2026-07-07T03:22:20Z
dc.descriptionWe propose a new refinement algorithm to generate size-optimal quality-guaranteed Delaunay triangulations in the plane. The algorithm takes $O(n \log n + m)$ time, where $n$ is the input size and $m$ is the output size. This is the first time-optimal Delaunay refinement algorithm.
dc.identifierhttps://arxiv.org/abs/cs/0501007
dc.identifierhttp://arxiv.org/abs/cs/0501007
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32554
dc.subjectComputational Geometry
dc.titleA Time-Optimal Delaunay Refinement Algorithm in Two Dimensions
dc.typetext

Files

Collections

arXiv