The Community for Technology Leaders
Proceedings Eurographics/IEEE VGTC Symposium Point-Based Graphics (2005)
Stony Brook, NY, USA
June 20, 2005 to June 21, 2005
ISSN: 1511-7813
ISBN: 3-905673-20-7
pp: 33-143
J.O. Talton , Illinois Univ., Urbana, IL, USA
N.A. Carr , Illinois Univ., Urbana, IL, USA
J.C. Hart , Illinois Univ., Urbana, IL, USA
ABSTRACT
Point-based representations are becoming increasingly common in computer graphics, especially for visualizing data sets where the number of points is large relative to the number of pixels involved in their display. When dealing with sparse point sets, however, many traditional rendering algorithms for point data perform poorly, either by generating blurry or non-occluding surface representations or by requiring extensive pre-processing to yield good results. In this paper we present a novel method for point-based surface visualization that we call Voronoi rasterization. Voronoi rasterization uses modern programmable graphics hardware to generate occluding surface representations from sparse, oriented point sets without preprocessing. In particular, Voronoi rasterization clips away overlapping flaps between neighboring splats and generates an approximation of the Voronoi diagram of the points under the surface's geodesic distance. To approximate smooth shading and texturing on top of this clipped surface, our method uses existing techniques to construct a smoothly blended screen-space attribute field that implicitly accounts for neighborhood relations between points.
INDEX TERMS
surface texturing, Voronoi rasterization, sparse point set, point-based representation, computer graphics, data visualization, rendering algorithm, surface representation, point-based surface visualization, programmable graphics hardware, surface geodesic distance, approximate smooth shading
CITATION
J.O. Talton, N.A. Carr, J.C. Hart, "Voronoi rasterization of sparse point sets", Proceedings Eurographics/IEEE VGTC Symposium Point-Based Graphics, vol. 00, no. , pp. 33-143, 2005, doi:10.1109/PBG.2005.194061
95 ms
(Ver 3.3 (11022016))