2003
Journal article
Unknown
Fast tetrahedron-tetrahedron overlap algorithm
Ganovelli F., Ponchio F., Rocchini C.
Tetrahedra Geometric search Point location
We present an algorithm to test two tetrahedra for overlap. The algorithm is based on a dimension reduction technique that allows to apply the Separating Axis Theorem avoiding part of the computation needed to perform the Separating Axis Test. Source code is available online.
Source: ACM transactions on intelligent systems and technology (Print) 7 (2003): 17–26.
Publisher: Association for Computing Machinery, New York, NY , Stati Uniti d'America
Back to previous page
BibTeX entry
@article{oai:it.cnr:prodotti:68271,
title = {Fast tetrahedron-tetrahedron overlap algorithm},
author = {Ganovelli F. and Ponchio F. and Rocchini C.},
publisher = {Association for Computing Machinery, New York, NY , Stati Uniti d'America},
journal = {ACM transactions on intelligent systems and technology (Print)},
volume = {7},
pages = {17–26},
year = {2003}
}
0000-0002-0378-9188CNR ExploRA