The Visual Computer

, Volume 30, Issue 6, pp 773–785

Efficient triangulation of Poisson-disk sampled point sets

Original Article

DOI: 10.1007/s00371-014-0948-z

Cite this article as:
Guo, J., Yan, DM., Bao, G. et al. Vis Comput (2014) 30: 773. doi:10.1007/s00371-014-0948-z


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.


Triangulation Poisson-disk sampling Geometric algorithms 

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  1. 1.LIAMA-NLPR, Institute of AutomationChinese Academy of SciencesBeijingChina
  2. 2.Visual Computing CenterKing Abdullah University of Science and TechnologyThuwalKingdom of Saudi Arabia

Personalised recommendations