Skip to main content
Article thumbnail
Location of Repository

I/O-efficient shortest path queries in geometric spanners

By Anil Maheshwari and Michiel Smid

Abstract

Abstract. 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.

Publisher: SpringerVerlag
Year: 2001
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.6991
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.scs.carleton.ca/~ma... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.