Results 1  10
of
240,667
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
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
Planar spanners and approximate shortest path queries among obstacles
 in the plane, Proc. 4th European Sympos. Algorithms
, 1996
"... Abstract. We consider the problem of finding an obstacleavoiding path between two points s and t in the plane, amidst a set of disjoint polygonal obstacles with a total of n vertices. The length of this path should be within a small constant factor c of the length of the shortest possible obstacle ..."
Abstract

Cited by 49 (15 self)
 Add to MetaCart
avoiding st path measured in the Lvmetric. Such an approximate shortest path is called a cshort path, or a short path with stretch]actor c. The goal is to preprocess the obstaclescattered plane by creating an efficient data structure that enables fast reporting of a cshort path (or its length
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
, 2008
"... We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive weights assigned to them. The cost of a path in P is defined to be the weighted sum of Euclidean lengths of the subpaths w ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
within each face of P. We present query algorithms that compute approximate distances and/or approximate shortest paths on P. Our allpairs query algorithms take as input an approximation parameter ε ∈ (0,1) and a query time parameter q, in a certain range, and builds a data structure APQ(P,ε;q), which
Approximate Shortest Path Queries in Graphs Using Voronoi Duals
"... We propose an approximation method to answer pointtopoint shortest path queries in undirected 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 dual of the o ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We propose an approximation method to answer pointtopoint shortest path queries in undirected 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 dual
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 401 (2 self)
 Add to MetaCart
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest
Querying Approximate Shortest Paths in Anisotropic Regions
, 2007
"... We present a data structure for answering approximate shortest path queries in a planar subdivision from a fixed source. Let ρ � 1 be a real number. Distances in each face of this subdivision are measured by a possibly asymmetric convex distance function whose unit disk is contained in a concentric ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We present a data structure for answering approximate shortest path queries in a planar subdivision from a fixed source. Let ρ � 1 be a real number. Distances in each face of this subdivision are measured by a possibly asymmetric convex distance function whose unit disk is contained in a concentric
Probabilistic Roadmaps for Path Planning in HighDimensional Configuration Spaces
 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION
, 1996
"... A new motion planning method for robots in static workspaces is presented. This method proceeds in two phases: a learning phase and a query phase. In the learning phase, a probabilistic roadmap is constructed and stored as a graph whose nodes correspond to collisionfree configurations and whose edg ..."
Abstract

Cited by 1276 (124 self)
 Add to MetaCart
edges correspond to feasible paths between these configurations. These paths are computed using a simple and fast local planner. In the query phase, any given start and goal configurations of the robot are connected to two nodes of the roadmap; the roadmap is then searched for a path joining these two
A Guided Tour to Approximate String Matching
 ACM COMPUTING SURVEYS
, 1999
"... We survey the current techniques to cope with the problem of string matching allowing errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining t ..."
Abstract

Cited by 584 (38 self)
 Add to MetaCart
We survey the current techniques to cope with the problem of string matching allowing errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining the problem and its relevance, its statistical behavior, its history and current developments, and the central ideas of the algorithms and their complexities. We present a number of experiments to compare the performance of the different algorithms and show which are the best choices according to each case. We conclude with some future work directions and open problems.
Tinydb: An acquisitional query processing system for sensor networks
 ACM Trans. Database Syst
, 2005
"... We discuss the design of an acquisitional query processor for data collection in sensor networks. Acquisitional issues are those that pertain to where, when, and how often data is physically acquired (sampled) and delivered to query processing operators. By focusing on the locations and costs of acq ..."
Abstract

Cited by 609 (8 self)
 Add to MetaCart
We discuss the design of an acquisitional query processor for data collection in sensor networks. Acquisitional issues are those that pertain to where, when, and how often data is physically acquired (sampled) and delivered to query processing operators. By focusing on the locations and costs
Results 1  10
of
240,667