Efficient triangulation of Poisson-disk sampled point sets

Handle URI:
http://hdl.handle.net/10754/564920
Title:
Efficient triangulation of Poisson-disk sampled point sets
Authors:
Guo, Jianwei; Yan, Dongming ( 0000-0003-2209-2404 ) ; Bao, Guanbo; Dong, Weiming; Zhang, Xiaopeng; Wonka, Peter ( 0000-0003-0627-9746 )
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.
KAUST Department:
Visual Computing Center (VCC); Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Computer Science Program
Publisher:
Springer Science + Business Media
Journal:
The Visual Computer
Issue Date:
6-May-2014
DOI:
10.1007/s00371-014-0948-z
Type:
Article
ISSN:
01782789
Sponsors:
This research was partially funded by National Natural Science Foundation of China (Nos. 61372168, 61172104, 61331018, and 61271431), the KAUST Visual Computing Center, and the National Science Foundation.
Appears in Collections:
Articles; Computer Science Program; Visual Computing Center (VCC); Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorGuo, Jianweien
dc.contributor.authorYan, Dongmingen
dc.contributor.authorBao, Guanboen
dc.contributor.authorDong, Weimingen
dc.contributor.authorZhang, Xiaopengen
dc.contributor.authorWonka, Peteren
dc.date.accessioned2015-08-04T07:25:12Zen
dc.date.available2015-08-04T07:25:12Zen
dc.date.issued2014-05-06en
dc.identifier.issn01782789en
dc.identifier.doi10.1007/s00371-014-0948-zen
dc.identifier.urihttp://hdl.handle.net/10754/564920en
dc.description.abstractIn 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.en
dc.description.sponsorshipThis research was partially funded by National Natural Science Foundation of China (Nos. 61372168, 61172104, 61331018, and 61271431), the KAUST Visual Computing Center, and the National Science Foundation.en
dc.publisherSpringer Science + Business Mediaen
dc.subjectGeometric algorithmsen
dc.subjectPoisson-disk samplingen
dc.subjectTriangulationen
dc.titleEfficient triangulation of Poisson-disk sampled point setsen
dc.typeArticleen
dc.contributor.departmentVisual Computing Center (VCC)en
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentComputer Science Programen
dc.identifier.journalThe Visual Computeren
dc.contributor.institutionLIAMA-NLPR, Institute of Automation, Chinese Academy of Sciences, Beijing, Chinaen
kaust.authorYan, Dongmingen
kaust.authorWonka, Peteren
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.