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 Citations (Scopus)

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 - 2014
Externally publishedYes

Fingerprint

Triangulation

Keywords

  • Geometric algorithms
  • Poisson-disk sampling
  • Triangulation

ASJC Scopus subject areas

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

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

Efficient triangulation of Poisson-disk sampled point sets. / Guo, Jianwei; Yan, Dong Ming; Bao, Guanbo; Dong, Weiming; Zhang, Xiaopeng; Wonka, Peter.

In: Visual Computer, Vol. 30, No. 6-8, 2014, p. 773-785.

Research output: Contribution to journalArticle

Guo, J, Yan, DM, Bao, G, Dong, W, Zhang, X & Wonka, P 2014, 'Efficient triangulation of Poisson-disk sampled point sets', Visual Computer, vol. 30, no. 6-8, pp. 773-785. https://doi.org/10.1007/s00371-014-0948-z
Guo, Jianwei ; Yan, Dong Ming ; Bao, Guanbo ; Dong, Weiming ; Zhang, Xiaopeng ; Wonka, Peter. / Efficient triangulation of Poisson-disk sampled point sets. In: Visual Computer. 2014 ; Vol. 30, No. 6-8. pp. 773-785.
@article{81e9178ed7bb4d3abcf3cf6cd97dd613,
title = "Efficient triangulation of Poisson-disk sampled point sets",
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.",
keywords = "Geometric algorithms, Poisson-disk sampling, Triangulation",
author = "Jianwei Guo and Yan, {Dong Ming} and Guanbo Bao and Weiming Dong and Xiaopeng Zhang and Peter Wonka",
year = "2014",
doi = "10.1007/s00371-014-0948-z",
language = "English (US)",
volume = "30",
pages = "773--785",
journal = "Visual Computer",
issn = "0178-2789",
publisher = "Springer Verlag",
number = "6-8",

}

TY - JOUR

T1 - Efficient triangulation of Poisson-disk sampled point sets

AU - Guo, Jianwei

AU - Yan, Dong Ming

AU - Bao, Guanbo

AU - Dong, Weiming

AU - Zhang, Xiaopeng

AU - Wonka, Peter

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

KW - Geometric algorithms

KW - Poisson-disk sampling

KW - Triangulation

UR - http://www.scopus.com/inward/record.url?scp=84902072569&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84902072569&partnerID=8YFLogxK

U2 - 10.1007/s00371-014-0948-z

DO - 10.1007/s00371-014-0948-z

M3 - Article

AN - SCOPUS:84902072569

VL - 30

SP - 773

EP - 785

JO - Visual Computer

JF - Visual Computer

SN - 0178-2789

IS - 6-8

ER -