Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

TCS
2010

favoriteEmaildiscussreport

123views Theoretical Computer Science» more TCS 2010»

Euclidean TSP on two polygons

13 years 2 months ago

Euclidean TSP on two polygons

Download www.cs.drexel.edu

We give an O(n2 m + nm2 + m2 log m) time and O(n2 + m2 ) space algorithm for ﬁnding the shortest traveling salesman tour through the vertices of two simple polygonal obstacles in the Euclidean plane, where n and m are the number of vertices of the two polygons.

Jeff Abrahamson, Ali Shokoufandeh

Real-time Traffic

Euclidean Plane | Simple Polygonal Obstacles | Space Algorithm | TCS 2010 | Theoretical Computer Science |

claim paper

Related Content

» The traveling salesman problem for lines and rays in the plane

» EquityEfficiency Bicriteria Location with Squared Euclidean Distances

» The Computational Complexity of Knot and Link Problems

» Optimality and Competitiveness of Exploring Polygons by Mobile Robots

» Neurodynamic programming a case study of the traveling salesman problem

» Short and Smooth Polygonal Paths

» Approximate ESPs on Surfaces of Polytopes Using a Rubberband Algorithm

» Subdividing Alpha Complex

» Complex tilings

Post Info
More Details (n/a)

Added	30 Jan 2011
Updated	30 Jan 2011
Type	Journal
Year	2010
Where	TCS
Authors	Jeff Abrahamson, Ali Shokoufandeh

Comments (0)