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

DOI10.1145/3513264OpenAlexW4220804962WikidataQ113309845 ScholiaQ113309845MaRDI QIDQ5883709

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)

Related Items (2)

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

Uses Software

• PANG

Cites Work

• Unnamed Item
• Unnamed Item
• Conservative interpolation between unstructured meshes via supermesh construction
• Adaptive precision floating-point arithmetic and fast robust geometric predicates
• Domain decomposition methods for the diffusion equation with low-regularity solution
• Fast algorithms for intersection of non-matching grids using Plücker coordinates
• Algorithm 932
• Reentrant polygon clipping
• An Algorithm for Non-Matching Grid Projections with Linear Complexity
• A New Concept and Method for Line Clipping
• Monotone Multigrid Methods on Nonmatching Grids for Nonlinear Multibody Contact Problems
• Mathematical and Numerical Study of Transient Wave Scattering by Obstacles with a New Class of Arlequin Coupling
• Evaluating Local Approximations of the <em>L</em>²-Orthogonal Projection Between Non-Nested Finite Element Spaces

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