35 search results - page 1 / 7 » On shortest paths in line arrangements |
CCCG
2003
15 years 1 months ago
2003
Suppose one has a line arrangement and one wants to find a shortest path from one point lying on a line of the arrangement to another such point. We look at a special case: the a...
CCCG
2003
15 years 1 months ago
2003
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 conjectu...
COMPGEOM
2003
ACM
15 years 4 months ago
2003
ACM
We show how to construct an arrangement of n lines having a monotone path of length Ω(n2−(d/ √ log n)), where d > 0 is some constant, and thus nearly settle the long stan...
CCCG
2004
15 years 1 months ago
2004
102
click to vote
CCCG
2010
15 years 1 months ago
2010
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we...