Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons
In this paper, we study the convex-straight-skeleton Voronoi diagrams of line segments and convex polygons. We explore the combinatorial complexity of these diagrams, and provide efficient algorithms for computing compact representations of them.
Gespeichert in:
| Veröffentlicht in: | Algorithmica 2021-07, Vol.83 (7), p.2245-2272 |
|---|---|
| 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 | 2272 |
|---|---|
| container_issue | 7 |
| container_start_page | 2245 |
| container_title | Algorithmica |
| container_volume | 83 |
| creator | Barequet, Gill De, Minati Goodrich, Michael T. |
| description | In this paper, we study the convex-straight-skeleton Voronoi diagrams of line segments and convex polygons. We explore the combinatorial complexity of these diagrams, and provide efficient algorithms for computing compact representations of them. |
| doi_str_mv | 10.1007/s00453-021-00824-9 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2544228708</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2544228708</sourcerecordid><originalsourceid>FETCH-LOGICAL-c270t-f89e7a7ff1d478e7a8e7b065f6f6d2c90e4c65592112512def1510dc990cc12e3</originalsourceid><addsrcrecordid>eNp9kE1LxDAQhoMouK7-AU8Fz9GZNGmao6zfLChUvYaaJrXrbrImXXH_vdUK3jwMM4f3eQceQo4RThFAniUALnIKDClAyThVO2SCPGcUBMddMgGUJeUFyn1ykNICAJlUxYTczYL_sJ-06mPdta89rd7s0vbBZ88hBh-67KKr21ivUuZCzCrbrqzvU1b7JhvR7CEst23w6ZDsuXqZ7NHvnpKnq8vH2Q2d31_fzs7n1DAJPXWlsrKWzmHDZTmcw7xAIVzhioYZBZabQgjFEJlA1liHAqExSoExyGw-JSdj7zqG941NvV6ETfTDS80E54yVEsohxcaUiSGlaJ1ex25Vx61G0N_O9OhMD870jzOtBigfoTSEfWvjX_U_1BcGbG65</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2544228708</pqid></control><display><type>article</type><title>Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons</title><source>SpringerLink Journals - AutoHoldings</source><creator>Barequet, Gill ; De, Minati ; Goodrich, Michael T.</creator><creatorcontrib>Barequet, Gill ; De, Minati ; Goodrich, Michael T.</creatorcontrib><description>In this paper, we study the convex-straight-skeleton Voronoi diagrams of line segments and convex polygons. We explore the combinatorial complexity of these diagrams, and provide efficient algorithms for computing compact representations of them.</description><identifier>ISSN: 0178-4617</identifier><identifier>EISSN: 1432-0541</identifier><identifier>DOI: 10.1007/s00453-021-00824-9</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithm Analysis and Problem Complexity ; Algorithms ; Combinatorial analysis ; Computer Science ; Computer Systems Organization and Communication Networks ; Data Structures and Information Theory ; Mathematics of Computing ; Polygons ; Segments ; Theory of Computation ; Voronoi graphs</subject><ispartof>Algorithmica, 2021-07, Vol.83 (7), p.2245-2272</ispartof><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021</rights><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c270t-f89e7a7ff1d478e7a8e7b065f6f6d2c90e4c65592112512def1510dc990cc12e3</cites><orcidid>0000-0002-1859-8800</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s00453-021-00824-9$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s00453-021-00824-9$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Barequet, Gill</creatorcontrib><creatorcontrib>De, Minati</creatorcontrib><creatorcontrib>Goodrich, Michael T.</creatorcontrib><title>Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons</title><title>Algorithmica</title><addtitle>Algorithmica</addtitle><description>In this paper, we study the convex-straight-skeleton Voronoi diagrams of line segments and convex polygons. We explore the combinatorial complexity of these diagrams, and provide efficient algorithms for computing compact representations of them.</description><subject>Algorithm Analysis and Problem Complexity</subject><subject>Algorithms</subject><subject>Combinatorial analysis</subject><subject>Computer Science</subject><subject>Computer Systems Organization and Communication Networks</subject><subject>Data Structures and Information Theory</subject><subject>Mathematics of Computing</subject><subject>Polygons</subject><subject>Segments</subject><subject>Theory of Computation</subject><subject>Voronoi graphs</subject><issn>0178-4617</issn><issn>1432-0541</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LxDAQhoMouK7-AU8Fz9GZNGmao6zfLChUvYaaJrXrbrImXXH_vdUK3jwMM4f3eQceQo4RThFAniUALnIKDClAyThVO2SCPGcUBMddMgGUJeUFyn1ykNICAJlUxYTczYL_sJ-06mPdta89rd7s0vbBZ88hBh-67KKr21ivUuZCzCrbrqzvU1b7JhvR7CEst23w6ZDsuXqZ7NHvnpKnq8vH2Q2d31_fzs7n1DAJPXWlsrKWzmHDZTmcw7xAIVzhioYZBZabQgjFEJlA1liHAqExSoExyGw-JSdj7zqG941NvV6ETfTDS80E54yVEsohxcaUiSGlaJ1ex25Vx61G0N_O9OhMD870jzOtBigfoTSEfWvjX_U_1BcGbG65</recordid><startdate>20210701</startdate><enddate>20210701</enddate><creator>Barequet, Gill</creator><creator>De, Minati</creator><creator>Goodrich, Michael T.</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0002-1859-8800</orcidid></search><sort><creationdate>20210701</creationdate><title>Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons</title><author>Barequet, Gill ; De, Minati ; Goodrich, Michael T.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c270t-f89e7a7ff1d478e7a8e7b065f6f6d2c90e4c65592112512def1510dc990cc12e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithm Analysis and Problem Complexity</topic><topic>Algorithms</topic><topic>Combinatorial analysis</topic><topic>Computer Science</topic><topic>Computer Systems Organization and Communication Networks</topic><topic>Data Structures and Information Theory</topic><topic>Mathematics of Computing</topic><topic>Polygons</topic><topic>Segments</topic><topic>Theory of Computation</topic><topic>Voronoi graphs</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Barequet, Gill</creatorcontrib><creatorcontrib>De, Minati</creatorcontrib><creatorcontrib>Goodrich, Michael T.</creatorcontrib><collection>CrossRef</collection><jtitle>Algorithmica</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Barequet, Gill</au><au>De, Minati</au><au>Goodrich, Michael T.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons</atitle><jtitle>Algorithmica</jtitle><stitle>Algorithmica</stitle><date>2021-07-01</date><risdate>2021</risdate><volume>83</volume><issue>7</issue><spage>2245</spage><epage>2272</epage><pages>2245-2272</pages><issn>0178-4617</issn><eissn>1432-0541</eissn><abstract>In this paper, we study the convex-straight-skeleton Voronoi diagrams of line segments and convex polygons. We explore the combinatorial complexity of these diagrams, and provide efficient algorithms for computing compact representations of them.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s00453-021-00824-9</doi><tpages>28</tpages><orcidid>https://orcid.org/0000-0002-1859-8800</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0178-4617 |
| ispartof | Algorithmica, 2021-07, Vol.83 (7), p.2245-2272 |
| issn | 0178-4617 1432-0541 |
| language | eng |
| recordid | cdi_proquest_journals_2544228708 |
| source | SpringerLink Journals - AutoHoldings |
| subjects | Algorithm Analysis and Problem Complexity Algorithms Combinatorial analysis Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Polygons Segments Theory of Computation Voronoi graphs |
| title | Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T16%3A09%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Convex-Straight-Skeleton%20Voronoi%20Diagrams%20for%20Segments%20and%20Convex%20Polygons&rft.jtitle=Algorithmica&rft.au=Barequet,%20Gill&rft.date=2021-07-01&rft.volume=83&rft.issue=7&rft.spage=2245&rft.epage=2272&rft.pages=2245-2272&rft.issn=0178-4617&rft.eissn=1432-0541&rft_id=info:doi/10.1007/s00453-021-00824-9&rft_dat=%3Cproquest_cross%3E2544228708%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2544228708&rft_id=info:pmid/&rfr_iscdi=true |