An evaluation of point-insertion sequences for incremental Delaunay tessellations

DOI10.1007/s40314-016-0358-0zbMath1415.65047OpenAlexW2464680667MaRDI QIDQ1655402

Sanderson L. Gonzaga de Oliveira, Jéssica Renata Nogueira

Publication date: 9 August 2018

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-016-0358-0

zbMATH Keywords

mesh generationcomputer-aided designDelaunay tessellationnon-uniform point distributionsincremental algorithmscomputational geometry and topologyengineering and manufacturinginsertion sequences

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Uses Software

• Valgrind

Cites Work

• Unnamed Item
• Unnamed Item
• HCPO: an efficient insertion order for incremental Delaunay triangulation
• The effect of ordering on preconditioned conjugate gradients
• Towards optimal locality in mesh-indexings
• Geometry and Topology for Mesh Generation
• Space-Filling Curves
• A systematic review of algorithms with linear-time behaviour to generate Delaunay and Voronoi tessellations
• Incremental constructions con BRIO
• Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
• Finite Element Mesh Generation