I/O-efficient shortest path queries in geometric spanners

被引：0
|
作者：
Maheshwari, A [1 ]
Smid, M
Zeh, N
机构：
[1] Carleton Univ, Sch Comp Sci, Ottawa, ON K1S 5B6, Canada
[2] Otto Von Guericke Univ, Fak Informat, Magdeburg, Germany
来源：
ALGORITHMS AND DATA STRUCTURES | 2001年 / 2125卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present I/O-efficient algorithms to construct planar Steiner spanners for point sets and sets of polygonal obstacles in the plane, and for constructing the "dumbbell" spanner of [6] for point sets in higher dimensions. As important ingredients to our algorithms, we present I/O-efficient algorithms to color the vertices of a graph of bounded degree, answer binary search queries on topology buffer trees, and preprocess a rooted tree for answering prioritized ancestor queries.
引用
收藏
页码：287 / 299
页数：13
相关论文
共 50 条
  • [1] I/O-efficient algorithms for computing planar geometric spanners
    Maheshwari, Anil
    Smid, Michiel
    Zeh, Norbert
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2008, 40 (03): : 252 - 271
  • [2] I/O-Efficient Contour Queries on Terrains
    Agarwal, Pankaj K.
    Molhave, Thomas
    Sadri, Bardia
    [J]. PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 268 - 284
  • [3] I/O-efficient undirected shortest paths
    Meyer, U
    Zeh, N
    [J]. ALGORITHMS - ESA 2003, PROCEEDINGS, 2003, 2832 : 434 - 445
  • [4] I/O-Efficient Range Minima Queries
    Afshani, Peyman
    Sitchinava, Nodari
    [J]. ALGORITHM THEORY - SWAT 2014, 2014, 8503 : 1 - +
  • [5] I/O-Efficient Shortest Path Algorithms for Undirected Graphs with Random or Bounded Edge Lengths
    Meyer, Ulrich
    Zeh, Norbert
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2012, 8 (03)
  • [6] I/O-Efficient undirected shortest paths with unbounded edge lengths
    Meyer, Ulrich
    Zeh, Norbert
    [J]. ALGORITHMS - ESA 2006, PROCEEDINGS, 2006, 4168 : 540 - 551
  • [7] I/O-Efficient Path Traversal in Succinct Planar Graphs
    Dillabaugh, Craig
    He, Meng
    Maheshwari, Anil
    Zeh, Norbert
    [J]. ALGORITHMICA, 2017, 77 (03) : 714 - 755
  • [8] I/O-Efficient Path Traversal in Succinct Planar Graphs
    Craig Dillabaugh
    Meng He
    Anil Maheshwari
    Norbert Zeh
    [J]. Algorithmica, 2017, 77 : 714 - 755
  • [9] Shortest path queries between geometric objects on surfaces
    Guo, Hua
    Maheshwari, Anil
    Nussbaum, Doron
    Sack, Joerg-Ruediger
    [J]. COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2007, PT 1, PROCEEDINGS, 2007, 4705 : 82 - +
  • [10] Efficient Graph Encryption Scheme for Shortest Path Queries
    Ghosh, Esha
    Kamara, Seny
    Tamassia, Roberto
    [J]. ASIA CCS'21: PROCEEDINGS OF THE 2021 ACM ASIA CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2021, : 516 - 525
12345