Sciweavers

2 search results - page 1 / 1
» On Computing Shortest External Watchman Routes for Convex Po...
Sort
View
CCCG
2006
14 years 11 months ago
On Computing Shortest External Watchman Routes for Convex Polygons
We study the relationship between the interior angles of a convex polygon and the lengths of external watchman routes.
Rafa Absar, Sue Whitesides
71
Voted
ICCSA
2004
Springer
15 years 2 months ago
A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
Håkan Jonsson