Gap processing for adaptive maximal Poisson-disk sampling

Handle URI:
http://hdl.handle.net/10754/575579
Title:
Gap processing for adaptive maximal Poisson-disk sampling
Authors:
Yan, Dongming ( 0000-0003-2209-2404 ) ; Wonka, Peter ( 0000-0003-0627-9746 )
Abstract:
In this article, we study the generation of maximal Poisson-disk sets with varying radii. First, we present a geometric analysis of gaps in such disk sets. This analysis is the basis for maximal and adaptive sampling in Euclidean space and on manifolds. Second, we propose efficient algorithms and data structures to detect gaps and update gaps when disks are inserted, deleted, moved, or when their radii are changed.We build on the concepts of regular triangulations and the power diagram. Third, we show how our analysis contributes to the state-of-the-art in surface remeshing. © 2013 ACM.
KAUST Department:
Visual Computing Center (VCC); Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Computer Science Program
Publisher:
Association for Computing Machinery (ACM)
Journal:
ACM Transactions on Graphics
Issue Date:
1-Sep-2013
DOI:
10.1145/2516971.2516973
ARXIV:
arXiv:1211.3297v2
Type:
Article
ISSN:
07300301
Sponsors:
This research was partially funded by National Natural Science Foundation of China (no. 61372168, 61271431, 61172104 and 61331018), 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.authorYan, Dongmingen
dc.contributor.authorWonka, Peteren
dc.date.accessioned2015-08-24T08:33:22Zen
dc.date.available2015-08-24T08:33:22Zen
dc.date.issued2013-09-01en
dc.identifier.issn07300301en
dc.identifier.doi10.1145/2516971.2516973en
dc.identifier.urihttp://hdl.handle.net/10754/575579en
dc.description.abstractIn this article, we study the generation of maximal Poisson-disk sets with varying radii. First, we present a geometric analysis of gaps in such disk sets. This analysis is the basis for maximal and adaptive sampling in Euclidean space and on manifolds. Second, we propose efficient algorithms and data structures to detect gaps and update gaps when disks are inserted, deleted, moved, or when their radii are changed.We build on the concepts of regular triangulations and the power diagram. Third, we show how our analysis contributes to the state-of-the-art in surface remeshing. © 2013 ACM.en
dc.description.sponsorshipThis research was partially funded by National Natural Science Foundation of China (no. 61372168, 61271431, 61172104 and 61331018), and the National Science Foundation.en
dc.publisherAssociation for Computing Machinery (ACM)en
dc.subjectAdaptive Poisson-disk samplingen
dc.subjectBlue noiseen
dc.subjectGapsen
dc.subjectMaximal samplingen
dc.subjectPower diagramen
dc.subjectRegular triangulationen
dc.subjectRemeshingen
dc.titleGap processing for adaptive maximal Poisson-disk samplingen
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.journalACM Transactions on Graphicsen
dc.identifier.arxividarXiv:1211.3297v2en
kaust.authorYan, Dongmingen
kaust.authorWonka, Peteren
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.