Delaunay meshing of piecewise smooth complexes without expensive predicates
type: Item
instance of: scholarly article
title: Delaunay meshing of piecewise smooth complexes without expensive predicates
zbMATH Open document ID: 1445.65006
author: Joshua A. Levine
author: Tamal K. Dey
published in: Algorithms
publication date: 2018-08-20T00:00:00Z
review text: Summary: Recently a Delaunay refinement algorithm has been proposed that can mesh piecewise smooth complexes which include polyhedra, smooth and piecewise smooth surfaces, and non-manifolds. However, this algorithm employs domain dependent numerical predicates, some of which could be computationally expensive and hard to implement. In this paper we develop a refinement strategy that eliminates these complicated domain dependent predicates. As a result we obtain a meshing algorithm that is practical and implementation-friendly.
Mathematics Subject Classification ID: 65D17
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 6920481
zbMATH Keywords: Delaunay refinement
zbMATH Keywords: mesh generation
zbMATH Keywords: piecewise-smooth complexes
zbMATH Keywords: non-smoothness
zbMATH Keywords: non-manifoldness
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.3390/a2041327
OpenAlex ID: W1965285142
cites work: Provably good sampling and meshing of surfaces
cites work: Sampling and Meshing a Surface with Guaranteed Topology and Geometry
cites work: Mesh generation for domains with small angles
cites work: Q3601557
cites work: Q5442585
cites work: Q2934704
cites work: Three-dimensional Delaunay mesh generation
cites work: Conforming Delaunay triangulations in 3D
cites work: A POINT-PLACEMENT STRATEGY FOR CONFORMING DELAUNAY TETRAHEDRALIZATION
cites work: Power Diagrams: Properties, Algorithms and Applications
cites work: Geometry and topology for mesh generation
cites work: A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
cites work: Q5442589
cites work: Delpsc
cites work: Triangulating Topological Spaces
cites work: The computational geometry algorithms library CGAL
cites work: Surface reconstruction by Voronoi filtering
cites work: Curve and Surface Reconstruction
DOI: 10.3390/A2041327
description: scientific article; zbMATH DE number 6920481