Parsimonious simplicial intersection algorithm

DOI10.1145/3766904MaRDI QIDQ6858159zbMATH OpenFDO

Authors Conor McCoid

Publication date 13 February 2026

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

numerical geometric intersectionrobustnesssimplices

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites work

• A 3D mortar method for solid mechanics
• A Brief Survey of Clipping and Intersection Algorithms with a List of References (including Triangle-Triangle Intersections)
• A combined finite‐discrete element method in transient dynamics of fracturing solids
• A New Concept and Method for Line Clipping
• A Provably Robust Algorithm for Triangle-triangle Intersections in Floating-point Arithmetic
• Algorithm 932: PANG: software for nonmatching grid projections in 2D and 3D with linear complexity
• An algorithm for non-matching grid projections with linear complexity
• An efficient and robust GPGPU-parallelized contact algorithm for the combined finite-discrete element method
• Reentrant polygon clipping

This page was built for publication: Parsimonious simplicial intersection algorithm

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