Efficient triangulation of Poisson-disk sampled point sets

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

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)773-785
Number of pages13
JournalVisual Computer
Volume30
Issue number6-8
DOIs
StatePublished - Jun 2014

Keywords

  • Geometric algorithms
  • Poisson-disk sampling
  • Triangulation

ASJC Scopus subject areas

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

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

  • Cite this

    Guo, J., Yan, D. M., Bao, G., Dong, W., Zhang, X., & Wonka, P. (2014). Efficient triangulation of Poisson-disk sampled point sets. Visual Computer, 30(6-8), 773-785. https://doi.org/10.1007/s00371-014-0948-z