Fast and robust Delaunay tessellation in periodic domains

DOI10.1002/nme.558zbMath1017.65011OpenAlexW2074735566WikidataQ124253041 ScholiaQ124253041MaRDI QIDQ4805651

Karsten E. Thompson

Publication date: 8 May 2003

Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nme.558

zbMATH Keywords

performancealgorithmnumerical examplesperiodicitymesh generationVoronoi diagramDelaunay tessellationpoint insertionperiodic transport problemssphere pack

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Software, source code, etc. for problems pertaining to geometry (51-04) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

Delaunay triangulations of closed Euclidean \(d\)-orbifolds

Cites Work

• Stokes flow through periodic arrays of spheres
• Unnamed Item

This page was built for publication: Fast and robust Delaunay tessellation in periodic domains