Imagen de Portada

Multirobot Watchman Routes in a Simple Polygon

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Mitchell, Joseph S. B., Nguyen, Linh
Formato:	Preprint
Publicado:	2024
Materias:	Computational Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

Observation Routes and External Watchman Routes
por: Dumitrescu, Adrian, et al.
Publicado: (2023)

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

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

Robustly Guarding Polygons
por: Das, Rathish, et al.
Publicado: (2024)

Compatible Triangulations of Simple Polygons
por: Afshani, Peyman, et al.
Publicado: (2026)

Covering Simple Orthogonal Polygons with Rectangles
por: Roy, Aniket Basu
Publicado: (2024)

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

Visibility Queries in Simple Polygons
por: Bhore, Sujoy, et al.
Publicado: (2026)

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

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

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

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

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

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

Escaping a Polygon
por: Abel, Zachary, et al.
Publicado: (2020)

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

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

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

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

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

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

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

Online Packing of Orthogonal Polygons
por: Gerlach, Tim, et al.
Publicado: (2026)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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