Gap Processing for Adaptive Maximal Poisson-Disk Sampling

11/14/2012
by   Dong-Ming Yan, et al.
0

In this paper, 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 have their radius changed. We build on the concepts of the regular triangulation and the power diagram. Third, we will show how our analysis can make a contribution to the state-of-the-art in surface remeshing.

READ FULL TEXT

page 2

page 3

page 4

page 5

page 6

page 9

page 10

page 15

research
07/14/2020

Algorithmic applications of the corestriction of central simple algebras

Let L be a separable quadratic extension of either ℚ or 𝔽_q(t). We propo...
research
02/14/2023

Sizes of flat maximal antichains of subsets

This is the second of two papers investigating for which positive intege...
research
03/31/2021

Lower bound on the Voronoi diagram of lines in ℝ^d

This note gives a lower bound of Ω(n^⌈ 2d/3⌉) on the maximal complexity ...
research
03/21/2022

Performance Comparisons of Self-stabilizing Algorithms for Maximal Independent Sets

Sensor networks, such as ultra-wideband sensors for the smart warehouse,...
research
12/04/2019

On Computational Poisson Geometry I: Symbolic Foundations

We present a computational toolkit for (local) Poisson-Nijenhuis calculu...
research
11/26/2021

Variable resolution Poisson-disk sampling for meshing discrete fracture networks

We present the near-Maximal Algorithm for Poisson-disk Sampling (nMAPS) ...

Please sign up or login with your details

Forgot password? Click here to reset