Approximation algorithms for the two-watchman route in a simple polygon
From MaRDI portal
Publication:6614109
Cites work
- scientific article; zbMATH DE number 1049272 (Why is no real title available?)
- scientific article; zbMATH DE number 7421176 (Why is no real title available?)
- scientific article; zbMATH DE number 3081645 (Why is no real title available?)
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- A linear algorithm for computing the visibility polygon from a point
- A linear-time 2-approximation algorithm for the watchman route problem for simple polygons
- AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES
- An Optimal Algorithm for Finding the Kernel of a Polygon
- Approximating a shortest watchman route
- Approximating watchman routes
- Archimedes' Axioms for Arc-Length and Area
- CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"
- Computing the geodesic center of a simple polygon
- Concerning the time bounds of existing shortest watchman route algorithms
- Corrections to Lee's visibility polygon algorithm
- Efficient algorithms for touring a sequence of convex polygons and related problems
- Euclidean shortest paths in the presence of rectilinear barriers
- Fast Algorithms for Finding Nearest Common Ancestors
- Fast computation of shortest watchman routes in simple polygons
- Finding the shortest watchman route in a simple polygon
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Optimum watchman routes
- Shortest path to a segment and quickest visibility queries
- Shortest watchman routes in simple polygons
- Touring a sequence of polygons
- Visibility of a simple polygon
- Watchman tours for polygons with holes
This page was built for publication: Approximation algorithms for the two-watchman route in a simple polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614109)
