Traversal with Enumeration of Geometric Graphs in Bounded Space
In this paper, we provide an algorithm for traversing geometric graphs which visits all vertices, and reports every vertex and edge exactly once. To achieve this, we combine a given geometric graph \(G\) with the integer lattice, seen as a graph, in such a way that the resulting hypothetical graph c...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2018-11 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Khakabimamaghani, Sahand Masjoody, Masood Stacho, Ladislav |
| description | In this paper, we provide an algorithm for traversing geometric graphs which visits all vertices, and reports every vertex and edge exactly once. To achieve this, we combine a given geometric graph \(G\) with the integer lattice, seen as a graph, in such a way that the resulting hypothetical graph can be traversed using the algorithm in \cite{Chavez}. To overcome the problem with hypothetical vertices and edges, we develop an algorithm for visiting any \(k\)th neighborhood of a vertex in a graph straight-line drawn in the plane using \(O(\log k)\) memory. The memory needed to complete the traversal of a geometric graph then turns out to depend on the maximum ratio of the graph distance and Euclidean distance for pairs of distinct vertices of \(G\) at Euclidean distance greater than one and less than \(2\sqrt{2}\). |
| doi_str_mv | 10.48550/arxiv.1811.04336 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_1811_04336</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2132522248</sourcerecordid><originalsourceid>FETCH-LOGICAL-a528-e25e3ac4e84ec99a96dec0ea9a23db4908a5284850e08e4ff5279cb0d41559223</originalsourceid><addsrcrecordid>eNotj0FLwzAYhoMgOOZ-gCcDnluTL0mXnETHrMLAg72Xb-1X1rE2NW2n_nu7zdN7eXh5HsbupIi1NUY8Yvipj7G0UsZCK5VcsRkoJSOrAW7You_3QghIlmCMmrGnLOCRQo8H_l0PO75ux4YCDrVvua94Sr6hIdQFTwN2u57XLX_xY1tSyT87LOiWXVd46Gnxv3OWva6z1Vu0-UjfV8-bCA3YiMCQwkKT1VQ4hy4pqRCEDkGVW-2EPWGTvyBhSVeVgaUrtqLU0hgHoObs_nJ7rsu7UDcYfvNTZX6unIiHC9EF_zVSP-R7P4Z2cspBKjAAoK36A2-BU_g</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2132522248</pqid></control><display><type>article</type><title>Traversal with Enumeration of Geometric Graphs in Bounded Space</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Khakabimamaghani, Sahand ; Masjoody, Masood ; Stacho, Ladislav</creator><creatorcontrib>Khakabimamaghani, Sahand ; Masjoody, Masood ; Stacho, Ladislav</creatorcontrib><description>In this paper, we provide an algorithm for traversing geometric graphs which visits all vertices, and reports every vertex and edge exactly once. To achieve this, we combine a given geometric graph \(G\) with the integer lattice, seen as a graph, in such a way that the resulting hypothetical graph can be traversed using the algorithm in \cite{Chavez}. To overcome the problem with hypothetical vertices and edges, we develop an algorithm for visiting any \(k\)th neighborhood of a vertex in a graph straight-line drawn in the plane using \(O(\log k)\) memory. The memory needed to complete the traversal of a geometric graph then turns out to depend on the maximum ratio of the graph distance and Euclidean distance for pairs of distinct vertices of \(G\) at Euclidean distance greater than one and less than \(2\sqrt{2}\).</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.1811.04336</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Apexes ; Enumeration ; Euclidean geometry ; Graph theory ; Graphs ; Mathematics - Combinatorics</subject><ispartof>arXiv.org, 2018-11</ispartof><rights>2018. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,780,881,27902</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.1811.04336$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.1142/S0219265919500087$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Khakabimamaghani, Sahand</creatorcontrib><creatorcontrib>Masjoody, Masood</creatorcontrib><creatorcontrib>Stacho, Ladislav</creatorcontrib><title>Traversal with Enumeration of Geometric Graphs in Bounded Space</title><title>arXiv.org</title><description>In this paper, we provide an algorithm for traversing geometric graphs which visits all vertices, and reports every vertex and edge exactly once. To achieve this, we combine a given geometric graph \(G\) with the integer lattice, seen as a graph, in such a way that the resulting hypothetical graph can be traversed using the algorithm in \cite{Chavez}. To overcome the problem with hypothetical vertices and edges, we develop an algorithm for visiting any \(k\)th neighborhood of a vertex in a graph straight-line drawn in the plane using \(O(\log k)\) memory. The memory needed to complete the traversal of a geometric graph then turns out to depend on the maximum ratio of the graph distance and Euclidean distance for pairs of distinct vertices of \(G\) at Euclidean distance greater than one and less than \(2\sqrt{2}\).</description><subject>Algorithms</subject><subject>Apexes</subject><subject>Enumeration</subject><subject>Euclidean geometry</subject><subject>Graph theory</subject><subject>Graphs</subject><subject>Mathematics - Combinatorics</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><sourceid>GOX</sourceid><recordid>eNotj0FLwzAYhoMgOOZ-gCcDnluTL0mXnETHrMLAg72Xb-1X1rE2NW2n_nu7zdN7eXh5HsbupIi1NUY8Yvipj7G0UsZCK5VcsRkoJSOrAW7You_3QghIlmCMmrGnLOCRQo8H_l0PO75ux4YCDrVvua94Sr6hIdQFTwN2u57XLX_xY1tSyT87LOiWXVd46Gnxv3OWva6z1Vu0-UjfV8-bCA3YiMCQwkKT1VQ4hy4pqRCEDkGVW-2EPWGTvyBhSVeVgaUrtqLU0hgHoObs_nJ7rsu7UDcYfvNTZX6unIiHC9EF_zVSP-R7P4Z2cspBKjAAoK36A2-BU_g</recordid><startdate>20181111</startdate><enddate>20181111</enddate><creator>Khakabimamaghani, Sahand</creator><creator>Masjoody, Masood</creator><creator>Stacho, Ladislav</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20181111</creationdate><title>Traversal with Enumeration of Geometric Graphs in Bounded Space</title><author>Khakabimamaghani, Sahand ; Masjoody, Masood ; Stacho, Ladislav</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a528-e25e3ac4e84ec99a96dec0ea9a23db4908a5284850e08e4ff5279cb0d41559223</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Algorithms</topic><topic>Apexes</topic><topic>Enumeration</topic><topic>Euclidean geometry</topic><topic>Graph theory</topic><topic>Graphs</topic><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Khakabimamaghani, Sahand</creatorcontrib><creatorcontrib>Masjoody, Masood</creatorcontrib><creatorcontrib>Stacho, Ladislav</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Khakabimamaghani, Sahand</au><au>Masjoody, Masood</au><au>Stacho, Ladislav</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Traversal with Enumeration of Geometric Graphs in Bounded Space</atitle><jtitle>arXiv.org</jtitle><date>2018-11-11</date><risdate>2018</risdate><eissn>2331-8422</eissn><abstract>In this paper, we provide an algorithm for traversing geometric graphs which visits all vertices, and reports every vertex and edge exactly once. To achieve this, we combine a given geometric graph \(G\) with the integer lattice, seen as a graph, in such a way that the resulting hypothetical graph can be traversed using the algorithm in \cite{Chavez}. To overcome the problem with hypothetical vertices and edges, we develop an algorithm for visiting any \(k\)th neighborhood of a vertex in a graph straight-line drawn in the plane using \(O(\log k)\) memory. The memory needed to complete the traversal of a geometric graph then turns out to depend on the maximum ratio of the graph distance and Euclidean distance for pairs of distinct vertices of \(G\) at Euclidean distance greater than one and less than \(2\sqrt{2}\).</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.1811.04336</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2018-11 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_1811_04336 |
| source | arXiv.org; Free E- Journals |
| subjects | Algorithms Apexes Enumeration Euclidean geometry Graph theory Graphs Mathematics - Combinatorics |
| title | Traversal with Enumeration of Geometric Graphs in Bounded Space |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T15%3A10%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Traversal%20with%20Enumeration%20of%20Geometric%20Graphs%20in%20Bounded%20Space&rft.jtitle=arXiv.org&rft.au=Khakabimamaghani,%20Sahand&rft.date=2018-11-11&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.1811.04336&rft_dat=%3Cproquest_arxiv%3E2132522248%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2132522248&rft_id=info:pmid/&rfr_iscdi=true |