Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems
From MaRDI portal
Publication:2988854
DOI10.1007/978-3-319-55911-7_44zbMath1485.68272OpenAlexW2601639295MaRDI QIDQ2988854
Publication date: 19 May 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-55911-7_44
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
The touring rays and related problems ⋮ Improved exploration of unknown polygons ⋮ An improved algorithm for computing a shortest watchman route for lines ⋮ Polynomial-time algorithms for the touring rays and related problems
Cites Work
- Unnamed Item
- Touring a sequence of disjoint polygons: complexity and extension
- Visibility and intersection problems in plane geometry
- Finding shortest safari routes in simple polygons
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Optimum watchman routes
- Watchman routes under limited visibility
- Fast computation of shortest watchman routes in simple polygons
- An O\((n\log n)\) algorithm for the zoo-keeper's problem
- An Improved On-line Strategy for Exploring Unknown Polygons
- Touring a sequence of polygons
- AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES
- An optimal algorithm for intersecting line segments in the plane
- CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"
