Gap processing for adaptive maximal poisson-disk sampling

Dongming Yan; Peter Wonka

doi:10.1145/2516971.2516973

Gap processing for adaptive maximal poisson-disk sampling

Dongming Yan, Peter Wonka

Research output: Contribution to journal › Article › peer-review

68 Scopus citations

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.

Original language	English (US)
Pages (from-to)	1-15
Number of pages	15
Journal	ACM Transactions on Graphics
Volume	32
Issue number	5
DOIs	https://doi.org/10.1145/2516971.2516973
State	Published - Oct 17 2013

Bibliographical note

KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: This research was partially funded by National Natural Science Foundation of China (no. 61372168, 61271431, 61172104 and 61331018), and the National Science Foundation.

Access to Document

10.1145/2516971.2516973

https://repository.kaust.edu.sa/bitstream/10754/575579/1/2013.TOG.Dongming.MaximalPoissonSampling.pdf

Cite this

@article{3dfc1b6e2f3a41b3ae25f986dee67983,

title = "Gap processing for adaptive maximal poisson-disk sampling",

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. {\textcopyright} 2013 ACM.",

author = "Dongming Yan and Peter Wonka",

note = "KAUST Repository Item: Exported on 2020-10-01 Acknowledgements: This research was partially funded by National Natural Science Foundation of China (no. 61372168, 61271431, 61172104 and 61331018), and the National Science Foundation.",

year = "2013",

month = oct,

day = "17",

doi = "10.1145/2516971.2516973",

language = "English (US)",

volume = "32",

pages = "1--15",

journal = "ACM Transactions on Graphics",

issn = "0730-0301",

publisher = "Association for Computing Machinery",

number = "5",

}

TY - JOUR

T1 - Gap processing for adaptive maximal poisson-disk sampling

AU - Yan, Dongming

AU - Wonka, Peter

N1 - KAUST Repository Item: Exported on 2020-10-01 Acknowledgements: This research was partially funded by National Natural Science Foundation of China (no. 61372168, 61271431, 61172104 and 61331018), and the National Science Foundation.

PY - 2013/10/17

Y1 - 2013/10/17

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

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

UR - http://hdl.handle.net/10754/575579

UR - https://dl.acm.org/doi/10.1145/2516971.2516973

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

U2 - 10.1145/2516971.2516973

DO - 10.1145/2516971.2516973

M3 - Article

SN - 0730-0301

VL - 32

SP - 1

EP - 15

JO - ACM Transactions on Graphics

JF - ACM Transactions on Graphics

IS - 5

ER -

Gap processing for adaptive maximal poisson-disk sampling

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this