Epsilon geometry: building robust algorithms from imprecise computations
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Geometric and solid modeling: an introduction
Geometric and solid modeling: an introduction
An efficient ray-polygon intersection
Graphics gems
An introduction to ray tracing
An introduction to ray tracing
Triangulation and CSG representation of polyhedra with arbitrary genus
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Dimension-independent modeling with simplicial complexes
ACM Transactions on Graphics (TOG)
Solving the Collision Detection Problem
IEEE Computer Graphics and Applications
Towards exact geometric computation
Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
Fast, minimum storage ray-triangle intersection
Journal of Graphics Tools
Tetra-trees properties in graphic interaction
Graphical Models
From theoretical graphic objects to real free-form solids
Information Sciences: an International Journal
Hi-index | 0.00 |
In this paper, a new algorithm for the intersection between a segment and a triangle in 3D is presented. This algorithm is suitable for interference tests between moving polyhedral solids, as is shown in the times study. In this situation it is necessary to determine whether the interference between triangles takes place (boolean test), and in some applications to determine the intersection point. When solids move certain changing information, such as the triangle normal, cannot be stored so the algorithms cannot take advantage of pre-calculations. A set of tests and a study of the computational cost of the new algorithm compared with classical algorithms are provided. These algorithms and studies can be used and extended by programmers in real applications.