Shortest path queries in a simple polygon for 3D virtual museum

被引：0

作者：

Yang, Chenglei ^{[1
]}

Qi, Meng ^{[1
]}

Wang, Jiaye ^{[1
]}

Wang, Xiaoting ^{[1
]}

Meng, Xiangxu ^{[1
]}

机构：

[1] Shandong Univ, Sch Comp Sci & Technol, Jinan 250100, Peoples R China

来源：

COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2007, PT 1, PROCEEDINGS | 2007年 / 4705卷

基金：

中国国家自然科学基金;

关键词：

shortest path; voronoi diagram; virtual museum;

D O I：

暂无

中图分类号：

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

学科分类号：

0812 ;

摘要：

This paper proposes a new algorithm for querying the shortest path between two points s and t in a simple polygon P based on Voronoi diagram(VD). Based on the polygon's VD, we first find the Voronoi skeleton path S(s, t) from point s to t, and then along which we compute the shortest path SP(s, t) by visibility computing simultaneously. SP(s, t) can be reported in time O(n). It can be used in our 3D virtual museum system, in which the polygon's VD is used as a data structure for path planning, visibility computing, collision detection, and so on.

引用

页码：110 / +

页数：2

共 50 条

[1] OPTIMAL SHORTEST-PATH QUERIES IN A SIMPLE POLYGON
GUIBAS, LJ
HERSHBERGER, J
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1989, 39 (02) : 126 - 152
[2] A NEW DATA STRUCTURE FOR SHORTEST-PATH QUERIES IN A SIMPLE POLYGON
HERSHBERGER, J
[J]. INFORMATION PROCESSING LETTERS, 1991, 38 (05) : 231 - 235
[3] An optimal data structure for shortest rectilinear path queries in a simple rectilinear polygon
Schuierer, S
[J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1996, 6 (02) : 205 - 225
[4] Finding a shortest Hamiltonian path inside a simple polygon
Alsuwaiyel, MH
[J]. INFORMATION PROCESSING LETTERS, 1996, 59 (04) : 207 - 210
[5] Efficient Shortest Path Queries on 3D Weighted Terrain Surfaces for Moving Objects
Yan, Yinzhao
Wong, Raymond Chi-Wing
[J]. PROCEEDINGS OF THE 2024 25TH IEEE INTERNATIONAL CONFERENCE ON MOBILE DATA MANAGEMENT, MDM 2024, 2024, : 11 - 20
[6] A 3D VIRTUAL MUSEUM
Moldoveanu, Alin
Moldoveanu, Florica
Soceanu, Alexandru
Asavei, Victor
[J]. UNIVERSITY POLITEHNICA OF BUCHAREST SCIENTIFIC BULLETIN SERIES C-ELECTRICAL ENGINEERING AND COMPUTER SCIENCE, 2008, 70 (03): : 47 - 58
[7] LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON
ARKIN, EM
MITCHELL, JSB
SURI, S
[J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1995, 5 (04) : 369 - 395
[8] L1 shortest path queries in simple polygons
Bae, Sang Won
Wang, Haitao
[J]. THEORETICAL COMPUTER SCIENCE, 2019, 790 : 105 - 116
[9] Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon
Asano, Tetsuo
Mulzer, Wolfgang
Wang, Yajun
[J]. WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2010, 5942 : 9 - +
[10] From 3D virtual museum to 3D collaborative virtual workshop
Fominykh, Mikhail
Prasolova-Forland, Ekaterina
Morozov, Mikhail
[J]. 8TH IEEE INTERNATIONAL CONFERENCE ON ADVANCED LEARNING TECHNOLOGIES, PROCEEDINGS, 2008, : 443 - +

← 1 2 3 4 5 →