Fast and Memory-Efficient Voronoi Diagram Construction on Triangle Meshes
| dc.contributor.author | Qin, Yipeng | en_US |
| dc.contributor.author | Yu, Hongchuan | en_US |
| dc.contributor.author | Zhang, Jiangjun | en_US |
| dc.contributor.editor | Bærentzen, Jakob Andreas and Hildebrandt, Klaus | en_US |
| dc.date.accessioned | 2017-07-02T17:37:48Z | |
| dc.date.available | 2017-07-02T17:37:48Z | |
| dc.date.issued | 2017 | |
| dc.description.abstract | Geodesic based Voronoi diagrams play an important role in many applications of computer graphics. Constructing such Voronoi diagrams usually resorts to exact geodesics. However, exact geodesic computation always consumes lots of time and memory, which has become the bottleneck of constructing geodesic based Voronoi diagrams. In this paper, we propose the window-VTP algorithm, which can effectively reduce redundant computation and save memory. As a result, constructing Voronoi diagrams using the proposed window-VTP algorithm runs 3-8 times faster than Liu et al.'s method [LCT11], 1.2 times faster than its FWP-MMP variant and more importantly uses 10-70 times less memory than both of them. | en_US |
| dc.description.number | 5 | |
| dc.description.sectionheaders | Meshing | |
| dc.description.seriesinformation | Computer Graphics Forum | |
| dc.description.volume | 36 | |
| dc.identifier.doi | 10.1111/cgf.13248 | |
| dc.identifier.issn | 1467-8659 | |
| dc.identifier.pages | 093-104 | |
| dc.identifier.uri | https://doi.org/10.1111/cgf.13248 | |
| dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf13248 | |
| dc.publisher | The Eurographics Association and John Wiley & Sons Ltd. | en_US |
| dc.subject | I.3.5 [Computer Graphics] | |
| dc.subject | Computational Geometry and Object Modeling | |
| dc.subject | Curve | |
| dc.subject | surface | |
| dc.subject | solid | |
| dc.subject | and object representations | |
| dc.title | Fast and Memory-Efficient Voronoi Diagram Construction on Triangle Meshes | en_US |