Efficient triangulation of Poisson-disk sampled point sets
- First Online:
- Cite this article as:
- Guo, J., Yan, DM., Bao, G. et al. Vis Comput (2014) 30: 773. doi:10.1007/s00371-014-0948-z
- 293 Downloads
In this paper, we present a simple yet efficient algorithm for triangulating a 2D input domain containing a Poisson-disk sampled point set. The proposed algorithm combines a regular grid and a discrete clustering approach to speedup the triangulation. Moreover, our triangulation algorithm is flexible and performs well on more general point sets such as adaptive, non-maximal Poisson-disk sets. The experimental results demonstrate that our algorithm is robust for a wide range of input domains and achieves significant performance improvement compared to the current state-of-the-art approaches.