Share Email Print

Proceedings Paper

A novel computation algorithm of Voronoi diagrams for multiply-connected planar areas
Author(s): Bo Qian
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

This paper studies the practical generation of Voronoi diagrams of multiply-connected planar areas bounded by straight line segments. The key idea of the algorithm consists in calculating Voronoi polygon of every Voronoi object in planar areas independently. The main approach is divided into two steps. The first step is to calculate all relevant bisectors of the all Voronoi objects, and the second is to combine obtained bisectors into completed Voronoi polygons individually. The contents of steps are both very important and all codes are implemented in Visual C++ platform. The resulting codes are tested extensively on real-world data, and its practical running time seems to grow only linearly. Three statistical CPU-consumption charts have been drawn with the Voronoi diagrams computation data. The CPU-time consumptions records also gain the advantages over other published codes for computing Voronoi diagrams. The development of the algorithm is achieved by treating equidistant generation as a locus-tracing problem.

Paper Details

Date Published: 30 October 2009
PDF: 8 pages
Proc. SPIE 7498, MIPPR 2009: Remote Sensing and GIS Data Processing and Other Applications, 74983M (30 October 2009); doi: 10.1117/12.830286
Show Author Affiliations
Bo Qian, North China Univ. of Technology (China)

Published in SPIE Proceedings Vol. 7498:
MIPPR 2009: Remote Sensing and GIS Data Processing and Other Applications
Faxiong Zhang; Faxiong Zhang, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?