Intersection of tetrahedra

DOI10.1145/3729532MaRDI QIDQ6937540zbMATH OpenFDO

Authors Conor McCoid, Martin J. Gander

Publication date 26 August 2025

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

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

zbMATH Keywords

algorithmic robustnessgeometric intersectiontetrahedra

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 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
• Domain decomposition methods for the diffusion equation with low-regularity solution
• Iterated snap rounding
• Mathematical and numerical study of transient wave scattering by obstacles with a new class of Arlequin coupling
• Monotone Multigrid Methods on Nonmatching Grids for Nonlinear Multibody Contact Problems
• Multiscale Finite Element Methods
• Reentrant polygon clipping
• Rounding meshes in 3D
• The Arlequin method as a flexible engineering design tool

This page was built for publication: Intersection of tetrahedra

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