Modified skala's plane tested algorithm for line-polyhedron intersection

Abstract

Three modifications of known Skala's line clipping algorithm are presented. Basic Skala's algorithm represents the line as two intersected planes. Line intersects a triangular face of polyhedron only if both planes intersect the triangle. Following along the first plane triangles tested against the second plane and then line-triangle or line-half space intersection is tested. First modification consists in saving some temporary variables. Second modification consists in choosing of direction from the first triangle. Third modification consists in utilization of some precomputed values and a novel line-triangle intersection test. Three modifications give up to 26 % performance gain. © 2015 A. M. Konashkova.