Results 1  10
of
385,129
Shortest path queries in planar graphs
 In Proc. 32nd Annu. ACM Symp. Theory Comput. (STOC) (2000
"... The problem of processing shortest path queries in graphs arises in application areas such as intelligent transportation ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
The problem of processing shortest path queries in graphs arises in application areas such as intelligent transportation
Optimization and evaluation of shortest path queries
 VLDB J
"... We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortest path query efficiently, we introduce two pruning algorithms. These algorithms differ on the extent of materialization o ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortest path query efficiently, we introduce two pruning algorithms. These algorithms differ on the extent of materialization
Shortest Path Queries in Rectilinear Worlds
, 1991
"... In this paper, a data structure is given for two and higher dimensional shortest path queries. For a set of n ayAsparallel rectangles in the plane, or boxes in dspce, and a fixed target, it is possible with this structure to find a shortest rectilinear path avoiding all rectangles or boxes from ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
In this paper, a data structure is given for two and higher dimensional shortest path queries. For a set of n ayAsparallel rectangles in the plane, or boxes in dspce, and a fixed target, it is possible with this structure to find a shortest rectilinear path avoiding all rectangles or boxes
An ExternalMemory Data Structure for Shortest Path Queries
, 1999
"... In this paper, we present results related to satisfying shortest path queries on a planar graph stored in external memory. N denotes the total number of vertices and edges in the graph and sort(N) denotes the number of input/output (I/O) operations required to sort an array of length N . 1) We desc ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
In this paper, we present results related to satisfying shortest path queries on a planar graph stored in external memory. N denotes the total number of vertices and edges in the graph and sort(N) denotes the number of input/output (I/O) operations required to sort an array of length N . 1) We
Approximate Shortest Path Queries Using Voronoi Duals
, 2009
"... We propose an approximation method to answer pointtopoint shortest path queries in undirected edgeweighted graphs, based on random sampling and Voronoi duals. We compute a simplification of the graph by selecting nodes independently at random with probability p. Edges are generated as the Voronoi ..."
Abstract
 Add to MetaCart
We propose an approximation method to answer pointtopoint shortest path queries in undirected edgeweighted graphs, based on random sampling and Voronoi duals. We compute a simplification of the graph by selecting nodes independently at random with probability p. Edges are generated
Efficient Algorithms for Shortest Path Queries in Planar Digraphs
 In Proceedings of the 22nd International Workshop on GraphTheoretic Concepts in Computer Science
, 1996
"... . This paper describes algorithms for answering shortest path queries in digraphs with small separators and, in particular, in planar digraphs. In this version of the problem, one has to preprocess the input graph so that, given an arbitrary pair of query vertices v and w, the shortestpath distance ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
. This paper describes algorithms for answering shortest path queries in digraphs with small separators and, in particular, in planar digraphs. In this version of the problem, one has to preprocess the input graph so that, given an arbitrary pair of query vertices v and w, the shortestpath
An Optimal Iterative Algorithm for Shortest Path Query
"... In this paper, we present a new optimal hierarchical approach for shortest path finding. We propose iterative algorithms to find a shortest path and to expand this path into the lowest level. We prove the theoretical complexity of our algorithms, which is linear in both time and space. This is the f ..."
Abstract
 Add to MetaCart
. This is the first iterative (nonrecursive) approach which achieves the optimal lower bound for this problem. Furthermore, the algorithms in our hierarchical approach are simple and present a good potential for parallelization. We also introduce a new algorithm to perform intraregional shortest path queries
An external memory data structure for shortest path queries (Extended Abstract)
, 2003
"... We present results related to satisfying shortest path queries on a planar graph stored in external memory. In particular, we show how to store rooted trees in external memory so that bottomup paths can be traversed I/Oefficiently, and we present I/Oefficient algorithms for triangulating planar ..."
Abstract

Cited by 26 (8 self)
 Add to MetaCart
We present results related to satisfying shortest path queries on a planar graph stored in external memory. In particular, we show how to store rooted trees in external memory so that bottomup paths can be traversed I/Oefficiently, and we present I/Oefficient algorithms for triangulating
Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
"... We consider the classical geometric problem of determining shortest paths between pairs of points lying on a weighted polyhedral surface P consisting of n triangular faces. We present query algorithms that compute approximate distances and/or approximate (weighted) shortest paths. Our algorithm take ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
We consider the classical geometric problem of determining shortest paths between pairs of points lying on a weighted polyhedral surface P consisting of n triangular faces. We present query algorithms that compute approximate distances and/or approximate (weighted) shortest paths. Our algorithm
Results 1  10
of
385,129