Sciweavers

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

9

CCCG
2010

favoriteEmaildiscussreport

180views Computational Geometry» more CCCG 2010»

Watchman route in a simple polygon with a rubberband algorithm

13 years 6 months ago

Watchman route in a simple polygon with a rubberband algorithm

Download www.cs.umanitoba.ca

So far, the best result in running time for solving the fixed watchman route problem (i.e., shortest path for viewing any point in a simple polygon with given start point) is O(n3 log n), published in 2003 by M. Dror, A. Efrat, A. Lubiw, and J. Mitchell.

Fajie Li, Reinhard Klette

Real-time Traffic

CCCG 2010 | Computational Geometry | Shortest Path | Simple Polygon | Watchman Route Problem |

claim paper

Related Content

» Finding the Shortest Watchman Route in a Simple Polygon

» MinimumLength Polygons of FirstClass Simple CubeCurves

» Generalized Watchman Route Problem with Discrete View Cost

» MinimumLength Polygon of a Simple CubeCurve in 3D Space

» Analysis of the rubberband algorithm

» The Class of Simple CubeCurves Whose MLPs Cannot Have Vertices at Grid Points

» Voronoi Toolpaths for PCB Mechanical Etch Simple and Intuitive Algorithms with the 3D GPU

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

» Competitive Online Routing in Geometric Graphs

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2010
Where	CCCG
Authors	Fajie Li, Reinhard Klette

Comments (0)