Show simple item record

dc.contributor.authorTalton, Jerry O.en_US
dc.contributor.authorCarr, Nathan A.en_US
dc.contributor.authorHart, John C.en_US
dc.contributor.editorMarc Alexa and Szymon Rusinkiewicz and Mark Pauly and Matthias Zwickeren_US
dc.date.accessioned2014-01-29T16:31:41Z
dc.date.available2014-01-29T16:31:41Z
dc.date.issued2005en_US
dc.identifier.isbn3-905673-20-7en_US
dc.identifier.issn1811-7813en_US
dc.identifier.urihttp://dx.doi.org/10.2312/SPBG/SPBG05/033-037en_US
dc.description.abstractPoint-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.en_US
dc.publisherThe Eurographics Associationen_US
dc.titleVoronoi Rasterization of Sparse Point Setsen_US
dc.description.seriesinformationEurographics Symposium on Point-Based Graphics (2005)en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record