Sciweavers

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

8

STOC
2003
ACM

favoriteEmaildiscussreport

78views Algorithms» more STOC 2003»

Touring a sequence of polygons

14 years 5 months ago

Touring a sequence of polygons

Download dimacs.rutgers.edu

Moshe Dror, Alon Efrat, Anna Lubiw, Joseph S. B. M

Real-time Traffic

Algorithms | STOC 2003 |

claim paper

Related Content

» Watchman tours for polygons with holes

» Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons

» Euclidean TSP on two polygons

» Convexifying Monotone Polygons

» Exploring Simple Grid Polygons

» Deflating polygons to the limit

» Exploring Simple Triangular and Hexagonal Grid Polygons Online

» Churchs Problem and a Tour through Automata Theory

» Building Shape Models from Image Sequences using Piecewise Linear Approximation

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2003
Where	STOC
Authors	Moshe Dror, Alon Efrat, Anna Lubiw, Joseph S. B. Mitchell

Comments (0)