By Topic

Round-Tour Voronoi Diagrams

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fujii, H. ; Dept. of Math. Inf., Univ. of Tokyo, Tokyo, Japan ; Sugihara, K.

This paper proposes a new generalization of the Voronoi diagram. Suppose that restaurants and bookstores are located in a city, and we want to visit both a restaurant and bookstore and return to our house. To each pair of a restaurant and a bookstore, we can assign a region such that a resident in this region can visit the restaurant and bookstore in a round tour that is shorter than that for a visit to any other pair. The city is partitioned into these regions according to which pair of a restaurant and bookstore permits the shortest round tour. We call this partitioning a ``round-tour Voronoi Diagram" for the restaurants and bookstores. We study the basic properties of this Voronoi diagram and consider an efficient algorithm for its approximate construction.

Published in:

Voronoi Diagrams, 2009. ISVD '09. Sixth International Symposium on

Date of Conference:

23-26 June 2009