A Practical Algorithm with Performance Guarantees for the Art Gallery Problem
Given a closed simple polygon \(P\), we say two points \(p,q\) see each other if the segment \(pq\) is fully contained in \(P\). The art gallery problem seeks a minimum size set \(G\subset P\) of guards that sees \(P\) completely. The only currently correct algorithm to solve the art gallery problem...
Gespeichert in:
| Veröffentlicht in: | arXiv.org |
|---|---|
| Hauptverfasser: | , |
| Format: | Paper |
| Sprache: | Englisch |
| Veröffentlicht: |
Ithaca
Cornell University Library, arXiv.org
11.06.2024
|
| Schlagworte: | |
| ISSN: | 2331-8422 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Given a closed simple polygon \(P\), we say two points \(p,q\) see each other if the segment \(pq\) is fully contained in \(P\). The art gallery problem seeks a minimum size set \(G\subset P\) of guards that sees \(P\) completely. The only currently correct algorithm to solve the art gallery problem exactly uses algebraic methods and is attributed to Sharir. As the art gallery problem is ER-complete, it seems unlikely to avoid algebraic methods, without additional assumptions. In this paper, we introduce the notion of vision stability. In order to describe vision stability consider an enhanced guard that can see "around the corner" by an angle of \(\delta\) or a diminished guard whose vision is by an angle of \(\delta\) "blocked" by reflex vertices. A polygon \(P\) has vision stability \(\delta\) if the optimal number of enhanced guards to guard \(P\) is the same as the optimal number of diminished guards to guard \(P\). We will argue that most relevant polygons are vision stable. We describe a one-shot vision stable algorithm that computes an optimal guard set for visionstable polygons using polynomial time and solving one integer program. It guarantees to find the optimal solution for every vision stable polygon. We implemented an iterative visionstable algorithm and show its practical performance is slower, but comparable with other state of the art algorithms. Our iterative algorithm is inspired and follows closely the one-shot algorithm. It delays several steps and only computes them when deemed necessary. Given a chord \(c\) of a polygon, we denote by \(n(c)\) the number of vertices visible from \(c\). The chord-width of a polygon is the maximum \(n(c)\) over all possible chords \(c\). The set of vision stable polygons admits an FPT algorithm when parametrized by the chord-width. Furthermore, the one-shot algorithm runs in FPT time, when parameterized by the number of reflex vertices. |
|---|---|
| AbstractList | Given a closed simple polygon \(P\), we say two points \(p,q\) see each other if the segment \(pq\) is fully contained in \(P\). The art gallery problem seeks a minimum size set \(G\subset P\) of guards that sees \(P\) completely. The only currently correct algorithm to solve the art gallery problem exactly uses algebraic methods and is attributed to Sharir. As the art gallery problem is ER-complete, it seems unlikely to avoid algebraic methods, without additional assumptions. In this paper, we introduce the notion of vision stability. In order to describe vision stability consider an enhanced guard that can see "around the corner" by an angle of \(\delta\) or a diminished guard whose vision is by an angle of \(\delta\) "blocked" by reflex vertices. A polygon \(P\) has vision stability \(\delta\) if the optimal number of enhanced guards to guard \(P\) is the same as the optimal number of diminished guards to guard \(P\). We will argue that most relevant polygons are vision stable. We describe a one-shot vision stable algorithm that computes an optimal guard set for visionstable polygons using polynomial time and solving one integer program. It guarantees to find the optimal solution for every vision stable polygon. We implemented an iterative visionstable algorithm and show its practical performance is slower, but comparable with other state of the art algorithms. Our iterative algorithm is inspired and follows closely the one-shot algorithm. It delays several steps and only computes them when deemed necessary. Given a chord \(c\) of a polygon, we denote by \(n(c)\) the number of vertices visible from \(c\). The chord-width of a polygon is the maximum \(n(c)\) over all possible chords \(c\). The set of vision stable polygons admits an FPT algorithm when parametrized by the chord-width. Furthermore, the one-shot algorithm runs in FPT time, when parameterized by the number of reflex vertices. |
| Author | Tillmann Miltzow Hengeveld, Simon |
| Author_xml | – sequence: 1 givenname: Simon surname: Hengeveld fullname: Hengeveld, Simon – sequence: 2 fullname: Tillmann Miltzow |
| BookMark | eNotjstOwzAURC0EEqX0A9hZYp1gX8dxvIwqaJGK6ALWleNc01RODI7D4--JBJs50izOzBU5H8KAhNxwlheVlOzOxO_uMwfGVM5KDeyMLEAInlUFwCVZjeOJMQalAinFgjzVdB-NTZ01ntb-LcQuHXv6NSfdY3Qh9mawSDeTiWZIiCOdO5qOSOuY6MZ4j_FndoTGY39NLpzxI67-uSSvD_cv6222e948rutdZrhQKWu1a0qnC-0Eci5bqBC4EtCgrjhaqwVIoQqU80nFhAZpeGt5ixKddCUXS3L7532P4WPCMR1OYYrDPHmAAoSuKl4o8QvRRVDX |
| ContentType | Paper |
| Copyright | 2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: 2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | 8FE 8FG ABJCF ABUWG AFKRA AZQEC BENPR BGLVJ CCPQU DWQXO HCIFZ L6V M7S PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| DOI | 10.48550/arxiv.2007.06920 |
| DatabaseName | ProQuest SciTech Collection ProQuest Technology Collection ProQuest SciTech Premium Collection Technology Collection Materials Science & Engineering Database ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials ProQuest Central ProQuest Technology Collection ProQuest One ProQuest Central Korea SciTech Premium Collection ProQuest Engineering Collection Engineering Database ProQuest Central Premium ProQuest One Academic (New) Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection |
| DatabaseTitle | Publicly Available Content Database Engineering Database Technology Collection ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest One Academic UKI Edition ProQuest Central Korea Materials Science & Engineering Collection ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New) Engineering Collection |
| DatabaseTitleList | Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Physics |
| EISSN | 2331-8422 |
| Genre | Working Paper/Pre-Print |
| GroupedDBID | 8FE 8FG ABJCF ABUWG AFKRA ALMA_UNASSIGNED_HOLDINGS AZQEC BENPR BGLVJ CCPQU DWQXO FRJ HCIFZ L6V M7S M~E PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| ID | FETCH-LOGICAL-a137t-d9fb6f949f3e115d28e21732be981ecc9325374e5725703925a1dc1de5ef5f613 |
| IEDL.DBID | BENPR |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001342207200009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Mon Jun 30 09:10:10 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a137t-d9fb6f949f3e115d28e21732be981ecc9325374e5725703925a1dc1de5ef5f613 |
| Notes | SourceType-Working Papers-1 ObjectType-Working Paper/Pre-Print-1 content type line 50 |
| OpenAccessLink | https://www.proquest.com/docview/2423988147?pq-origsite=%requestingapplication% |
| PQID | 2423988147 |
| PQPubID | 2050157 |
| ParticipantIDs | proquest_journals_2423988147 |
| PublicationCentury | 2000 |
| PublicationDate | 20240611 |
| PublicationDateYYYYMMDD | 2024-06-11 |
| PublicationDate_xml | – month: 06 year: 2024 text: 20240611 day: 11 |
| PublicationDecade | 2020 |
| PublicationPlace | Ithaca |
| PublicationPlace_xml | – name: Ithaca |
| PublicationTitle | arXiv.org |
| PublicationYear | 2024 |
| Publisher | Cornell University Library, arXiv.org |
| Publisher_xml | – name: Cornell University Library, arXiv.org |
| SSID | ssj0002672553 |
| Score | 2.3048198 |
| SecondaryResourceType | preprint |
| Snippet | Given a closed simple polygon \(P\), we say two points \(p,q\) see each other if the segment \(pq\) is fully contained in \(P\). The art gallery problem seeks... |
| SourceID | proquest |
| SourceType | Aggregation Database |
| SubjectTerms | Algebra Algorithms Apexes Art galleries & museums Chords (geometry) Guards Iterative algorithms Iterative methods Parameterization Polygons Polynomials Set theory Stability Vision |
| Title | A Practical Algorithm with Performance Guarantees for the Art Gallery Problem |
| URI | https://www.proquest.com/docview/2423988147 |
| WOSCitedRecordID | wos001342207200009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwELagBYmJt3iUygNr1PqR2J5QQS0wtIp4SGWqbMeBStCWJFTw7zmnKR2QWBiTKFF059x9d758H0LnShvdTiOoVJmgAXeA4YwNSWDbWkJsFI7TpBSbEIOBHA5VXDXc8mqschkTy0CdTK3vkbdoyVQnCRcXs_fAq0b53dVKQmMd1T1TGa-h-mV3EN_9dFloJAAzs8V2Zkne1dLZ53hecRdGirZ_BeEys_S2__tOO6ge65nLdtGam-yhzXKi0-b7qN_BCy4icALuvD7DfcXLG_Z9Vxyv_hbAfo1467ocwzkMeBB3sgJfe42V7AueUQrOHKDHXvfh6iaotBMCTZgogkSlJkoVVylzAPoSKh0UH4wapyQBtwFsC5ngLhRexg5AUqhJYkniQpeGKeT4Q1SbTCfuCGHJjAEcEjnDKbdSmkhBko-ktoylUF4fo8bSOqPqA8hHK9Oc_H35FG1RwAl--oqQBqoV2Yc7Qxt2XozzrFn5s-lHMu_hKL7tx0_fLISsyQ |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V07T8MwED6VFgQTb_Eo4AHGqIntJM6AUAWUVn0oQ5HKVPJwoBK0JQmF_il-I-c0pQMSWwfWWLF8vvP58_l8H8C54_meHll4UmU21bhEDOcHpqEFuifQN9qS0zAjm7A7HdHrOW4BvuZvYVRa5dwnZo46HAUqRl6hWaU6YXD7avymKdYodbs6p9CYmUVTTj_wyJZcNm5QvxeU1m6713UtZxXQPIPZqRY6kW9FDnciJhEOhVRIhOWM-tIRBgqEgMZkNpemrQjeED6YnhEGRihNGZkR7n7Y7wqUOBq7KELJbbTdh5-oDrXwL5PNrk-zYmEVL_4cTPJaiZZD9V9OP9vJapv_bQ62UHZvLONtKMjhDqxlGatBsgvtKpnVWkIjI9WXJxxn-vxKVFyZuIvXEEStAWU9MiH4jSDeJdU4JXeKQyaeYh8Zoc4e3C9Fgn0oDkdDeQBEMN9HnGVJn1MeCOFbDoIYS3gBY5HOrUMoz7XRzxd40l-o4ujv5jNYr3fbrX6r0WkewwZFTKQyzQyjDMU0fpcnsBpM0kESn-a2ROBx2ar7BmsbBhM |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Practical+Algorithm+with+Performance+Guarantees+for+the+Art+Gallery+Problem&rft.jtitle=arXiv.org&rft.au=Hengeveld%2C+Simon&rft.au=Tillmann+Miltzow&rft.date=2024-06-11&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.2007.06920 |