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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.