A Provably Robust Algorithm for Triangle-triangle Intersections in Floating-point Arithmetic

DOI10.1145/3513264MaRDI QIDQ5883709zbMATH OpenOpenAlexWikidataFDO

Authors Conor McCoid, Martin J. Gander

Publication date 22 March 2023

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

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

zbMATH Keywords

robustnessfloating-point arithmeticnon-matching gridsmesh intersectionpolygon clippingadvancing front algorithms

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Recommendations

• scientific article; zbMATH DE number 1008329
• Fast and accurate floating point summation with application to computational geometry
• Floating-point arithmetic for computational geometry problems with uncertain data
• Adaptive precision floating-point arithmetic and fast robust geometric predicates
• Numerical Software with Result Verification
• Computing convex hull in a floating point arithmetic
• Verifiable implementations of geometric algorithms using finite precision arithmetic
• Delaunay triangulations in three dimensions with finite precision arithmetic
• On computation of triangulation with piecewise linearity and separability

Cites work

• scientific article; zbMATH DE number 51361 (Why is no real title available?)
• scientific article; zbMATH DE number 3453104 (Why is no real title available?)
• A New Concept and Method for Line Clipping
• Adaptive precision floating-point arithmetic and fast robust geometric predicates
• 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
• Conservative interpolation between unstructured meshes via supermesh construction
• Domain decomposition methods for the diffusion equation with low-regularity solution
• Evaluating local approximations of the \(L^2\)-orthogonal projection between non-nested finite element spaces
• Fast algorithms for intersection of non-matching grids using Plücker coordinates
• 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
• Reentrant polygon clipping

Cited in

(3)

• The boundary element method for acoustic transmission with nonconforming grids
• A Brief Survey of Clipping and Intersection Algorithms with a List of References (including Triangle-Triangle Intersections)
• A stable conservative Lagrange-Galerkin scheme to pure convection equations with mesh intersection

Describes a project that uses

Uses Software

• PANG

This page was built for publication: A Provably Robust Algorithm for Triangle-triangle Intersections in Floating-point Arithmetic

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