Tools
ToolsQin, Y., Yu, H. and Zhang, J. J., 2017. Fast and Memory-Efficient Voronoi Diagram Construction on Triangle Meshes. Computer Graphics Forum, 36 (5), 93 - 104.
Full text available as:
|
PDF
SGP-CGF paper.pdf - Accepted Version Available under License Creative Commons Attribution Non-commercial No Derivatives. 1MB | |
|
Copyright to original material in this document is with the original owner(s). Access to this content through BURO is granted on condition that you use it only for research, scholarly or other non-commercial purposes. If you wish to use it for any other purposes, you must contact BU via BURO@bournemouth.ac.uk. Any third party copyright material in this document remains the property of its respective owner(s). BU grants no licence for further use of that third party material. |
DOI: 10.1111/cgf.13248
Abstract
© 2017 The Author(s) Computer Graphics Forum © 2017 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd. 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.
| Item Type: | Article |
|---|---|
| ISSN: | 0167-7055 |
| Group: | Faculty of Science & Technology |
| ID Code: | 29652 |
| Deposited By: | Symplectic RT2 |
| Deposited On: | 05 Sep 2017 11:14 |
| Last Modified: | 14 Mar 2022 14:06 |
Downloads
Downloads per month over past year
| Repository Staff Only - |