Two Algorithms for Fast Polyhedron Ray-Tracing

ＴｗｏＡｌｇｏｒｉｔｈｍｓｆｏｒＦａｓｔＰｏｌｙｈｅｄｒｏｎＲａｙ－ＴｒａｃｉｎｇＺｈａｎｇＱｉａｎＳｈｉＪｉａｏｙｉｎｇＣａｉＨｏｎｇＣＡＤ＆ＣＧＳｔａｔｅＫｅｙＬａｂ．，ＺｈｅｊｉａｎｇＵｎｉｖｅｒｓｉｔｙ，３１００２７ＦｏｓｈａｎＥｎｔｅｒｐｒ...

Two Algorithms for Fast Polyhedron Ray-Tracing

This note presents two fast polyhedron ray-tracing algorithms that can be applied not only in ray-convex polyhedron intersection, but also in ray-concave polyhedron intersection (Algorithm 2 permits polygons to contain internal loops of not).In the basis of surface trian gulation, Algorithm 1 can accelerate the surface normal vector interpolation by the intersection point's parameters. And besides, Algorithm 2 does not need any pre_procession such as surface triangulation. Moreover, it requires a few memories with more difficult operations such as division, extraction of roots and transcendental functions avoided entirely. Their simplicity and efficiency permit easy software or hardware implementation.