{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:51Z","timestamp":1725663771415},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_258","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:06:09Z","timestamp":1330257969000},"page":"314-324","source":"Crossref","is-referenced-by-count":10,"title":["A complete and efficient algorithm for the intersection of a general and a convex polyhedron"],"prefix":"10.1007","author":[{"given":"Katrin","family":"Dobrindt","sequence":"first","affiliation":[]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[]},{"given":"Mariette","family":"Yvinec","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"H. Bieri and W. Nef. Elementary set operations with d-dimensional polyhedra. In Computational Geometry and its Applications, volume 333 of Lecture Notes in Computer Science, pages 97\u2013112. Springer-Verlag, 1988.","DOI":"10.1007\/3-540-50335-8_28"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"D. P. Dobkin and D. G. Kirkpatrick. Fast detection of polyhedral intersection. In Proc. 9th Internat. Colloq. Automata Lang. Program., volume 140 of Lecture Notes in Computer Science, pages 154\u2013165. Springer-Verlag, 1982.","DOI":"10.1007\/BFb0012765"},{"key":"30_CR3","unstructured":"K. Dobrindt. Algorithmen f\u00fcr Polyeder. Master's thesis, Fachbereich Informatik, Universit\u00e4t des Saarlandes, June 1990."},{"key":"30_CR4","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0020-0190(85)90107-3","volume":"21","author":"H. Edelsbrunner","year":"1985","unstructured":"H. Edelsbrunner and H. Maurer. Finding extreme points in three dimensions and solving the post office problem in the plane. Information Processing Letters, 21:39\u201347, 1985.","journal-title":"Information Processing Letters"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/77635.77639","volume":"9","author":"H. Edelsbrunner","year":"1990","unstructured":"H. Edelsbrunner and E.P. M\u00fccke. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics, 9:66\u2013104, 1990.","journal-title":"ACM Transactions on Graphics"},{"key":"30_CR6","volume-title":"Geometric and Solid Modeling","author":"C.H. Hoffmann","year":"1989","unstructured":"C.H. Hoffmann. Geometric and Solid Modeling. Morgan Kaufmann, San Mateo, Calif., 1989."},{"key":"30_CR7","volume-title":"An Introduction to Solid Modeling","author":"M. M\u00e4ntyl\u00e4","year":"1988","unstructured":"M. M\u00e4ntyl\u00e4. An Introduction to Solid Modeling. Computer Science Press, Rockville, Md., 1988."},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn. Data Structures and Efficient Algorithms. Springer Verlag, 1984.","DOI":"10.1007\/978-3-642-69672-5"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn and K. Simon. Intersecting two polyhedra one of which is convex. In Proc. Found. Gomput. Theory, volume 199 of Lecture Notes in Computer Science, pages 534\u2013542. Springer-Verlag, 1985.","DOI":"10.1007\/BFb0028837"},{"key":"30_CR10","unstructured":"W. Nef. Beitr\u00e4ge zur Theorie der Polyeder. Herbert Lang Bern, 1978."},{"key":"30_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. Preparata","year":"1985","unstructured":"F. Preparata and M.I. Shamos. Computational Geometry: An Introduction. Springer, New York Berlin Heidelberg Tokyo, 1985."},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1145\/356827.356833","volume":"12","author":"A.A.G. Requicha","year":"1980","unstructured":"A.A.G. Requicha. Representations for rigid solids: Theory, methods, and systems. ACM Computing Surveys, 12:437\u2013464, 1980.","journal-title":"ACM Computing Surveys"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_258.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:19Z","timestamp":1605647299000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_258"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_258","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}