Robustly Guarding Polygons
Fuente:
arXiv
Saved in:
| Main Authors: | Das, Rathish, Filtser, Omrit, Katz, Matthew J., Mitchell, Joseph S. B. |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Peeling Rotten Potatoes for a Faster Approximation of Convex Cover
by: Filtser, Omrit, et al.
Published: (2026)
by: Filtser, Omrit, et al.
Published: (2026)
On Fréchet Traveling Salesmen Problems
by: Filtser, Omrit, et al.
Published: (2026)
by: Filtser, Omrit, et al.
Published: (2026)
Unlabeled Multi-Robot Motion Planning with Improved Separation Trade-offs
by: Farhana, Tsuri, et al.
Published: (2026)
by: Farhana, Tsuri, et al.
Published: (2026)
Guarding Polyominoes Under $k$-Hop Visibility
by: Filtser, Omrit, et al.
Published: (2023)
by: Filtser, Omrit, et al.
Published: (2023)
Dispersive Vertex Guarding for Simple and Non-Simple Polygons
by: Fekete, Sándor P., et al.
Published: (2024)
by: Fekete, Sándor P., et al.
Published: (2024)
Multirobot Watchman Routes in a Simple Polygon
by: Mitchell, Joseph S. B., et al.
Published: (2024)
by: Mitchell, Joseph S. B., et al.
Published: (2024)
Contiguous Boundary Guarding
by: Biniaz, Ahmad, et al.
Published: (2024)
by: Biniaz, Ahmad, et al.
Published: (2024)
Scattering and Sparse Partitions, and their Applications
by: Filtser, Arnold
Published: (2020)
by: Filtser, Arnold
Published: (2020)
A face cover perspective to $\ell_1$ embeddings of planar graphs
by: Filtser, Arnold
Published: (2019)
by: Filtser, Arnold
Published: (2019)
On Strong Diameter Padded Decompositions
by: Filtser, Arnold
Published: (2019)
by: Filtser, Arnold
Published: (2019)
On Sparse Covers of Minor Free Graphs, Low Dimensional Metric Embeddings, and other applications
by: Filtser, Arnold
Published: (2024)
by: Filtser, Arnold
Published: (2024)
Optimizing Visibility-based Search in Polygonal Domains
by: Huynh, Kien C., et al.
Published: (2024)
by: Huynh, Kien C., et al.
Published: (2024)
Tiling with Three Polygons is Undecidable
by: Demaine, Erik D., et al.
Published: (2024)
by: Demaine, Erik D., et al.
Published: (2024)
Guarding Offices with Maximum Dispersion
by: Fekete, Sándor P., et al.
Published: (2025)
by: Fekete, Sándor P., et al.
Published: (2025)
Escaping a Polygon
by: Abel, Zachary, et al.
Published: (2020)
by: Abel, Zachary, et al.
Published: (2020)
Dynamic Light Spanners in Doubling Metrics
by: Bhore, Sujoy, et al.
Published: (2026)
by: Bhore, Sujoy, et al.
Published: (2026)
Guarding Terrains with Guards on a Line
by: Kang, Byeonguk, et al.
Published: (2025)
by: Kang, Byeonguk, et al.
Published: (2025)
Software for the Thompson and Funk Polygonal Geometry
by: Banerjee, Hridhaan, et al.
Published: (2025)
by: Banerjee, Hridhaan, et al.
Published: (2025)
Multiple Watchman Routes in Staircase Polygons
by: Brötzner, Anna, et al.
Published: (2025)
by: Brötzner, Anna, et al.
Published: (2025)
Witness Set in Monotone Polygons: Exact and Approximate
by: Das, Udvas, et al.
Published: (2025)
by: Das, Udvas, et al.
Published: (2025)
Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings
by: Bhore, Sujoy, et al.
Published: (2023)
by: Bhore, Sujoy, et al.
Published: (2023)
Recognizing Visibility Graphs of Polygons with Holes and Internal-External Visibility Graphs of Polygons
by: Boomari, Hossein, et al.
Published: (2018)
by: Boomari, Hossein, et al.
Published: (2018)
Ipelets for the Convex Polygonal Geometry
by: Parepally, Nithin, et al.
Published: (2024)
by: Parepally, Nithin, et al.
Published: (2024)
Compatible Triangulations of Simple Polygons
by: Afshani, Peyman, et al.
Published: (2026)
by: Afshani, Peyman, et al.
Published: (2026)
Online Packing of Orthogonal Polygons
by: Gerlach, Tim, et al.
Published: (2026)
by: Gerlach, Tim, et al.
Published: (2026)
Partitioning Regular Polygons into Circular Pieces I: Convex Partitions
by: Damian, Mirela, et al.
Published: (2003)
by: Damian, Mirela, et al.
Published: (2003)
On Approximation Schemes for Stabbing Rectilinear Polygons
by: Khan, Arindam, et al.
Published: (2024)
by: Khan, Arindam, et al.
Published: (2024)
Covering Simple Orthogonal Polygons with Rectangles
by: Roy, Aniket Basu
Published: (2024)
by: Roy, Aniket Basu
Published: (2024)
Shadoks Approach to Knapsack Polygonal Packing
by: da Fonseca, Guilherme D., et al.
Published: (2024)
by: da Fonseca, Guilherme D., et al.
Published: (2024)
Realizing Planar Linkages in Polygonal Domains
by: Depian, Thomas, et al.
Published: (2026)
by: Depian, Thomas, et al.
Published: (2026)
Bicriteria Polygon Aggregation with Arbitrary Shapes
by: Blank, Lotte, et al.
Published: (2025)
by: Blank, Lotte, et al.
Published: (2025)
Partitioning a Polygon Into Small Pieces
by: Abrahamsen, Mikkel, et al.
Published: (2022)
by: Abrahamsen, Mikkel, et al.
Published: (2022)
On the Reduction of the Spherical Point-in-Polygon Problem for Antipode-Excluding Spherical Polygons
by: Li, Ziqiang, et al.
Published: (2023)
by: Li, Ziqiang, et al.
Published: (2023)
French Onion Soup, Ipelets for Points and Polygons
by: Faber, Klint, et al.
Published: (2025)
by: Faber, Klint, et al.
Published: (2025)
Approximation Algorithms for Anchored Multiwatchman Routes
by: Mitchell, Joseph S. B., et al.
Published: (2024)
by: Mitchell, Joseph S. B., et al.
Published: (2024)
Dynamic Nearest-Neighbor Searching Under General Metrics in ${\mathbb R}^3$ and Its Applications
by: Agarwal, Pankaj K., et al.
Published: (2026)
by: Agarwal, Pankaj K., et al.
Published: (2026)
M-Guarding in K-Visibility
by: Bahoo, Yeganeh, et al.
Published: (2025)
by: Bahoo, Yeganeh, et al.
Published: (2025)
Approximation Algorithms for the Freeze Tag Problem inside Polygons
by: Rajabi-Alni, Fatemeh, et al.
Published: (2024)
by: Rajabi-Alni, Fatemeh, et al.
Published: (2024)
Bounding a Polygon by a Minimum Number of Vertices
by: Abrahamsen, Mikkel, et al.
Published: (2025)
by: Abrahamsen, Mikkel, et al.
Published: (2025)
Generalized k-Cell Decomposition for Visibility Planning in Polygons
by: Bahoo, Yeganeh, et al.
Published: (2025)
by: Bahoo, Yeganeh, et al.
Published: (2025)
Similar Items
-
Peeling Rotten Potatoes for a Faster Approximation of Convex Cover
by: Filtser, Omrit, et al.
Published: (2026) -
On Fréchet Traveling Salesmen Problems
by: Filtser, Omrit, et al.
Published: (2026) -
Unlabeled Multi-Robot Motion Planning with Improved Separation Trade-offs
by: Farhana, Tsuri, et al.
Published: (2026) -
Guarding Polyominoes Under $k$-Hop Visibility
by: Filtser, Omrit, et al.
Published: (2023) -
Dispersive Vertex Guarding for Simple and Non-Simple Polygons
by: Fekete, Sándor P., et al.
Published: (2024)