Delaunay meshing of piecewise smooth complexes without expensive predicates

DOI10.3390/a2041327zbMath1445.65006OpenAlexW1965285142MaRDI QIDQ1662514

Joshua A. Levine, Tamal Krishna Dey

Publication date: 20 August 2018

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a2041327

zbMATH Keywords

mesh generationnon-smoothnessDelaunay refinementnon-manifoldnesspiecewise-smooth complexes

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (4)

The topological correctness of PL approximations of isomanifolds ⋮ DELAUNAY REFINEMENT ALGORITHMS FOR ESTIMATING LOCAL FEATURE SIZE IN 2D AND 3D ⋮ CGALmesh ⋮ Triangulating submanifolds: an elementary and quantified version of Whitney's method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conforming Delaunay triangulations in 3D
• Surface reconstruction by Voronoi filtering
• Three-dimensional Delaunay mesh generation
• Geometry and Topology for Mesh Generation
• Curve and Surface Reconstruction
• Sampling and Meshing a Surface with Guaranteed Topology and Geometry
• Delpsc
• Triangulating Topological Spaces
• A POINT-PLACEMENT STRATEGY FOR CONFORMING DELAUNAY TETRAHEDRALIZATION
• Power Diagrams: Properties, Algorithms and Applications
• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• The computational geometry algorithms library CGAL
• Mesh generation for domains with small angles
• Provably good sampling and meshing of surfaces

This page was built for publication: Delaunay meshing of piecewise smooth complexes without expensive predicates