Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time
We show that, for planar point sets, the number of non-crossing Hamiltonian paths is polynomially bounded in the number of non-crossing paths, and the number of non-crossing Hamiltonian cycles (polygonalizations) is polynomially bounded in the number of surrounding cycles. As a consequence, we can l...
Uloženo v:
| Vydáno v: | arXiv.org |
|---|---|
| Hlavní autor: | |
| Médium: | Paper |
| Jazyk: | angličtina |
| Vydáno: |
Ithaca
Cornell University Library, arXiv.org
01.03.2023
|
| Témata: | |
| ISSN: | 2331-8422 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | We show that, for planar point sets, the number of non-crossing Hamiltonian paths is polynomially bounded in the number of non-crossing paths, and the number of non-crossing Hamiltonian cycles (polygonalizations) is polynomially bounded in the number of surrounding cycles. As a consequence, we can list the non-crossing Hamiltonian paths or the polygonalizations, in time polynomial in the output size, by filtering the output of simple backtracking algorithms for non-crossing paths or surrounding cycles respectively. To prove these results we relate the numbers of non-crossing structures to two easily-computed parameters of the point set: the minimum number of points whose removal results in a collinear set, and the number of points interior to the convex hull. These relations also lead to polynomial-time approximation algorithms for the numbers of structures of all four types, accurate to within a constant factor of the logarithm of these numbers. |
|---|---|
| AbstractList | We show that, for planar point sets, the number of non-crossing Hamiltonian paths is polynomially bounded in the number of non-crossing paths, and the number of non-crossing Hamiltonian cycles (polygonalizations) is polynomially bounded in the number of surrounding cycles. As a consequence, we can list the non-crossing Hamiltonian paths or the polygonalizations, in time polynomial in the output size, by filtering the output of simple backtracking algorithms for non-crossing paths or surrounding cycles respectively. To prove these results we relate the numbers of non-crossing structures to two easily-computed parameters of the point set: the minimum number of points whose removal results in a collinear set, and the number of points interior to the convex hull. These relations also lead to polynomial-time approximation algorithms for the numbers of structures of all four types, accurate to within a constant factor of the logarithm of these numbers. |
| Author | Eppstein, David |
| Author_xml | – sequence: 1 givenname: David surname: Eppstein fullname: Eppstein, David |
| BookMark | eNotjU9LwzAcQIMoOOc-gLeA59Rf_jY9SlEnDLdD7yNpUs1ok9m04r69g3l6vMt7d-g6pugReqBQCC0lPJnxN_wUjAMvAKgor9CCcU6JFozdolXOBwBgqmRS8gWqP1Ik7ZhyDvETr80Q-inFYCLemekrYxMdrk9t7zMOEW_n6ThPZJf6U0xDMD1uwuDv0U1n-uxX_1yi5vWlqddks317r583xEhGCa0s-LKirRdgVeUkFQ5AuVIrxQVXqqs6qZ3XhmsngLmWirNYbZXtjHV8iR4v2eOYvmefp_0hzWM8H_es1FRQygXlfw8CTW8 |
| ContentType | Paper |
| Copyright | 2023. 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: 2023. 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.2303.00147 |
| DatabaseName | ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials - QC ProQuest Central Technology Collection ProQuest One Community College ProQuest Central SciTech Premium Collection ProQuest Engineering Collection Engineering Database ProQuest Central Premium ProQuest One Academic 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: ProQuest 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-a521-19b0e791ce40b69d514d006d786634366f9f58de8a38d402dc14e8ab8b6bfabd3 |
| IEDL.DBID | M7S |
| IngestDate | Mon Jun 30 09:28:36 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a521-19b0e791ce40b69d514d006d786634366f9f58de8a38d402dc14e8ab8b6bfabd3 |
| Notes | SourceType-Working Papers-1 ObjectType-Working Paper/Pre-Print-1 content type line 50 |
| OpenAccessLink | https://www.proquest.com/docview/2781411341?pq-origsite=%requestingapplication% |
| PQID | 2781411341 |
| PQPubID | 2050157 |
| ParticipantIDs | proquest_journals_2781411341 |
| PublicationCentury | 2000 |
| PublicationDate | 20230301 |
| PublicationDateYYYYMMDD | 2023-03-01 |
| PublicationDate_xml | – month: 03 year: 2023 text: 20230301 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | Ithaca |
| PublicationPlace_xml | – name: Ithaca |
| PublicationTitle | arXiv.org |
| PublicationYear | 2023 |
| Publisher | Cornell University Library, arXiv.org |
| Publisher_xml | – name: Cornell University Library, arXiv.org |
| SSID | ssj0002672553 |
| Score | 1.823921 |
| SecondaryResourceType | preprint |
| Snippet | We show that, for planar point sets, the number of non-crossing Hamiltonian paths is polynomially bounded in the number of non-crossing paths, and the number... |
| SourceID | proquest |
| SourceType | Aggregation Database |
| SubjectTerms | Algorithms Computational geometry Convexity Polynomials |
| Title | Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time |
| URI | https://www.proquest.com/docview/2781411341 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV27TsMwFLWgBYmJt3iUygNr1LpxHWdCompVJAgRdChT5UciVaqSkqQV_XvudQMMSCyMlhfLj3uPj4_PJeTWT3WQKq4BuSlkq-C6I42Rngl5KgwHTJo6n9nHIIrkdBrGNeFW1rLKr5joArXNDXLknR56MzG0H7tbvntYNQpfV-sSGrukiS4JzEn3Xr85lp4IADH728dMZ93VUcXHfI3qZzQ2ZTz4FYJdXhkd_ndER6QZq2VSHJOdJDsh-07PacpTMojyzHMZEFITHSOLASAPtgKNAfKVVGWWDjaoiKPzjD6vquWq8uJ8scFfympB8WfIGZmMhpPB2KvrJXgKkrDHQt1NgpCZhHe1CC1AIQtnygYSUAX3hUjDtC9tIpUvLVwbrWEcGlpqoVOlrX9OGlmeJReEKvS574ddJWyXMyuk0EZJZkTf-ExL_5K0vqZkVu_5cvYzH1d_d1-TAyzavlVytUijKlbJDdkz62peFm3SvB9G8UvbLSW04oen-O0TNKKo8A |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT8JAEJ4gaPTkOz5Q96DHhr7Ybg_GA0ogYG0iB25kH21CQgq2BeVH-R-dLVQPJt44eGyaNM3u7Mw3s998A3DrxMKLuSsQuXFdrcJ0h0nJDOm7MZUuYtK40Jnte0HAhkM_rMBn2QujaZWlTywctZpKXSNv2FqbydLyYw-zN0NPjdK3q-UIjZVZ9KLlO6Zs2X33Eff3zrbbT4NWx1hPFTA4hirD8oUZeb4lI9cU1FcIGBRanvIYxl7XoTT24yZTEeMOU5hcKWm5-CCYoCLmQjn42S2oIYqw_YIp-Ppd0rGphwDdWd2dFkphDZ5-jBeabK11VC3X--XxizDW3v9nC3AAtZDPovQQKlFyBDsFW1Vmx9AKpolRxHcMvKSjazQIYdHQSYiANiM8UaS11Hw_Mk7IyzyfzXMjnE6WugebT4juezmBwSZ--xSqyTSJzoBwreLf9E1OlelaijIqJGeWpE3pWII551Avd2C0PtHZ6Gf5L_5-fQO7ncFzf9TvBr1L2NPj6VectTpU83QeXcG2XOTjLL0urIfAaMOb9QW09AGW |
| 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=Non-crossing+Hamiltonian+Paths+and+Cycles+in+Output-Polynomial+Time&rft.jtitle=arXiv.org&rft.au=Eppstein%2C+David&rft.date=2023-03-01&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.2303.00147 |