Fast and Memory-Efficient Voronoi Diagram Construction on Triangle Meshes.

Qin, 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:

[img] PDF
SGP-CGF paper.pdf - Accepted Version
Restricted to Repository staff only until 14 August 2018.
Available under License Creative Commons Attribution Non-commercial No Derivatives.

1MB

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: Unnamed user with email symplectic@symplectic
Deposited On:05 Sep 2017 11:14
Last Modified:05 Sep 2017 11:14

Downloads

Downloads per month over past year

More statistics for this item...
Repository Staff Only -