27 search results - page 1 / 6 » Shortest Paths in Two Intersecting Pencils of Lines |
76
Voted
CCCG
2003
14 years 11 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
14 years 11 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...
CCCG
2010
14 years 11 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...
EJC
2007
14 years 9 months ago
2007
We prove that the translation plane and the shift plane defined by a planar partition function form an oval pair of projective planes in the sense that the planes share a line pe...
119
click to vote
ICCI
1991
15 years 1 months ago
1991
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...