An efficient sweep-line Delaunay triangu
β
Borut Ε½alik
π
Article
π
2005
π
Elsevier Science
π
English
β 587 KB
This paper introduces a new algorithm for constructing a 2D Delaunay triangulation. It is based on a sweep-line paradigm, which is combined with a local optimization criterion-a characteristic of incremental insertion algorithms. The sweep-line status is represented by a so-called advancing front, w