How to Keep an Eye on Small Things
From MaRDI portal
Publication:5012868
DOI10.1142/S0218195920500053OpenAlexW3132887354MaRDI QIDQ5012868
Paweł Żyliński, Bengt J. Nilsson
Publication date: 26 November 2021
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195920500053
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Watchman tours for polygons with holes
- Approximation algorithms for art gallery problems in polygons
- 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
- A short proof of Chvatal's Watchman Theorem
- A combinatorial theorem in plane geometry
- Fast computation of shortest watchman routes in simple polygons
- Finding the shortest watchman route in a simple polygon
- Fast vertex guarding for polygons with and without holes
- Shortest paths in simple polygons with polygon-meet constraints
- Query-point visibility constrained shortest paths in simple polygons
- Shortest path to a segment and quickest visibility queries
- Fast Algorithms for Finding Nearest Common Ancestors
- Touring a sequence of polygons
- A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems
- Computational complexity of art gallery problems
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Analytical approach to parallel repetition
- A Theorem on Boolean Matrices
- Approximating Watchman Routes
- Inapproximability results for guarding polygons and terrains
This page was built for publication: How to Keep an Eye on Small Things
