arXiv (All)
open access
Witness Set in Weak Visibility Polygons is Polynomial-Time Solvable
In the classical Art Gallery Problem (AGP), guards are placed in a polygon so that together they see every point. The Witness Set Problem (WSP), introduced by Amit, Mitchell, and Packer, is a natural dual to the AGP. In this paper, we study the WSP in weak visibility polygons (WVPs), the simple poly
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Divide and Conquer: A Distributed Approach to Five Point Energy Minimization#1118354
- Locally Sparsified, Globally Near-Optimal: Matching under Independent Vertex Arrivals#1063372
- Indiscernible Properties, Discernible Artworks#115827
- Ordered matchings versus triangles via pseudorandom triangle-free graphs#1014222
- Confirmation of the Daykin-Frankl Conjecture#925452
Record · ID 1061797
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive