Scientific article

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

Published inACM transactions on mathematical software, vol. 48, no. 2, p. 1-30; 17
Publication date2022-05-26
First online date2022-05-26

Motivated by the unexpected failure of the triangle intersection component of the Projection Algorithm for Nonmatching Grids (PANG), this article provides a robust version with proof of backward stability. The new triangle intersection algorithm ensures consistency and parsimony across three types of calculations. The set of intersections produced by the algorithm, called representations, is shown to match the set of geometric intersections, called models. The article concludes with a comparison between the old and new intersection algorithms for PANG using an example found to reliably generate failures in the former.

Citation (ISO format)
MCCOID, Conor Joseph, GANDER, Martin Jakob. A Provably Robust Algorithm for Triangle-triangle Intersections in Floating-point Arithmetic. In: ACM transactions on mathematical software, 2022, vol. 48, n° 2, p. 1–30. doi: 10.1145/3513264
Main files (1)
Article (Published version)
ISSN of the journal0098-3500

Technical informations

Creation04/03/2023 1:02:52 PM
First validation04/05/2023 2:36:01 PM
Update time04/05/2023 2:36:01 PM
Status update04/05/2023 2:36:01 PM
Last indexation05/06/2024 3:42:17 PM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack