Fast and robust Delaunay tessellation in periodic domains
type: Item
instance of: scholarly article
title: Fast and robust Delaunay tessellation in periodic domains
zbMATH Open document ID: 1017.65011
author: Karsten E. Thompson
published in: International Journal for Numerical Methods in Engineering
publication date: 2003-05-08T00:00:00Z
Mathematics Subject Classification ID: 65D18
Mathematics Subject Classification ID: 51-04
Mathematics Subject Classification ID: 65N50
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 1907601
zbMATH Keywords: Delaunay tessellation
zbMATH Keywords: periodicity
zbMATH Keywords: sphere pack
zbMATH Keywords: Voronoi diagram
zbMATH Keywords: point insertion
zbMATH Keywords: numerical examples
zbMATH Keywords: mesh generation
zbMATH Keywords: periodic transport problems
zbMATH Keywords: algorithm
zbMATH Keywords: performance
MaRDI profile type: MaRDI publication profile
full work available at URL: nme.558
OpenAlex ID: W2074735566
Wikidata QID: Q124253041
cites work: Q4484914
cites work: Stokes flow through periodic arrays of spheres
DOI: 10.1002/NME.558
Recommended article: Fast Delaunay triangulation in three dimensions
Recommended article: Fast reconstruction of Delaunay triangulations
Recommended article: Robust boundary triangulation and delaunay triangulation of arbitrary planar domains
Recommended article: Generalizing CGAL Periodic Delaunay Triangulations
Recommended article: Q5442589
Recommended article: A time efficient Delaunay refinement algorithm
Recommended article: Principles of Distributed Systems
Recommended article: Delaunay triangulation of arbitrarily shaped planar domains
Recommended article: A fast algorithm for constructing Delaunay triangulations in the plane
description: scientific article; zbMATH DE number 1907601