GPU fast and robust computation for barycentric coordinates and intersection of planes using projective representation

Abstract

This paper describes algorithms for fast and robust GPU computation of barycentric coordinates and intersection of two planes. The presented algorithms are based on matrix-vector operations which make the algorithms convenient for GPU or SSE based architectures. Also a new formula for finding the closest point of two planes intersection to the given point is given.