Sciweavers

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

10

CCCG
2006

favoriteEmaildiscussreport

136views Computational Geometry» more CCCG 2006»

On Computing Shortest External Watchman Routes for Convex Polygons

13 years 6 months ago

On Computing Shortest External Watchman Routes for Convex Polygons

Download research.cs.queensu.ca

We study the relationship between the interior angles of a convex polygon and the lengths of external watchman routes.

Rafa Absar, Sue Whitesides

Real-time Traffic

CCCG 2006 | CCCG 2007 | Convex Polygon | External Watchman Routes |

claim paper

Related Content

» A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2006
Where	CCCG
Authors	Rafa Absar, Sue Whitesides

Comments (0)