Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CCCG
2003

favoriteEmaildiscussreport

117views Computational Geometry» more CCCG 2003»

On shortest paths in line arrangements

13 years 6 months ago

On shortest paths in line arrangements

Download web.cs.dal.ca

In this paper, we show that the shortest path between two points in a grid-like arrangement of two pencils of lines has a particularly simple structure, as was previously conjectured. This gives a linear-time algorithm for computing shortest paths in such arrangements.

Telikepalli Kavitha, Kasturi R. Varadarajan

Real-time Traffic

CCCG 2003 | CCCG 2007 | Grid-like Arrangement | Shortest Paths | Simple Structure |

claim paper

Related Content

» Shortest Paths in Two Intersecting Pencils of Lines

» Long monotone paths in line arrangements

» On some monotone path problems in line arrangements

» The traveling salesman problem for lines and rays in the plane

» A Border LineBased Pruning Scheme for Shortest Path Computations

» Paradox of Shortest Path Routing for Large MultiHop Wireless Networks

» Trinocular Stereo Using Shortest Paths and the Ordering Constraint

» Accelerating Large Graph Algorithms on the GPU Using CUDA

» Locating Sensors in Concave Areas

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2003
Where	CCCG
Authors	Telikepalli Kavitha, Kasturi R. Varadarajan

Comments (0)