{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:11:55Z","timestamp":1758823915014},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[1992,6]]},"abstract":"<jats:p> In this paper we prove the correctness of a \u201clocal\u201d criterion for computing the convex hull of the union ( \u201cmerging\u201d) of two disjoint convex polyhedra. This criterion is structural. Therefore it can be algorithmically tested in several ways, not necessarily involving the determination of support (tangent) planes; indeed, it can be implemented by just testing for the intersection of certain planes and lines with convex polytopes. This criterion is amenable to parallel implementation and leads to a provably correct algorithm that computes the convex hull of any n points in three-dimensional space in O( log <jats:sup>2<\/jats:sup> n) time using O(n) processors on a CREW PRAM. <\/jats:p>","DOI":"10.1142\/s021819599200010x","type":"journal-article","created":{"date-parts":[[2004,11,25]],"date-time":"2004-11-25T00:50:24Z","timestamp":1101343824000},"page":"163-173","source":"Crossref","is-referenced-by-count":13,"title":["THE PARALLEL 3D CONVEX HULL PROBLEM REVISITED"],"prefix":"10.1142","volume":"02","author":[{"given":"NANCY M.","family":"AMATO","sequence":"first","affiliation":[{"name":"Department of Computer Science and Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"FRANCO P.","family":"PREPARATA","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Brown University, Box 1910, Providence, RI 02912, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S021819599200010X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T23:57:43Z","timestamp":1565135863000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S021819599200010X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":0,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1992,6]]}},"alternative-id":["10.1142\/S021819599200010X"],"URL":"https:\/\/doi.org\/10.1142\/s021819599200010x","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}