27 search results - page 2 / 6 » Shortest Paths in Two Intersecting Pencils of Lines |
FLAIRS
2004
13 years 7 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...
GC
2006
Springer
13 years 6 months 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...
GD
2009
Springer
13 years 11 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...
ALGOSENSORS
2009
Springer
14 years 28 days 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...
STOC
2003
ACM
14 years 6 months 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...