An acceleration technique for the computation of voronoi diagrams using graphics hardware

Authors:
Osami Yamamoto
Affiliations:
Department of Information Engineering, Faculty of Science and Technology, Meijo University
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
Year:
2005

Citing 4
Cited 0

Spatial tessellations: concepts and applications of Voronoi diagrams

Spatial tessellations: concepts and applications of Voronoi diagrams
OpenGL programming for the X Window System

OpenGL programming for the X Window System
Fast computation of generalized Voronoi diagrams using graphics hardware

Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Closest-point problems

SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Drawing Voronoi diagrams with graphics hardware is a very easy and fast way of obtaining images of several types of Voronoi diagrams. Although graphics hardware is a good tool for making such images, its drawing speed is not so high as we expect when we draw it only using naive algorithms. This paper describes a technique for accelerating the drawing speed by reducing some polygons we do not need to draw. We focus on the algorithm for normal two-dimensional Euclidean Voronoi diagrams and segment Voronoi diagrams.