Geometric Adaptive Sampling (GAS)

• Geometric Adaptive Sampling (GAS) is a framework for generating maximal Poisson-disk sets by ensuring every point in a domain is within a prescribed radius using geometric gap analysis.
• It employs fast geometric data structures, power diagrams, and regular triangulations to detect, cluster, and fill gaps, achieving blue-noise sampling and optimal mesh quality.
• GAS guarantees coverage and mesh quality through iterative refinement and dynamic maintenance, making it scalable for both Euclidean and manifold sampling applications.

Geometric Adaptive Sampling (GAS) is a mathematically rigorous framework for generating maximal Poisson-disk sets with non-uniform radii in Euclidean domains and on manifolds. GAS leverages geometric structures—especially power diagrams and regular triangulations—to detect and fill uncovered regions ("gaps") so that every point in the domain lies within a prescribed radius of some sample. Its algorithmic pipeline combines fast geometric data structures, exact gap analysis, and iterative refinement, providing guarantees for coverage and mesh quality that underpin advanced applications in blue-noise sampling, mesh generation, and remeshing. This entry provides a comprehensive technical account of GAS, focusing on the underlying geometric theory, algorithmic structures, extensions to manifolds, implementations, and practical performance (Yan et al., 2012).

1. Geometric Theory of Gaps

A Poisson-disk sample in $\Omega \subset \mathbb{R}^d$ is defined as a set of disks $\{(c_i, r_i)\}$ with centers $c_i \in \Omega$ and radii $r_i>0$ such that no sample center lies within the disk of any other: $\forall i \ne j$, $\|c_i - c_j\| \geq \max(r_i, r_j)$. The union of all disks is $$\mathcal{D} = \bigcup_i \{x \in \Omega : \|x - c_i\| \leq r_i\}$$, and the set of uncovered ("gap") regions is $G = \Omega \setminus \mathcal{D}$.

GAS achieves maximality—meaning no disk can be added without violating the separation constraint—by geometrically characterizing gaps and iteratively eliminating them. Each disk $d_i$ is represented as a weighted point $(c_i, w_i = r_i^2)$. The power distance between $\{(c_i, r_i)\}$0 and $\{(c_i, r_i)\}$1 is $\{(c_i, r_i)\}$2. The domain is partitioned using the power diagram, with each cell

$\{(c_i, r_i)\}$3

and its dual, the regular triangulation $\{(c_i, r_i)\}$4, of the weighted set $\{(c_i, r_i)\}$5. Each $\{(c_i, r_i)\}$6-simplex $\{(c_i, r_i)\}$7 admits a unique power-center $\{(c_i, r_i)\}$8 where the power distance to all associated disks is equal: $\{(c_i, r_i)\}$9. The core criterion for gap existence is:

Gap-Existence Theorem: $c_i \in \Omega$0 is nonempty iff $c_i \in \Omega$1 such that $c_i \in \Omega$2.

Thus, checking for sampling maximality reduces to testing all simplices in $c_i \in \Omega$3: the sampling is maximal iff $c_i \in \Omega$4, $c_i \in \Omega$5.

On triangulated surfaces ($c_i \in \Omega$6), one uses the restricted power diagram (RPD) and its dual restricted regular triangulation (RRT). The local geometric criterion for gaps and maximality holds analogously.

2. Algorithms and Data Structures for Dynamic Gap Maintenance

GAS maintains a dynamic regular triangulation to enable rapid detection and update of gaps as disks are inserted, deleted, moved, or their radii are changed. This is crucial for efficient maximal sampling and adaptive refinement.

The regular triangulation is stored (availability via packages such as CGAL), where each simplex $c_i \in \Omega$7 keeps:

• pointers to its $c_i \in \Omega$8 vertex disks;
• its power-center $c_i \in \Omega$9 and power-value $r_i>0$0.

Primitive operations for dynamic maintenance include:

• Insertion: Add $r_i>0$1 as a weighted point, update affected simplices, compute new $r_i>0$2, and update the set of gap-simplices $r_i>0$3. Amortized $r_i>0$4.
• Deletion: Remove weighted point, update stars of affected simplices, recompute $r_i>0$5, update $r_i>0$6. Complexity $r_i>0$7.
• Movement/Radius Change: For movement, use delete+insert; for radius update, locally update weights and flip edges as necessary, recompute $r_i>0$8 in affected region.
• Batch Gap Processing: Once $r_i>0$9 is maintained, operations such as gap detection, gap clustering (by simplex connectivity), and primitive extraction (covering the local uncovered region in each gap-simplex) are $\forall i \ne j$0.

These mechanisms permit efficient, scalable maintenance and querying of sampling gaps, which is central to GAS.

3. GAS Sampling and Remeshing Pipeline

The GAS methodology implements a two-phase sampling process for both Euclidean and surface domains:

1. Initial Sampling: Use grid-accelerated dart-throwing to populate the domain with non-overlapping disks up to near-maximality, rejecting darts whose centers are inside any existing disk.
2. Gap Filling:
   • Detect all gap-simplices ($\forall i \ne j$1).
   • Cluster gaps into independent gap-sets (IGS), each representing a region that can be filled in parallel.
   • Within each IGS, extract convex gap-primitives, union them to cover the IGS, construct area-weighted sampling distributions, and draw new disks within uncovered regions.
   • Repeat until no gaps remain (in practice, typically 4–5 iterations suffice for full maximality).

Extension to Manifolds: On triangulated surfaces, GAP uses the restricted power diagram (RPD) and RRT. Each sample’s surface-polygon is obtained by clipping its RPD cell with its associated sphere; the MUSP operations (detect, cluster, extract, fill) are adapted accordingly, yielding maximal coverage on manifolds.

Surface Remeshing: The GAS sampling provides seeds for remeshing:

• Prescribed radii encode density function $\forall i \ne j$2, yielding $\forall i \ne j$3 sampling.
• Dual triangulation of the RPD is extracted to form initial mesh.
• Optional randomized local optimization enforces angular and valence bounds: e.g., angle-bounds $\forall i \ne j$4 or discrete valence sets $\forall i \ne j$5.
• Edge-length optimization may be applied.

4. Performance and Empirical Results

GAS exhibits high efficiency and superior mesh regularity, as demonstrated by extensive experiments:

Application	Key Result Metrics	Timings
2D Uniform/Adaptive	1M samples in unit square: full maximality in ≈2s; gap-filling converges in 4–5 iterations	≈2s (sampling)
	Min angle $\forall i \ne j$6, valence ≈98% at 6, blue-noise spectrum confirmed
Surface Remeshing	Bunny (30k verts): $\forall i \ne j$7; $\forall i \ne j$8 vertices valence in {5,6,7}	Initial: 12s, gap: 6s, opt.: 5s
	Adaptive density: angle bounds $\forall i \ne j$9, Hausdorff error ≈0.5% of bbox	23s total

In comparative experiments, GAS produces blue-noise, maximal samples and meshes with tight angle and valence guarantees at markedly lower computational cost than centroidal Voronoi tessellation (CVT) or capacity-constrained (CAP) approaches, which require 180–400s for equivalent quality (Yan et al., 2012).

5. Properties, Guarantees, and Quality Criteria

GAS delivers provable coverage and mesh-quality properties:

• Maximality is certified via the local power-center gap test ($\|c_i - c_j\| \geq \max(r_i, r_j)$0).
• Angle and Valence Optimization: Uniform disk case yields $\|c_i - c_j\| \geq \max(r_i, r_j)$1, $\|c_i - c_j\| \geq \max(r_i, r_j)$2; local randomized optimization can drive adaptive angle bounds toward these uniform values. Surface remeshing outputs $\|c_i - c_j\| \geq \max(r_i, r_j)$3 of vertices with valence $\|c_i - c_j\| \geq \max(r_i, r_j)$4.
• Blue-Noise Spectrum: Spectral analysis confirms GAS-sampled sets exhibit blue-noise properties, advantageous for reducing simulation bias in applications such as SPH and finite element analysis.
• Scalability and Efficiency: Primitive gap operations require only local updates ($\|c_i - c_j\| \geq \max(r_i, r_j)$5 per simplex), leading to scaling to millions of samples in seconds.

A plausible implication is that GAS enables high-quality, adaptive sampling and remeshing pipelines in computational geometry, computer graphics, and simulation, where both spatial regularity and sampling maximality are critical.

6. Context, Extensions, and Significance

GAS builds upon and generalizes classical Poisson-disk sampling by incorporating exact gap detection and strictly enforcing maximality under varying radii. The geometric framework—grounded in power diagrams and regular triangulations—supports dynamic, fully adaptive operations, and admits extensibility from Euclidean to curved manifold domains.

Key algorithmic ingredients include:

• Unified geometric gap existence characterization,
• Dynamic maintenance of regular triangulations,
• Hierarchical gap-filling,
• Local randomized optimization for mesh metrics.

Applications of GAS span blue-noise sampling, surface remeshing, meshing for simulation, and any domain where maximal disk cover and controllable sample densities are central. Its guarantees and empirical results position GAS as a robust foundation for further developments in geometric sampling, coverage theory, and mesh optimization (Yan et al., 2012).