Dynamic well-spaced point sets

DOI10.1016/j.comgeo.2012.11.007zbMath1267.65022OpenAlexW2202662702MaRDI QIDQ1947994

Umut A. Acar, Andrew Cotter, Benoît Hudson, Duru Türkoğlu

Publication date: 29 April 2013

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2012.11.007

zbMATH Keywords

numerical examplesdynamic stabilitymesh refinementdynamic algorithmclipped Voronoi cellself-adjusting computationwell-spaced point set

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Uses Software

• Triangle
• Hull

Cites Work

• Four results on randomized incremental constructions
• Applications of random sampling to on-line algorithms in computational geometry
• Provably good mesh generation
• Delaunay refinement algorithms for triangular mesh generation
• Simultaneous refinement and coarsening for adaptive meshing
• Sliver exudation
• PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES
• Robust Kinetic Convex Hulls in 3D
• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• A cost semantics for self-adjusting computation
• A time-optimal delaunay refinement algorithm in two dimensions
• Dynamic well-spaced point sets
• Unnamed Item
• Unnamed Item
• Unnamed Item