Time- and VLSI-optimal convex hull computation on meshes with multiple broadcasting
Our main contribution is to present the first known general-case, time- and VLSI-optimal, algorithm for convex hull computation on meshes with multiple broadcasting. Specifically, we show that for every choice of a positive constant ε, the convex hull of a set of an arbitrary set of m (n 1 2 + ε ⩽ m...
Gespeichert in:
| Veröffentlicht in: | Information processing letters 1995-12, Vol.56 (5), p.273-280 |
|---|---|
| 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 | 280 |
|---|---|
| container_issue | 5 |
| container_start_page | 273 |
| container_title | Information processing letters |
| container_volume | 56 |
| creator | Bokka, V. Gurla, H. Olariu, S. Schwing, J.L. |
| description | Our main contribution is to present the first known general-case, time- and VLSI-optimal, algorithm for convex hull computation on meshes with multiple broadcasting. Specifically, we show that for every choice of a positive constant ε, the convex hull of a set of an arbitrary set of
m (n
1
2 + ε
⩽ m ⩽ n)
points in the plane input in the first
⌉
m
√n
⌈
columns of a mesh with multiple broadcasting of size √
n × √
n can be computed in Θ (
m
√n
) time. |
| doi_str_mv | 10.1016/0020-0190(95)00160-8 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_237274555</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>0020019095001608</els_id><sourcerecordid>9130420</sourcerecordid><originalsourceid>FETCH-LOGICAL-c275t-b6f903fa8b57b78d8b5a4127747f7c1d468995b0c7e9d4ccd0fe3297c894a8633</originalsourceid><addsrcrecordid>eNp9kE1LxDAQhoMouK7-Aw9FPOihOmmTprkIsvixsOBhV68hTVM3S79M0lX_vakrexQGZhied17mRegcww0GnN0CJBAD5nDF6TWEDcT5AZrgnCVxhjE_RJM9coxOnNsAQEZSNkHLlWl0HMm2jN4Wy3nc9d40so5U1271V7Qe6nFu-sFLb7o2CtVot9Yu-jR-HTVD7U1f66iwnSyVdN6076foqJK102d_fYpeHx9Ws-d48fI0n90vYpUw6uMiqziklcwLygqWl6FLghPGCKuYwiXJcs5pAYppXhKlSqh0mnCmck5knqXpFF3s7va2-xi082LTDbYNliJJWcIIpTRAZAcp2zlndSV6Gz603wKDGNMTYzRijEZwKn7TE3mQXf7dlk7JurKyVcbttSkwxgkJ2N0O0-HPrdFWOGV0q3RprFZelJ353-cHE56CXA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>237274555</pqid></control><display><type>article</type><title>Time- and VLSI-optimal convex hull computation on meshes with multiple broadcasting</title><source>Elsevier ScienceDirect Journals</source><creator>Bokka, V. ; Gurla, H. ; Olariu, S. ; Schwing, J.L.</creator><creatorcontrib>Bokka, V. ; Gurla, H. ; Olariu, S. ; Schwing, J.L.</creatorcontrib><description>Our main contribution is to present the first known general-case, time- and VLSI-optimal, algorithm for convex hull computation on meshes with multiple broadcasting. Specifically, we show that for every choice of a positive constant ε, the convex hull of a set of an arbitrary set of
m (n
1
2 + ε
⩽ m ⩽ n)
points in the plane input in the first
⌉
m
√n
⌈
columns of a mesh with multiple broadcasting of size √
n × √
n can be computed in Θ (
m
√n
) time.</description><identifier>ISSN: 0020-0190</identifier><identifier>EISSN: 1872-6119</identifier><identifier>DOI: 10.1016/0020-0190(95)00160-8</identifier><identifier>CODEN: IFPLAT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Algorithms ; Applied sciences ; Computational geometry ; Computer architecture ; Computer science; control theory; systems ; Design of algorithms ; Exact sciences and technology ; Information processing ; Mathematical models ; Optimization ; Parallel algorithms ; Theoretical computing ; VLSI</subject><ispartof>Information processing letters, 1995-12, Vol.56 (5), p.273-280</ispartof><rights>1995</rights><rights>1996 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Dec 8, 1995</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c275t-b6f903fa8b57b78d8b5a4127747f7c1d468995b0c7e9d4ccd0fe3297c894a8633</citedby><cites>FETCH-LOGICAL-c275t-b6f903fa8b57b78d8b5a4127747f7c1d468995b0c7e9d4ccd0fe3297c894a8633</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/0020019095001608$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65306</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=3077944$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Bokka, V.</creatorcontrib><creatorcontrib>Gurla, H.</creatorcontrib><creatorcontrib>Olariu, S.</creatorcontrib><creatorcontrib>Schwing, J.L.</creatorcontrib><title>Time- and VLSI-optimal convex hull computation on meshes with multiple broadcasting</title><title>Information processing letters</title><description>Our main contribution is to present the first known general-case, time- and VLSI-optimal, algorithm for convex hull computation on meshes with multiple broadcasting. Specifically, we show that for every choice of a positive constant ε, the convex hull of a set of an arbitrary set of
m (n
1
2 + ε
⩽ m ⩽ n)
points in the plane input in the first
⌉
m
√n
⌈
columns of a mesh with multiple broadcasting of size √
n × √
n can be computed in Θ (
m
√n
) time.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Computational geometry</subject><subject>Computer architecture</subject><subject>Computer science; control theory; systems</subject><subject>Design of algorithms</subject><subject>Exact sciences and technology</subject><subject>Information processing</subject><subject>Mathematical models</subject><subject>Optimization</subject><subject>Parallel algorithms</subject><subject>Theoretical computing</subject><subject>VLSI</subject><issn>0020-0190</issn><issn>1872-6119</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1995</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LxDAQhoMouK7-Aw9FPOihOmmTprkIsvixsOBhV68hTVM3S79M0lX_vakrexQGZhied17mRegcww0GnN0CJBAD5nDF6TWEDcT5AZrgnCVxhjE_RJM9coxOnNsAQEZSNkHLlWl0HMm2jN4Wy3nc9d40so5U1271V7Qe6nFu-sFLb7o2CtVot9Yu-jR-HTVD7U1f66iwnSyVdN6076foqJK102d_fYpeHx9Ws-d48fI0n90vYpUw6uMiqziklcwLygqWl6FLghPGCKuYwiXJcs5pAYppXhKlSqh0mnCmck5knqXpFF3s7va2-xi082LTDbYNliJJWcIIpTRAZAcp2zlndSV6Gz603wKDGNMTYzRijEZwKn7TE3mQXf7dlk7JurKyVcbttSkwxgkJ2N0O0-HPrdFWOGV0q3RprFZelJ353-cHE56CXA</recordid><startdate>19951208</startdate><enddate>19951208</enddate><creator>Bokka, V.</creator><creator>Gurla, H.</creator><creator>Olariu, S.</creator><creator>Schwing, J.L.</creator><general>Elsevier B.V</general><general>Elsevier Science</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19951208</creationdate><title>Time- and VLSI-optimal convex hull computation on meshes with multiple broadcasting</title><author>Bokka, V. ; Gurla, H. ; Olariu, S. ; Schwing, J.L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c275t-b6f903fa8b57b78d8b5a4127747f7c1d468995b0c7e9d4ccd0fe3297c894a8633</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1995</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Computational geometry</topic><topic>Computer architecture</topic><topic>Computer science; control theory; systems</topic><topic>Design of algorithms</topic><topic>Exact sciences and technology</topic><topic>Information processing</topic><topic>Mathematical models</topic><topic>Optimization</topic><topic>Parallel algorithms</topic><topic>Theoretical computing</topic><topic>VLSI</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bokka, V.</creatorcontrib><creatorcontrib>Gurla, H.</creatorcontrib><creatorcontrib>Olariu, S.</creatorcontrib><creatorcontrib>Schwing, J.L.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Information processing letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bokka, V.</au><au>Gurla, H.</au><au>Olariu, S.</au><au>Schwing, J.L.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Time- and VLSI-optimal convex hull computation on meshes with multiple broadcasting</atitle><jtitle>Information processing letters</jtitle><date>1995-12-08</date><risdate>1995</risdate><volume>56</volume><issue>5</issue><spage>273</spage><epage>280</epage><pages>273-280</pages><issn>0020-0190</issn><eissn>1872-6119</eissn><coden>IFPLAT</coden><abstract>Our main contribution is to present the first known general-case, time- and VLSI-optimal, algorithm for convex hull computation on meshes with multiple broadcasting. Specifically, we show that for every choice of a positive constant ε, the convex hull of a set of an arbitrary set of
m (n
1
2 + ε
⩽ m ⩽ n)
points in the plane input in the first
⌉
m
√n
⌈
columns of a mesh with multiple broadcasting of size √
n × √
n can be computed in Θ (
m
√n
) time.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/0020-0190(95)00160-8</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0020-0190 |
| ispartof | Information processing letters, 1995-12, Vol.56 (5), p.273-280 |
| issn | 0020-0190 1872-6119 |
| language | eng |
| recordid | cdi_proquest_journals_237274555 |
| source | Elsevier ScienceDirect Journals |
| subjects | Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computational geometry Computer architecture Computer science control theory systems Design of algorithms Exact sciences and technology Information processing Mathematical models Optimization Parallel algorithms Theoretical computing VLSI |
| title | Time- and VLSI-optimal convex hull computation on meshes with multiple broadcasting |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T14%3A07%3A59IST&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=Time-%20and%20VLSI-optimal%20convex%20hull%20computation%20on%20meshes%20with%20multiple%20broadcasting&rft.jtitle=Information%20processing%20letters&rft.au=Bokka,%20V.&rft.date=1995-12-08&rft.volume=56&rft.issue=5&rft.spage=273&rft.epage=280&rft.pages=273-280&rft.issn=0020-0190&rft.eissn=1872-6119&rft.coden=IFPLAT&rft_id=info:doi/10.1016/0020-0190(95)00160-8&rft_dat=%3Cproquest_cross%3E9130420%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=237274555&rft_id=info:pmid/&rft_els_id=0020019095001608&rfr_iscdi=true |