{"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":1725663203185},"publisher-location":"Berlin, Heidelberg","reference-count":13,"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_34","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:21:19Z","timestamp":1330201279000},"page":"180-186","source":"Crossref","is-referenced-by-count":6,"title":["On the detection of a common intersection of \u03ba convex polyhedra"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Reichling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.; Komlos, J; Szemeredi, E.: An O(n log n) Sorting Network, Proc. 15th Annual ACM Symposium on Theory of Computing 1983, 1\u20139.","DOI":"10.1145\/800061.808726"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Chazelle, Bernard; Dobkin, David P.: Detection is easier than computation, Proc. 12th Annual ACM Symposium on Theory of Computing 1980, 146\u2013153.","DOI":"10.1145\/800141.804662"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/7531.24036","volume":"34","author":"B. Chazelle","year":"1987","unstructured":"Chazelle, Bernard; Dobkin, David P.: Intersection of Convex Objects in Two and Three Dimensions, Journal of the ACM 34 (1987), 1\u201327.","journal-title":"Journal of the ACM"},{"key":"15_CR4","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1145\/7531.7537","volume":"34","author":"R. Cole","year":"1987","unstructured":"Cole, Richard: Slowing Down Sorting Networks to Obtain Faster Sorting Algorithms, Journal of the ACM 34 (1987), 200\u2013208.","journal-title":"Journal of the ACM"},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0020-0190(85)90080-8","volume":"20","author":"R. Cole","year":"1985","unstructured":"Cole, Richard; Yap, Chee K.: A parallel median algorithm, Information Processing Letters 20 (1985), 137\u2013139.","journal-title":"Information Processing Letters"},{"key":"15_CR6","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0304-3975(82)90120-7","volume":"27","author":"D. P. Dobkin","year":"1983","unstructured":"Dobkin, David P.; Kirkpatrick, David G.: Fast detection of polyhedral intersection, Theoretical Computer Science 27 (1983), 241\u2013253.","journal-title":"Theoretical Computer Science"},{"key":"15_CR7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/0213003","volume":"13","author":"M. E. Dyer","year":"1984","unstructured":"Dyer, M. E.: Linear time algorithms for two-and three-variable linear programs, SIAM Journal on Computing 13 (1984), 31\u201345.","journal-title":"SIAM Journal on Computing"},{"key":"15_CR8","first-page":"175","volume":"32","author":"E. Helly","year":"1923","unstructured":"Helly, Ed.: \u00dcber Mengen konvexer K\u00f6rper mit gemeinschaftlichen Punkten, Jahresbericht der Deutschen Mathematiker-Vereinigung 32 (1923), 175\u2013176.","journal-title":"Jahresbericht der Deutschen Mathematiker-Vereinigung"},{"key":"15_CR9","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, Nimrod: Applying Parallel Computation Algorithms in the Design of Serial Algorithms, Journal of the ACM 30 (1983), 852\u2013865.","journal-title":"Journal of the ACM"},{"key":"15_CR10","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, Nimrod: Linear-time algorithms for linear programming in \u211d3and related problems, SIAM Journal of Computing 12 (1983), 759\u2013776.","journal-title":"SIAM Journal of Computing"},{"key":"15_CR11","unstructured":"Reichling, Matthias: Entdeckung eines gemeinsamen Schnitts von k konvexen Objekten (On the detection of a common intersection of k convex objects), PhD-thesis, W\u00fcrzburg 1987 (in German)."},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Reichling, Matthias: On the detection of a common intersection of k convex objects in the plane, Information Processing Letters, to appear.","DOI":"10.1016\/0020-0190(88)90127-5"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Shamos, Michael Ian: Geometric Complexity, Proc. 7th Annual ACM Symposium on Theory of Computing 1975, 224\u2013233.","DOI":"10.1145\/800116.803772"}],"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_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:17:56Z","timestamp":1605647876000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50335-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540503354","9783540459750"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-50335-8_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}