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

doi:10.1145/3513264

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

2022-05-26

0

OA

AI

DOI：10.1145/3513264

原文链接

原文求助

摘要

En 中文

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.

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

摘要

期刊

机构

引用论文