KAUST DepartmentVisual Computing Center (VCC)
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Computer Science Program
Online Publication Date2014-05-06
Print Publication Date2014-06
Permanent link to this recordhttp://hdl.handle.net/10754/564920
MetadataShow full item record
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.
CitationGuo, J., Yan, D.-M., Bao, G., Dong, W., Zhang, X., & Wonka, P. (2014). Efficient triangulation of Poisson-disk sampled point sets. The Visual Computer, 30(6-8), 773–785. doi:10.1007/s00371-014-0948-z
SponsorsThis 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.
JournalThe Visual Computer