Mesh generation for domains with small angles

DOI10.1145/336154.336163MaRDI QIDQ5361508zbMATH OpenOpenAlexFDO

Authors Jonathan Richard Shewchuk

Publication date 29 September 2017

Published in Proceedings of the sixteenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/336154.336163

Mathematics Subject Classification ID

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

Cited in

(9)

• Delaunay refinement algorithms for triangular mesh generation
• Delaunay meshing of piecewise smooth complexes without expensive predicates
• Practical unstructured splines: algorithms, multi-patch spline spaces, and some applications to numerical analysis
• Reprint of: Delaunay refinement algorithms for triangular mesh generation
• A generic software design for Delaunay refinement meshing
• General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties
• Adaptive tetrahedral mesh generation by constrained Delaunay refinement
• \textsc{TriMe++}: multi-threaded triangular meshing in two dimensions
• Delaunay refinement for piecewise smooth complexes

This page was built for publication: Mesh generation for domains with small angles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361508)