Cover Image

Multirobot Watchman Routes in a Simple Polygon

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mitchell, Joseph S. B., Nguyen, Linh
Format:	Preprint
Published:	2024
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Multiple Watchman Routes in Staircase Polygons
by: Brötzner, Anna, et al.
Published: (2025)

Approximation Algorithms for Anchored Multiwatchman Routes
by: Mitchell, Joseph S. B., et al.
Published: (2024)

Observation Routes and External Watchman Routes
by: Dumitrescu, Adrian, et al.
Published: (2023)

Optimizing Visibility-based Search in Polygonal Domains
by: Huynh, Kien C., et al.
Published: (2024)

Dispersive Vertex Guarding for Simple and Non-Simple Polygons
by: Fekete, Sándor P., et al.
Published: (2024)

Robustly Guarding Polygons
by: Das, Rathish, et al.
Published: (2024)

Compatible Triangulations of Simple Polygons
by: Afshani, Peyman, et al.
Published: (2026)

Covering Simple Orthogonal Polygons with Rectangles
by: Roy, Aniket Basu
Published: (2024)

Nearest Neighbor Searching in a Dynamic Simple Polygon
by: de Berg, Sarita, et al.
Published: (2025)

Visibility Queries in Simple Polygons
by: Bhore, Sujoy, et al.
Published: (2026)

Minimum Star Partitions of Simple Polygons in Polynomial Time
by: Abrahamsen, Mikkel, et al.
Published: (2023)

Approximating the Smallest $k$-Enclosing Geodesic Disc in a Simple Polygon
by: Bose, Prosenjit, et al.
Published: (2024)

A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon
by: de Berg, Mark, et al.
Published: (2024)

Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares
by: Abrahamsen, Mikkel, et al.
Published: (2024)

Provable Methods for Searching with an Imperfect Sensor
by: Chakraborty, Nilanjan, et al.
Published: (2024)

Simple Grid Polygon Online Exploration Revisited
by: Brock, Maximilian, et al.
Published: (2024)

Escaping a Polygon
by: Abel, Zachary, et al.
Published: (2020)

Tiling with Three Polygons is Undecidable
by: Demaine, Erik D., et al.
Published: (2024)

The Geodesic Fréchet Distance Between Two Curves Bounding a Simple Polygon
by: van der Horst, Thijs, et al.
Published: (2025)

Software for the Thompson and Funk Polygonal Geometry
by: Banerjee, Hridhaan, et al.
Published: (2025)

Coordinated Motion Planning is FPT on Discretized Simple Polygons
by: Deligkas, Argyrios, et al.
Published: (2026)

Partitioning a Polygon Into Small Pieces
by: Abrahamsen, Mikkel, et al.
Published: (2022)

Recognizing Visibility Graphs of Polygons with Holes and Internal-External Visibility Graphs of Polygons
by: Boomari, Hossein, et al.
Published: (2018)

Ipelets for the Convex Polygonal Geometry
by: Parepally, Nithin, et al.
Published: (2024)

Online Packing of Orthogonal Polygons
by: Gerlach, Tim, et al.
Published: (2026)

Partitioning Regular Polygons into Circular Pieces I: Convex Partitions
by: Damian, Mirela, et al.
Published: (2003)

Bounding a Polygon by a Minimum Number of Vertices
by: Abrahamsen, Mikkel, et al.
Published: (2025)

On Approximation Schemes for Stabbing Rectilinear Polygons
by: Khan, Arindam, et al.
Published: (2024)

Shadoks Approach to Knapsack Polygonal Packing
by: da Fonseca, Guilherme D., et al.
Published: (2024)

Realizing Planar Linkages in Polygonal Domains
by: Depian, Thomas, et al.
Published: (2026)

Bicriteria Polygon Aggregation with Arbitrary Shapes
by: Blank, Lotte, et al.
Published: (2025)

Triangulating a Polygon with Holes in Optimal (Deterministic) Time
by: Chan, Timothy M.
Published: (2026)

On the Reduction of the Spherical Point-in-Polygon Problem for Antipode-Excluding Spherical Polygons
by: Li, Ziqiang, et al.
Published: (2023)

French Onion Soup, Ipelets for Points and Polygons
by: Faber, Klint, et al.
Published: (2025)

Approximate Dynamic Nearest Neighbor Searching in a Polygonal Domain
by: van der Laan, Joost, et al.
Published: (2026)

Approximation Algorithms for the Freeze Tag Problem inside Polygons
by: Rajabi-Alni, Fatemeh, et al.
Published: (2024)

Generalized k-Cell Decomposition for Visibility Planning in Polygons
by: Bahoo, Yeganeh, et al.
Published: (2025)

Minimum Partition of Polygons under Width and Cut Constraints
by: Chung, Jaehoon, et al.
Published: (2025)

Touring a Sequence of Orthogonal Polygons
by: Casel, Katrin, et al.
Published: (2026)

Near-Optimal Min-Sum Motion Planning in a Planar Polygonal Environment
by: Agarwal, Pankaj K., et al.
Published: (2025)