A robust segment/triangle intersection algorithm for interference tests. Efficiency study
暂无分享,去创建一个
Juan José Jiménez-Delgado | Rafael Jesús Segura | Francisco R. Feito-Higueruela | R. Segura | F. Feito-Higueruela
[1] Leonidas J. Guibas,et al. Epsilon geometry: building robust algorithms from imprecise computations , 1989, SCG '89.
[2] Chee-Keng Yap,et al. Towards Exact Geometric Computation , 1997, Comput. Geom..
[3] Tomas Akenine-Möller,et al. An Evaluation Framework for Ray-Triangle Intersection Algorithms , 2005, J. Graph. Tools.
[4] Alejandro M. García-Alonso,et al. Solving the collision detection problem , 1994, IEEE Computer Graphics and Applications.
[5] Carlo Cattani,et al. Dimension-independent modeling with simplicial complexes , 1993, TOGS.
[6] Rafael Jesús Segura,et al. Algorithms to Test Ray-Triangle Intersection. Comparative Study , 2001, WSCG.
[7] Andrew S. Glassner,et al. Graphics Gems , 1990 .
[8] D. Badouel. An efficient ray-polygon intersection , 1990 .
[9] Rafael Jesús Segura,et al. An algorithm for determining intersection segment-polygon in 3D , 1998, Comput. Graph..
[10] P. Shirley,et al. Optimizing Ray-Triangle Intersection via Automated Search , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.
[11] Christoph M. Hoffmann,et al. Geometric and Solid Modeling: An Introduction , 1989 .
[12] Andrew S. Glassner,et al. An introduction to ray tracing , 1989 .
[13] Tomas Akenine-Möller,et al. Fast, Minimum Storage Ray-Triangle Intersection , 1997, J. Graphics, GPU, & Game Tools.
[14] Tamal K. Dey,et al. Triangulation and CSG representation of polyhedra with arbitrary genus , 1991, SCG '91.