Voronoi Rasterization of Sparse Point Sets

Talton, Jerry O.; Carr, Nathan A.; Hart, John C.

Voronoi Rasterization of Sparse Point Sets

Files

033-037.pdf (3.41 MB)

Date

2005

Authors

Talton, Jerry O.
Carr, Nathan A.
Hart, John C.

Publisher

The Eurographics Association

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.

        @inproceedings{:10.2312/SPBG/SPBG05/033-037
,
booktitle = {Eurographics Symposium on Point-Based Graphics (2005)
},
editor = {Marc Alexa and Szymon Rusinkiewicz and Mark Pauly and Matthias Zwicker
},
title = {{Voronoi Rasterization of Sparse Point Sets
}},
author = {Talton, Jerry O. and 
Carr, Nathan A. and 
Hart, John C.
},
year = {2005
},
publisher = {The Eurographics Association
},
ISSN = {1811-7813
},
ISBN = {3-905673-20-7
},
DOI = {/10.2312/SPBG/SPBG05/033-037
}
}