Properties and an Approximation Algorithm of Round-Tour Voronoi Diagrams

被引：0

作者：

Fujii, Hidenori ^{[1
]}

Sugihara, Kokichi

机构：

[1] Univ Tokyo, Dept Math Informat, Tokyo 1138656, Japan

来源：

TRANSACTIONS ON COMPUTATIONAL SCIENCE IX | 2010年 / 6290卷

基金：

日本学术振兴会;

关键词：

Generalized Voronoi diagram; round-tour; restaurants and bookstores; facility location analysis; shortest round tour;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper proposes a new generalization of the Voronoi diagram. Consider two kinds of facilities located in a city, for example, restaurants and bookstores. We want to visit both and return to our house. To each pair of a restaurant and a bookstore is assigned a region such that a resident in this region can visit them in a shorter round tour than visiting 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.

引用

页码：109 / +

页数：2

共 50 条

[41] AN OPTIMAL ALGORITHM FOR CONSTRUCTING ORIENTED VORONOI DIAGRAMS AND GEOGRAPHIC NEIGHBORHOOD GRAPHS
CHANG, MS
HUANG, NF
TANG, CY
INFORMATION PROCESSING LETTERS, 1990, 35 (05) : 255 - 260
[42] A MAXIMUM INSCRIBED CIRCLE ALGORITHM BASED ON VORONOI DIAGRAMS AND GEOMETRY EQUATIONS
Beyhan, Burak
Guler, Cuneyt
Taga, Hidayet
7TH INTERNATIONAL CONFERENCE ON CARTOGRAPHY AND GIS, VOLS 1 AND 2, 2018, : 63 - 72
[43] A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
Bohler, Cecilia
Liu, Chih-Hung
Papadopoulou, Evanthia
Zavershynskyi, Maksym
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2016, 59 : 26 - 38
[44] Research of localization algorithm based on weighted Voronoi diagrams for wireless sensor network
Shaobin Cai
Hongqi Pan
Zhenguo Gao
Nianmin Yao
Zhiqiang Sun
EURASIP Journal on Wireless Communications and Networking, 2014
[45] An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments
Bae, Sang Won
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2016, 52 : 34 - 43
[46] Topology-Oriented Incremental Algorithm for the Robust Construction of the Voronoi Diagrams of Disks
Lee, Mokwon
Sugihara, Kokichi
Kim, Deok-Soo
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2016, 43 (02):
[47] Study on image reconstruction of diffraction tomography with density compensation algorithm by Voronoi diagrams
Fang, Jie
Liu, Ren-Jin
Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2014, 42 (07): : 1268 - 1272
[48] A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions
Kühn, U
DISCRETE APPLIED MATHEMATICS, 2001, 109 (1-2) : 177 - 196
[49] Raster-Based Parallel Multiplicatively Weighted Voronoi Diagrams Algorithm with MapReduce
Xu, Ming
Cao, Han
Wang, Chang-ying
ECOSYSTEM ASSESSMENT AND FUZZY SYSTEMS MANAGEMENT, 2014, 254 : 177 - 188
[50] An Optimal Algorithm for Higher-Order Voronoi Diagrams in the Plane: The Usefulness of Nondeterminism
Chan, Timothy M.
Cheng, Pingan
Zheng, Da Wei
PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 4451 - 4463

← 1 2 3 4 5 →