{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:54:38Z","timestamp":1725512078240},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540792451"},{"type":"electronic","value":"9783540792468"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79246-8_10","type":"book-chapter","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T04:11:48Z","timestamp":1209442308000},"page":"127-142","source":"Crossref","is-referenced-by-count":0,"title":["Determining Directional Contact Range of Two Convex Polyhedra"],"prefix":"10.1007","author":[{"given":"Yi-King","family":"Choi","sequence":"first","affiliation":[]},{"given":"Xueqing","family":"Li","sequence":"additional","affiliation":[]},{"given":"Fengguang","family":"Rong","sequence":"additional","affiliation":[]},{"given":"Wenping","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Stephen","family":"Cameron","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0097-8493(00)00130-8","volume":"25","author":"P. Jim\u00e9nez","year":"2001","unstructured":"Jim\u00e9nez, P., Thomas, F., Torras, C.: 3D collision detection: a survey. Computers & Graphics\u00a025(2), 269\u2013285 (2001)","journal-title":"Computers & Graphics"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Lin, M.C., Manocha, D.: Collision and proximity queries. In: Handbook. of Discrete and Computational Geometry (2003)","DOI":"10.1201\/9781420035315.ch35"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Cameron, S., Culley, R.: Determining the minimum translational distance between two convex polyhedra. In: Proc. IEEE Int. Conf. on Robotics and Automation, pp. 591\u2013596 (1986)","DOI":"10.1109\/ROBOT.1986.1087645"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/56.2083","volume":"4","author":"E.G. Gilbert","year":"1988","unstructured":"Gilbert, E.G., Johnson, D.W., Keerthi, S.S.: A fast procedure for computing the distance between objects in three-dimensional space. IEEE J. Robot. Automat.\u00a0(4), 193\u2013203 (1988)","journal-title":"IEEE J. Robot. Automat."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Lin, M.C., Canny, J.: A fast algorithm for incremental distance calculation. In: Proc. IEEE Int. Conf. on Robotics and Automation, Sacremento, pp. 1008\u20131014 (April 1991)","DOI":"10.1109\/ROBOT.1991.131723"},{"issue":"3","key":"10_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1145\/285857.285860","volume":"17","author":"B. Mirtich","year":"1998","unstructured":"Mirtich, B.: V-Clip: Fast and robust polyhedral collision detection. ACM Trans. Graph.\u00a017(3), 177\u2013208 (1998)","journal-title":"ACM Trans. Graph."},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1109\/TVCG.2004.1260767","volume":"10","author":"Y.J. Kim","year":"2004","unstructured":"Kim, Y.J., Lin, M.C., Manocha, D.: Incremental penetration depth estimation between convex polytopes using dual-space expansion. IEEE Trans. Visual. Comput. Graphics\u00a010(2), 152\u2013163 (2004)","journal-title":"IEEE Trans. Visual. Comput. Graphics"},{"issue":"6","key":"10_CR8","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/BF01190153","volume":"9","author":"D.P. Dobkin","year":"1993","unstructured":"Dobkin, D.P., Hershberger, J., Kirkpatrick, D.G., Suri, S.: Computing the intersection-depth of polyhedra. Algorithmica\u00a09(6), 518\u2013533 (1993)","journal-title":"Algorithmica"},{"key":"10_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0046097","volume-title":"Efficient structures for geometric data management","author":"O. G\u00fcnther","year":"1988","unstructured":"G\u00fcnther, O.: Efficient structures for geometric data management. Springer, New York (1988)"},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/s003710050088","volume":"13","author":"I. Kolingerov\u00e1","year":"1997","unstructured":"Kolingerov\u00e1, I.: Convex polyhedron-line intersection detection using dual representation. The Visual Computer\u00a013(1), 42\u201349 (1997)","journal-title":"The Visual Computer"},{"key":"10_CR11","volume-title":"Convex Polytopes","author":"B. Gr\u00fcnbaum","year":"1967","unstructured":"Gr\u00fcnbaum, B.: Convex Polytopes. Wiley, Chichester (1967)"},{"issue":"3","key":"10_CR12","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/0196-6774(85)90007-0","volume":"6","author":"D.P. Dobkin","year":"1985","unstructured":"Dobkin, D.P., Kirkpatrick, D.G.: A linear algorithm for determining the separation of convex polyhedra. J. Algorithms\u00a06(3), 381\u2013392 (1985)","journal-title":"J. Algorithms"},{"key":"10_CR13","volume-title":"Projective and Related Geometry","author":"H. Levy","year":"1964","unstructured":"Levy, H.: Projective and Related Geometry. Macmillan, Basingstoke (1964)"}],"container-title":["Lecture Notes in Computer Science","Advances in Geometric Modeling and Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79246-8_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:14:56Z","timestamp":1619522096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79246-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540792451","9783540792468"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79246-8_10","relation":{},"subject":[]}}