17 search results - page 1 / 4 » Euclidean TSP on two polygons |
TCS
2010
13 years 5 months ago
2010
We give an O(n2 m + nm2 + m2 log m) time and O(n2 + m2 ) space algorithm for finding the shortest traveling salesman tour through the vertices of two simple polygonal obstacles i...
CCCG
2010
13 years 9 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...
IOR
2008
13 years 7 months ago
2008
A facility has to be located within a given region taking two criteria of equity and efficiency into account. Equity is sought by minimizing the inequality in the inhabitant-facil...
FOCS
1997
IEEE
13 years 11 months ago
1997
IEEE
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. A mobile robot, represented by a point moving along a polygonal line in the plane, has to explore an unknown polygon and return to the starting point. The robot has a sen...