Reprint of: Delaunay refinement algorithms for triangular mesh generation

DOI10.1016/j.comgeo.2014.02.005zbMath1292.65020OpenAlexW2042755456MaRDI QIDQ2249046

Jonathan Richard Shewchuk

Publication date: 27 June 2014

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2014.02.005

zbMATH Keywords

computational geometryDelaunay triangulationconstrained Delaunay triangulationDelaunay refinementtriangular mesh generation

Mathematics Subject Classification ID

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

Related Items (2)

Optimized bends and corporate \(1\times 4\) and \(1\times 8\) SIW power dividers junctions analysis for V-band applications using a rigorous finite element method ⋮ A novel model of conforming Delaunay triangulation for sensor network configuration

Uses Software

• Triangle

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized Delaunay triangulation for planar graphs
• A faster divide-and-conquer algorithm for constructing Delaunay triangulations
• Nonobtuse triangulation of polygons
• Constrained Delaunay triangulations
• Provably good mesh generation
• Adaptive refinement of unstructured finite-element meshes
• Applications of random sampling in computational geometry. II
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Selective refinement: A new strategy for automatic node placement in graded triangular meshes
• Two algorithms for constructing a Delaunay triangulation
• ON GOOD TRIANGULATIONS IN THREE DIMENSIONS
• On the Angle Condition in the Finite Element Method
• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• Mesh generation for domains with small angles

This page was built for publication: Reprint of: Delaunay refinement algorithms for triangular mesh generation