Evaluating the visibility algorithm of point-based graphics for real-time applications
Rodrigo A. M. Braga, Alexandre Valdetaro, Gustavo Nunes, Alberto Barbosa Raposo, Bruno Feijó, Pontifical Catholic · 2011
In this paper we present a detailed study and some improvements of the technique Direct Visibility of Point Sets [Katz et al. 2007], which proposes an operator that can distinguish visible points from occluded points in a point cloud. The operator is not originally intended for real-time usage due to its computational complexity, so we present an improvement that maintains the visual quality and allows it to be used in real-time. We also expose a problem that is not evident in the original work, the operator requires the computation of a convex hull with a set of points. This convex hull is calculated with QuickHull algorithm [Barber et al. 1996], but the point set generated into the operator causes a worst case entry for QuickHull, making it slower than expected. We also provide some options for speeding the convex hull algorithm that trade off visual quality for performance.