Touring a sequence of polygons
From MaRDI portal
Recommendations
- Touring a sequence of disjoint polygons: complexity and extension
- Touring convex polygons in polygonal domain fences
- Touring polygons: an approximation algorithm
- Efficient algorithms for touring a sequence of convex polygons and related problems
- The polygon exploration problem
- Loops of polygons
- Watchman tours for polygons with holes
- scientific article; zbMATH DE number 2068122
- A Panoply of Polygons
- Areas of polygons with coordinates of vertices from various sequences
Cited in
(52)- Finding shortest safari routes in simple polygons
- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
- An improved algorithm for computing a shortest watchman route for lines
- Touring convex polygons in polygonal domain fences
- Polynomial-time algorithms for the touring rays and related problems
- Minimum cost b-matching problems with neighborhoods
- Shortest paths and convex hulls in 2D complexes with non-positive curvature
- On Romeo and Juliet problems: minimizing distance-to-sight
- A linear-time 2-approximation algorithm for the watchman route problem for simple polygons
- Shortest paths in simple polygons with polygon-meet constraints
- Watchman routes for lines and line segments
- Query-point visibility constrained shortest paths in simple polygons
- The touring rays and related problems
- Online search for a hyperplane in high-dimensional Euclidean space
- Improved exploration of unknown polygons
- Touring disjoint polygons problem is NP-hard
- Touring polygons: an approximation algorithm
- Efficient algorithms for touring a sequence of convex polygons and related problems
- Touring a sequence of disjoint polygons: complexity and extension
- Existence and computation of tours through imprecise points
- Inspecting a Set of Strips Optimally
- Gender-aware facility location in multi-gender world
- An improved on-line strategy for exploring unknown polygons
- Visiting a Polygon on the Optimal Way to a Query Point
- scientific article; zbMATH DE number 4066651 (Why is no real title available?)
- scientific article; zbMATH DE number 140088 (Why is no real title available?)
- Watchman tours for polygons with holes
- scientific article; zbMATH DE number 1555972 (Why is no real title available?)
- Complexity of minimum corridor guarding problems
- How to Keep an Eye on Small Things
- On Romeo and Juliet problems: minimizing distance-to-sight
- scientific article; zbMATH DE number 7151640 (Why is no real title available?)
- Solving the Watchman Route Problem with Heuristic Search
- Computational Science and Its Applications – ICCSA 2004
- Facility location problems on graphs with non-convex neighborhoods
- Minimum-link C-oriented paths visiting a sequence of regions in the plane
- \(k\)-Transmitter watchman routes
- Largest convex hulls for constant size, convex-hull disjoint clusters
- A novel algorithm for construction of the shortest path between a finite set of nonintersecting contours on the plane
- Observation routes and external watchman routes
- Shortest Paths in Graphs of Convex Sets
- Approximation algorithms for the two-watchman route in a simple polygon
- New approximation algorithms for touring regions
- Observation routes and external watchman routes
- m-watchmen's routes in minbar and generalized minbar polygons
- Optimizing visibility-based search in polygonal domains
- Approximation algorithms for anchored multiwatchman routes
- Computing smallest convex intersecting polygons
- Largest convex hulls for convex-hull disjoint clusters with bounded size
- Sweeping a domain with line-of-sight between covisible agents
- A PTAS for TSP with neighbourhoods over parallel line segments
- Largest and smallest convex hulls for imprecise points
This page was built for publication: Touring a sequence of polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581275)
