Efficient triangulation of Poisson-disk sampled point sets

Jianwei Guo, Dongming Yan, Guanbo Bao, Weiming Dong, Xiaopeng Zhang, Peter Wonka

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

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. © 2014 Springer-Verlag Berlin Heidelberg.
Original languageEnglish (US)
Pages (from-to)773-785
Number of pages13
JournalThe Visual Computer
Volume30
Issue number6-8
DOIs
StatePublished - May 6 2014

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software
  • Computer Vision and Pattern Recognition

Fingerprint

Dive into the research topics of 'Efficient triangulation of Poisson-disk sampled point sets'. Together they form a unique fingerprint.

Cite this