Delaunay meshing of piecewise smooth complexes without expensive predicates

DOI10.3390/A2041327zbMATH Open1445.65006OpenAlexW1965285142MaRDI QIDQ1662514FDOQ1662514

Authors: Joshua A. Levine, Tamal K. 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

Recommendations

• scientific article; zbMATH DE number 5239226
• Delaunay refinement for piecewise smooth complexes
• Delaunay refinement for piecewise smooth complexes
• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• Delpsc

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)

Cites Work

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

Cited In (13)

• DELAUNAY REFINEMENT ALGORITHMS FOR ESTIMATING LOCAL FEATURE SIZE IN 2D AND 3D
• Triangulating submanifolds: an elementary and quantified version of Whitney's method
• Delaunay refinement for piecewise smooth complexes
• CGALmesh: a generic framework for Delaunay mesh generation
• There are simple and robust refinements (almost) as good as Delaunay
• Delaunay refinement for piecewise smooth complexes
• Title not available (Why is that?)
• Non-simplicial Delaunay meshing via approximation by radical partitions
• Delaunay Graph Based Inverse Distance Weighting for Fast Dynamic Meshing
• The topological correctness of PL approximations of isomanifolds
• Combining recursive spatial decompositions and domain Delaunay tetrahedrizations for meshing arbitrarily shaped curved solid models
• Localized Delaunay refinement for piecewise-smooth complexes
• Delpsc

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

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