Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/7096
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Dehne F. | en |
dc.contributor.author | Sack J. | en |
dc.contributor.author | Stojmenović I. | en |
dc.date.accessioned | 2019-09-30T08:59:33Z | - |
dc.date.available | 2019-09-30T08:59:33Z | - |
dc.date.issued | 1988-01-01 | en |
dc.identifier.isbn | 9783540194873 | en |
dc.identifier.issn | 03029743 | en |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/7096 | - |
dc.description.abstract | © 1988, Springer-Verlag. This paper discusses the construction of the 3-dimensional convex hull for a set of n points stored on a √n × √n mesh of processors. Lu has shown that this problem can be solved in √n log n time if all points are located on a sphere. Here, we solve, in the same time-complexity, the 3-dimensional convex hull problem for arbitrary point sets. Furthermore, we observe a time/space trade off: if each processor is allocated O(log n) space then √n time is sufficient to determine the 3-dimensional convex hull. | en |
dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | en |
dc.title | A note on determining the 3-dimensional convex hull of a set of points on a mesh of processors: Preliminary version | en |
dc.type | Conference Paper | en |
dc.identifier.doi | 10.1007/3-540-19487-8_18 | en |
dc.identifier.scopus | 2-s2.0-84942487350 | en |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/84942487350 | en |
dc.relation.lastpage | 162 | en |
dc.relation.firstpage | 154 | en |
dc.relation.volume | 318 LNCS | en |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
Appears in Collections: | Naučne i umetničke publikacije |
SCOPUSTM
Citations
5
checked on May 3, 2024
Page view(s)
8
Last Week
5
5
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.