.png){kind=icon}
Return
Parsimonious Simplicial Intersection Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1145/3766904.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Intersection algorithms are crucial in many applications, but they may not be robust. Without robustness, these algorithms may fail to correctly identify large intersections. To prevent that, this article develops a parsimonious algorithm for the intersection of simplices. This generalizes earlier algorithms on triangle and tetrahedral intersections. This article outlines the algorithm and its parsimony and proves its consistency. Numerical experiments confirm its applicability.
Keywords:
numerical geometric intersection
simplices
robustness
Journal
IF:
3.2
Papers:
35
Citations:
5.1K
Organization
Cited Papers
ShareSaveShareSaveShareSaveShareSaveA Brief Survey of Clipping and Intersection Algorithms with a List of References (including Triangle-Triangle Intersections)*.png)
Informatica
OAAI
InformaticaIF2.8
OAAIShareSave
View more