21 search results - page 4 / 5 » The Euclidean Orienteering Problem Revisited |
CATS
2007
13 years 7 months ago
2007
For two points p and q in the plane, a straight line h, called a highway, and a real v > 1, we define the travel time (also known as the city distance) from p and q to be the ...
GLVLSI
2003
IEEE
13 years 11 months ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
COMPGEOM
2010
ACM
13 years 11 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
ACIVS
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. This paper addresses the problem of self-calibration and motion recovery for turntable sequences. Previous works exploited silhouette correspondences induced by epipolar ...
FOCS
1993
IEEE
13 years 10 months ago
1993
IEEE
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...