Sciweavers

40 search results - page 4 / 8
» Faster shortest-path algorithms for planar graphs
Sort
View
COSIT
2003
Springer
132views GIS» more  COSIT 2003»
14 years 1 months ago
"Simplest" Paths: Automated Route Selection for Navigation
Numerous cognitive studies have indicated that the form and complexity of route instructions may be as important to human navigators as the overall length of route. Most automated ...
Matt Duckham, Lars Kulik
SIAMCOMP
1998
124views more  SIAMCOMP 1998»
13 years 8 months ago
Near-Linear Time Construction of Sparse Neighborhood Covers
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
Baruch Awerbuch, Bonnie Berger, Lenore Cowen, Davi...
SIAMCOMP
2000
125views more  SIAMCOMP 2000»
13 years 8 months ago
Approximating the Stretch Factor of Euclidean Graphs
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
Giri Narasimhan, Michiel H. M. Smid
ISAAC
1999
Springer
110views Algorithms» more  ISAAC 1999»
14 years 25 days ago
Online Routing in Triangulations
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorit...
Prosenjit Bose, Pat Morin
ISAAC
2003
Springer
96views Algorithms» more  ISAAC 2003»
14 years 1 months ago
On the Geometric Dilation of Finite Point Sets
Let G be an embedded planar graph whose edges may be curves. For two arbitrary points of G, we can compare the length of the shortest path in G connecting them against their Euclid...
Annette Ebbers-Baumann, Ansgar Grüne, Rolf Kl...