79 search results - page 8 / 16 » Shortest path in a polygon using sublinear space |
133
click to vote
PODC
2006
ACM
15 years 10 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
147
click to vote
ISVC
2009
Springer
15 years 10 months ago
2009
Springer
Throughout history, the primary means of transportation for humans has been on foot. We present a software tool which can help visualize and predict where historical trails might l...
148
click to vote
ICDCS
1999
IEEE
15 years 8 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
130
Voted
WADS
2005
Springer
15 years 9 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
156
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
In this paper we show that complex (scale-free) network topologies naturally emerge from hyperbolic metric spaces. The hyperbolic geometry can be used to facilitate maximally efï¬...