Sciweavers

2 search results - page 1 / 1

» On Computing Shortest External Watchman Routes for Convex Po...

10

CCCG
2006

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

claim paper

Read More »

15

ICCSA
2004
Springer

106views Applied Computing» more ICCSA 2004»

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

13 years 10 months ago

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

Download www.sm.luth.se

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

claim paper

Read More »

« Prev « First page 1 / 1 Last » Next »