{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:23Z","timestamp":1725663203807},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540503354"},{"type":"electronic","value":"9783540459750"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-50335-8_29","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:21:20Z","timestamp":1330183280000},"page":"113-135","source":"Crossref","is-referenced-by-count":4,"title":["A divide-and-conquer algorithm for computing 4-dimensional convex hulls"],"prefix":"10.1007","author":[{"given":"C. E.","family":"Buckley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/321556.321564","volume":"17","author":"D. R. Chand","year":"1970","unstructured":"D. R. Chand and S. S. Kapur. An algorithm for convex polytopes. Jounal of the ACM, 17:78\u201386, 1970.","journal-title":"Jounal of the ACM"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"D. P. Dobkin and M. J. Laszlo. Primitives for the manipulation of three-dimensional subdivisions. In ACM Siggraph Symposium on Computational Geometry, pages 86\u201399, Waterloo, Ontario, June 1987.","DOI":"10.1145\/41958.41967"},{"key":"10_CR3","unstructured":"P. Dornier and S. Paschedag. The animation of simulation results in three dimensions. July 1988. ETH Abt. IIIB Semesterarbeit."},{"key":"10_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Heidelberg, 1987."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","volume":"1","author":"R. L. Graham","year":"1972","unstructured":"R. L. Graham. An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters, 1:132\u2013133, 1972.","journal-title":"Information Processing Letters"},{"issue":"2","key":"10_CR6","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/282918.282923","volume":"4","author":"L. J. Guibas","year":"1985","unstructured":"L. J. Guibas and J. Stolfi. Primitives for manipulation of general subdivisions and the computation of voronoi diagrams. ACM Transactions on Graphics, 4(2):74\u2013123, 1985.","journal-title":"ACM Transactions on Graphics"},{"key":"10_CR7","unstructured":"M. J. Laszlo. A Data Structure for Manipulating Three-Dimensional Subdivisions. Technical Report CS-TR-125-87, Princeton University ComputerScience Department, 1987. thesis."},{"key":"10_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: an Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry: an Introduction. Springer-Verlag, New York, 1985."},{"key":"10_CR9","volume-title":"Output-size Sensitive Algorithms for Constructional Problems in Computational Geometry","author":"R. Seidel","year":"1987","unstructured":"R. Seidel. Output-size Sensitive Algorithms for Constructional Problems in Computational Geometry. PhD thesis, Cornell University, Ithaca, New York, January 1987."},{"issue":"2","key":"10_CR10","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1108\/eb010019","volume":"5","author":"M. Sever","year":"1986","unstructured":"M. Sever. Delaunay partitioning in three dimensions and semiconductor models. COMPEL, 5(2):75\u201393, 1986.","journal-title":"COMPEL"},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0196-6774(85)90017-3","volume":"6","author":"G. Swart","year":"1985","unstructured":"G. Swart. Finding the convex hull facet by facet. Journal of Algorithms, 6:17\u201348, 1985.","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Computational Geometry and its Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50335-8_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:54:48Z","timestamp":1619556888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50335-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540503354","9783540459750"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-50335-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}