Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulations

DOI10.1145/336154.336222MaRDI QIDQ5361548zbMATH 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.336222

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited in

(6)

• A fast solver for the Stokes equations with distributed forces in complex geometries.
• Meshless methods with application to metal forming
• Contribution of computational mechanics in numerical simulation of machining and blancking: state-of-the-art
• Hybrid meshing using constrained Delaunay triangulation for viscous flow simulations
• Generic families of finite metric spaces with identical or trivial 1-dimensional persistence
• Incrementally constructing and updating constrained Delaunay tetrahedralizations with finite precision coordinates

This page was built for publication: Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulations

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