Shortest path queries between geometric objects on surfaces

被引：0
|
作者：
Guo, Hua [1 ]
Maheshwari, Anil [1 ]
Nussbaum, Doron [1 ]
Sack, Joerg-Ruediger [1 ]
机构：
[1] Carleton Univ, Sch Comp Sci, 1125 Colonel Dr, Ottawa, ON K1S 5B6, Canada
来源：
COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2007, PT 1, PROCEEDINGS | 2007年 / 4705卷
基金：
加拿大自然科学与工程研究理事会;
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We consider geometric shortest path queries between arbitrary pairs of objects on a connected polyhedral surface P of genus g. The query objects are points, vertices, edges, segments, faces, chains, regions and sets of these. The surface P consists of n positively weighted triangular faces. The cost of a path on P is the weighted sum of Euclidean lengths of the sub-paths within each face of P. We present generic algorithms which provide approximate solutions.
引用
收藏
页码：82 / +
页数：2
相关论文
共 50 条
  • [1] 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
  • [2] Approximate shortest path queries on weighted polyhedral surfaces
    Aleksandrov, Lyudmil
    Djidjev, Hristo N.
    Guo, Hua
    Maheshwari, Anil
    Nussbaum, Doron
    Sack, Jorg-Rudiger
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2006, PROCEEDINGS, 2006, 4162 : 98 - 109
  • [3] Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
    Aleksandrov, Lyudmil
    Djidjev, Hristo N.
    Guo, Hua
    Maheshwari, Anil
    Nussbaum, Doron
    Sack, Joerg-Ruediger
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2010, 44 (04) : 762 - 801
  • [4] Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
    Lyudmil Aleksandrov
    Hristo N. Djidjev
    Hua Guo
    Anil Maheshwari
    Doron Nussbaum
    Jörg-Rüdiger Sack
    [J]. Discrete & Computational Geometry, 2010, 44 : 762 - 801
  • [5] I/O-efficient shortest path queries in geometric spanners
    Maheshwari, A
    Smid, M
    Zeh, N
    [J]. ALGORITHMS AND DATA STRUCTURES, 2001, 2125 : 287 - 299
  • [6] Proxies for Shortest Path and Distance Queries
    Ma, Shuai
    Feng, Kaiyu
    Li, Jianxin
    Wang, Haixun
    Cong, Gao
    Huai, Jinpeng
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2016, 28 (07) : 1835 - 1850
  • [7] SHORTEST PATH QUERIES IN RECTILINEAR WORLDS
    De Berg, Mark
    Van Kreveld, Marc
    Nilsson, Bengt J.
    Overmars, Mark
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1992, 2 (03) : 287 - 309
  • [8] Optimization and evaluation of shortest path queries
    Edward P. F. Chan
    Heechul Lim
    [J]. The VLDB Journal, 2007, 16 : 343 - 369
  • [9] Engineering Generalized Shortest Path Queries
    Rice, Michael N.
    Tsotras, Vassilis J.
    [J]. 2013 IEEE 29TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2013, : 949 - 960
  • [10] Optimization and evaluation of shortest path queries
    Chan, Edward P. F.
    Lim, Heechul
    [J]. VLDB JOURNAL, 2007, 16 (03): : 343 - 369
12345