On shortest paths in line arrangements

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.

• Type: Conference
• Year: 2003
• Where: CCCG
• Authors: Telikepalli Kavitha, Kasturi R. Varadarajan
• Keywords: CCCG 2003, CCCG 2007, Grid-like Arrangement, Shortest Paths, Simple Structure