Computing Restricted Voronoi Diagram on Graphics Hardware

Simple item page
dc.contributor.authorHan, Jiaweien_US
dc.contributor.authorYan, Dongmingen_US
dc.contributor.authorWang, Lilien_US
dc.contributor.authorZhao, Qinpingen_US
dc.contributor.editorJernej Barbic and Wen-Chieh Lin and Olga Sorkine-Hornungen_US
dc.date.accessioned2017-10-16T05:26:10Z
dc.date.available2017-10-16T05:26:10Z
dc.date.issued2017
dc.description.abstractThe 3D restricted Voronoi diagram (RVD), defined as the intersection of the 3D Voronoi diagram of a pointset with a mesh surface, has many applications in geometry processing. There exist several CPU algorithms for computing RVDs. However, such algorithms still cannot compute RVDs in realtime. In this short paper, we propose an efficient algorithm for computing RVDs on graphics hardware. We demonstrate the robustness and the efficiency of the proposed GPU algorithm by applying it to surface remeshing based on centroidal Voronoi tessellation.en_US
dc.description.sectionheadersShort Papers
dc.description.seriesinformationPacific Graphics Short Papers
dc.identifier.doi10.2312/pg.20171320
dc.identifier.isbn978-3-03868-051-2
dc.identifier.pages23-26
dc.identifier.urihttps://doi.org/10.2312/pg.20171320
dc.identifier.urihttps://diglib.eg.org:443/handle/10.2312/pg20171320
dc.publisherThe Eurographics Associationen_US
dc.titleComputing Restricted Voronoi Diagram on Graphics Hardwareen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
023-026.pdf
Size:
8.94 MB
Format:
Adobe Portable Document Format
Download
Collections
PG2017short