{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:45:01Z","timestamp":1755218701677,"version":"3.43.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1999,8,1]],"date-time":"1999-08-01T00:00:00Z","timestamp":933465600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,8,1]],"date-time":"1999-08-01T00:00:00Z","timestamp":933465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Reliable Computing"],"published-print":{"date-parts":[[1999,8]]},"DOI":"10.1023\/a:1009924204609","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T19:25:11Z","timestamp":1040585111000},"page":"241-253","source":"Crossref","is-referenced-by-count":4,"title":["An Accurate Distance-Calculation Algorithm for Convex Polyhedra"],"prefix":"10.1007","volume":"5","author":[{"given":"Eva","family":"Dyllong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfram","family":"Luther","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Werner","family":"Otten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"244234_CR1","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1177\/027836498900800304","volume":"8","author":"J. E. Bobrow","year":"1989","unstructured":"Bobrow, J. E.: A Direct Minimization Approach for Obtaining the Distance Between Convex Polyhedra, The International Journal of Robotics Research\n8(3) (1989), pp. 65\u201376.","journal-title":"The International Journal of Robotics Research"},{"issue":"4","key":"244234_CR2","first-page":"345","volume":"16","author":"L. Chen","year":"1994","unstructured":"Chen, Liang, Huang, Wen Qi, and Song, En Min: A Fast Algorithm for Computing the Distance between Two Convex Polyhedra, Math. J. Chinese Univ.\n16(4) (1994), pp. 345\u2013359.","journal-title":"Math. J. Chinese Univ."},{"key":"244234_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1007\/BFb0032047","volume-title":"Automata, Languages and Programming","author":"D. Dobkin","year":"1990","unstructured":"Dobkin, D. and Kirkpatrick, D.: Determining the Separation of Preprocessed Polyhedra\u2014A Unified Approach, in: Automata, Languages and Programming (Coventry, 1990), Lecture Notes in Computer Science\n443, Springer, New York, 1990, pp. 400\u2013413."},{"issue":"6","key":"244234_CR4","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1007\/BF01190153","volume":"9","author":"D. Dobkin","year":"1993","unstructured":"Dobkin, D., Hershberger, J., Kirkpatrick, D., and Suri, S.: Computing the Intersection-Depth of Polyhedra, Algorithmica\n9(6) (1993), pp. 528\u2013533.","journal-title":"Algorithmica"},{"key":"244234_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"Edelsbrunner, H.: Algorithms in Combinatorial Geometry, Springer, Berlin, 1987."},{"issue":"2","key":"244234_CR6","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1109\/56.2083","volume":"4","author":"E. G. Gilbert","year":"1988","unstructured":"Gilbert, E. G., Johnson, D. W., and Keerthi S. S.: A Fast Procedure for Computing the Distance Between Complex Objects in Three-Dimensional Space, IEEE Journal of Robotics and Automation\n4(2) (1988), pp. 193\u2013203.","journal-title":"IEEE Journal of Robotics and Automation"},{"key":"244234_CR7","doi-asserted-by":"crossref","unstructured":"Kulisch, U. (Hrsg.): Wissenschaftliches Rechnen mit Ergebnisverifikation\u2014Eine Einf\u00fchrung, Akademie-Verlag Berlin und Vieweg-Verlag Wiesbaden, 1989.","DOI":"10.1515\/9783112576229"},{"key":"244234_CR8","unstructured":"Quinlan, S.: Efficient Distance Computation Between Non-Convex Objects, in: IEEE Intern. Conf. on Robotics and Automation, 1994, pp. 3324\u20133329."},{"key":"244234_CR9","doi-asserted-by":"crossref","unstructured":"Sato, Y., Hirata, M., Maruyama, T., and Arita, Y.: Efficient Collision Detection Using Fast Distance-Calculation Algorithms for Convex and Non-Convex Objects, in: Proc. IEEE Intern. Conf. on Robotics and Automation, Minneapolis, Minnesota, 1996, pp. 771\u2013778.","DOI":"10.1109\/ROBOT.1996.503867"},{"key":"244234_CR10","unstructured":"Werner, K.: Verifizierte Berechnung der inversen Weierstra\u03b2-Funktion und der elliptischen Funktion von Jacobi in beliebigen Maschinenarithmetiken, PhD-Thesis, Duisburg, 1996."}],"container-title":["Reliable Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009924204609.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009924204609\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009924204609.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T09:31:10Z","timestamp":1754472670000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009924204609"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,8]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,8]]}},"alternative-id":["244234"],"URL":"https:\/\/doi.org\/10.1023\/a:1009924204609","relation":{},"ISSN":["1385-3139","1573-1340"],"issn-type":[{"type":"print","value":"1385-3139"},{"type":"electronic","value":"1573-1340"}],"subject":[],"published":{"date-parts":[[1999,8]]}}}