Numerical stability of geometric algorithms
SCG '87 Proceedings of the third annual symposium on Computational geometry
Efficient Delaunay triangulation using rational arithmetic
ACM Transactions on Graphics (TOG)
OBBTree: a hierarchical structure for rapid interference detection
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
A fast triangle-triangle intersection test
Journal of Graphics Tools
Interval arithmetic yields efficient dynamic filters for computational geometry
Proceedings of the fourteenth annual symposium on Computational geometry
Exact geometric predicates using cascaded computation
Proceedings of the fourteenth annual symposium on Computational geometry
Handbook of discrete and computational geometry
A core library for robust numeric and geometric computation
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Computational Geometry in C
ERIT: a collection of efficient and reliable intersection tests
Journal of Graphics Tools
| Hi-index | 0.00 |
Implementors of triangle/triangle intersection tests often opt to forego exact calculations for speed reasons. It is widely known that such code will fail for certain inputs, but it is not evident from the literature that published intersection tests implemented using floating-point arithmetic are not stable. We show how such a test can fail on a triangle pair that is widely separated in space. We find that an exact intersection test can be implemented with a modest speed penalty.