27 search results - page 2 / 6 » Shortest Paths in Two Intersecting Pencils of Lines |
95
Voted
FLAIRS
2004
15 years 2 months ago
2004
Within the geographic domain, an important class of relies on geometric abstractions in the form of lines where, for instance, transportation networks and trajectories of movement...
98
Voted
GC
2006
Springer
15 years 17 days ago
2006
Springer
It is shown that for a set S of n pairwise disjoint axis-parallel line segments in the plane there is a simple alternating path of length ( n). This bound is best possible in the...
100
Voted
GD
2009
Springer
15 years 5 months ago
2009
Springer
To produce high quality drawings of graphs with nodes drawn as shapes it is important to find routes for the edges which do not intersect node boundaries. Recent work in this area...
107
Voted
ALGOSENSORS
2009
Springer
15 years 7 months ago
2009
Springer
Barrier coverage in a sensor network has the goal of ensuring that all paths through the surveillance domain joining points in some start region S to some target region T will inte...
105
Voted
STOC
2003
ACM
16 years 26 days ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...