Loading…

Voronoi rasterization of sparse point sets

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Talton, J.O., Carr, N.A., Hart, J.C.
Format: Conference Proceeding
Language:English
Subjects:
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 143
container_issue
container_start_page 33
container_title
container_volume
creator Talton, J.O.
Carr, N.A.
Hart, J.C.
description 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.
doi_str_mv 10.1109/PBG.2005.194061
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1500315</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1500315</ieee_id><sourcerecordid>1500315</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-536ce779c94b7d1a6eae3578bc35bbe3d5b1b161639ffceffa34b8ebfe2d08a33</originalsourceid><addsrcrecordid>eNotzD1PwzAQAFBLgEQpnRlYPCMl3OX8EY9Q0YJUCYaKtbKTs2QEcWRngV_PANPbnhA3CC0iuPu3x33bAegWnQKDZ-KKHGhjqQN7LlaoERvbI12KTa0fAIBoVa_VSty955KnnGTxdeGSfvyS8iRzlHX2pbKcc5oWWXmp1-Ii-s_Km3_X4rh7Om6fm8Pr_mX7cGiSg6XRZAa21g1OBTuiN-yZtO3DQDoEplEHDGjQkItx4Bg9qdBziNyN0Huitbj9axMzn-aSvnz5PqEGINT0C4YKQjw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Voronoi rasterization of sparse point sets</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Talton, J.O. ; Carr, N.A. ; Hart, J.C.</creator><creatorcontrib>Talton, J.O. ; Carr, N.A. ; Hart, J.C.</creatorcontrib><description>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.</description><identifier>ISSN: 1511-7813</identifier><identifier>ISBN: 3905673207</identifier><identifier>ISBN: 9783905673203</identifier><identifier>DOI: 10.1109/PBG.2005.194061</identifier><language>eng</language><publisher>IEEE</publisher><subject>Computer displays ; Computer graphics ; Data visualization ; Face detection ; Hardware ; Interpolation ; Modems ; Ray tracing ; Rendering (computer graphics) ; Surface texture</subject><ispartof>Proceedings Eurographics/IEEE VGTC Symposium Point-Based Graphics, 2005, 2005, p.33-143</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1500315$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2051,4035,4036,27904,54899</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1500315$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Talton, J.O.</creatorcontrib><creatorcontrib>Carr, N.A.</creatorcontrib><creatorcontrib>Hart, J.C.</creatorcontrib><title>Voronoi rasterization of sparse point sets</title><title>Proceedings Eurographics/IEEE VGTC Symposium Point-Based Graphics, 2005</title><addtitle>PBG</addtitle><description>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.</description><subject>Computer displays</subject><subject>Computer graphics</subject><subject>Data visualization</subject><subject>Face detection</subject><subject>Hardware</subject><subject>Interpolation</subject><subject>Modems</subject><subject>Ray tracing</subject><subject>Rendering (computer graphics)</subject><subject>Surface texture</subject><issn>1511-7813</issn><isbn>3905673207</isbn><isbn>9783905673203</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotzD1PwzAQAFBLgEQpnRlYPCMl3OX8EY9Q0YJUCYaKtbKTs2QEcWRngV_PANPbnhA3CC0iuPu3x33bAegWnQKDZ-KKHGhjqQN7LlaoERvbI12KTa0fAIBoVa_VSty955KnnGTxdeGSfvyS8iRzlHX2pbKcc5oWWXmp1-Ii-s_Km3_X4rh7Om6fm8Pr_mX7cGiSg6XRZAa21g1OBTuiN-yZtO3DQDoEplEHDGjQkItx4Bg9qdBziNyN0Huitbj9axMzn-aSvnz5PqEGINT0C4YKQjw</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Talton, J.O.</creator><creator>Carr, N.A.</creator><creator>Hart, J.C.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2005</creationdate><title>Voronoi rasterization of sparse point sets</title><author>Talton, J.O. ; Carr, N.A. ; Hart, J.C.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-536ce779c94b7d1a6eae3578bc35bbe3d5b1b161639ffceffa34b8ebfe2d08a33</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Computer displays</topic><topic>Computer graphics</topic><topic>Data visualization</topic><topic>Face detection</topic><topic>Hardware</topic><topic>Interpolation</topic><topic>Modems</topic><topic>Ray tracing</topic><topic>Rendering (computer graphics)</topic><topic>Surface texture</topic><toplevel>online_resources</toplevel><creatorcontrib>Talton, J.O.</creatorcontrib><creatorcontrib>Carr, N.A.</creatorcontrib><creatorcontrib>Hart, J.C.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE/IET Electronic Library</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Talton, J.O.</au><au>Carr, N.A.</au><au>Hart, J.C.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Voronoi rasterization of sparse point sets</atitle><btitle>Proceedings Eurographics/IEEE VGTC Symposium Point-Based Graphics, 2005</btitle><stitle>PBG</stitle><date>2005</date><risdate>2005</risdate><spage>33</spage><epage>143</epage><pages>33-143</pages><issn>1511-7813</issn><isbn>3905673207</isbn><isbn>9783905673203</isbn><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.</abstract><pub>IEEE</pub><doi>10.1109/PBG.2005.194061</doi><tpages>111</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1511-7813
ispartof Proceedings Eurographics/IEEE VGTC Symposium Point-Based Graphics, 2005, 2005, p.33-143
issn 1511-7813
language eng
recordid cdi_ieee_primary_1500315
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Computer displays
Computer graphics
Data visualization
Face detection
Hardware
Interpolation
Modems
Ray tracing
Rendering (computer graphics)
Surface texture
title Voronoi rasterization of sparse point sets
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T19%3A58%3A43IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Voronoi%20rasterization%20of%20sparse%20point%20sets&rft.btitle=Proceedings%20Eurographics/IEEE%20VGTC%20Symposium%20Point-Based%20Graphics,%202005&rft.au=Talton,%20J.O.&rft.date=2005&rft.spage=33&rft.epage=143&rft.pages=33-143&rft.issn=1511-7813&rft.isbn=3905673207&rft.isbn_list=9783905673203&rft_id=info:doi/10.1109/PBG.2005.194061&rft_dat=%3Cieee_6IE%3E1500315%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i90t-536ce779c94b7d1a6eae3578bc35bbe3d5b1b161639ffceffa34b8ebfe2d08a33%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1500315&rfr_iscdi=true