An incremental construction algorithm for Delaunay triangulation using the nearest-point paradigm

@article{Zalik2003AnIC,
title={An incremental construction algorithm for Delaunay triangulation using the nearest-point paradigm},
author={Borut Zalik and Ivana Kolingerov{\'a}},
journal={International Journal of Geographical Information Science},
year={2003},
volume={17},
pages={119-138}
}

This paper introduces a new algorithm for constructing a 2D Delaunay triangulation. It belongs to the class of incremental insertion algorithms, which are known as less demanding from the implementation point of view. The most time consuming step of the incremental insertion algorithms is locating the triangle containing the next point to be inserted. In this paper, this task is transformed to the nearest point problem, which is solved by a two-level uniform subdivision acceleration technique… CONTINUE READING