Place of publishing:
Subject and Keywords:
This paper presents a new incremental insertion algorithm for constructing a Delaunay triangulation in 2D. The domain is partitioned into rectangular regions organized into an adaptive quad-tree. This data structure is used to locate a triangle lying possibly the nearest to currently inserted point. To find the triangle containing the point, a walk from selected triangle in the direction of the point is conducted. The algorithm is empirically compared with other popular Delaunay triangulation methods. It is very fast, numerically stable and not memory demanding.
Language of abstract:
Projects co-financed by:
Operational Program Digital Poland, 2014-2020, Measure 2.3: Digital accessibility and usefulness of public sector information; funds from the European Regional Development Fund and national co-financing from the state budget.
This content is hosted outside the digital library.
Click the link below to view the content.https://www.ibspan.waw.pl/~alex/OZwRCIN/WA777_113903_RB-2008-07_Quad-walk%20:%20a%20fast%20incremental%20Delaunay%20triangulation%20algorithm_content.pdf