{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T17:42:45Z","timestamp":1743356565655,"version":"3.30.0"},"reference-count":18,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":7062,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Robotic Syst."],"published-print":{"date-parts":[[1996,5]]},"DOI":"10.1002\/(sici)1097-4563(199605)13:5<303::aid-rob4>3.0.co;2-u","type":"journal-article","created":{"date-parts":[[2002,8,25]],"date-time":"2002-08-25T19:48:59Z","timestamp":1030304939000},"page":"303-315","source":"Crossref","is-referenced-by-count":3,"title":["Computation of penetration between smooth convex objects in three-dimensional space"],"prefix":"10.1002","volume":"13","author":[{"given":"Chong Jin","family":"Ong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"10.1002\/(SICI)1097-4563(199605)13:5<303::AID-ROB4>3.0.CO;2-U-BIB1","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/0196-6774(85)90007-0","article-title":"A linear time algorithm for determinating the separation of convex polyhedra","volume":"6","author":"Dobkin","year":"1985","journal-title":"J. Algorithm"},{"key":"10.1002\/(SICI)1097-4563(199605)13:5<303::AID-ROB4>3.0.CO;2-U-BIB2","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0196-6774(85)90039-2","article-title":"Computing the extreme distances between two convex polygons","volume":"6","author":"Edelsbrunner","year":"1985","journal-title":"J. Algorithm"},{"key":"10.1002\/(SICI)1097-4563(199605)13:5<303::AID-ROB4>3.0.CO;2-U-BIB3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/JRA.1985.1087003","article-title":"Distance functions and their application to robot path planning in the presence of obstacles","volume":"RA-1","author":"Gilbert","year":"1985","journal-title":"IEEE. Trans. Rob. Autom."},{"key":"10.1002\/(SICI)1097-4563(199605)13:5<303::AID-ROB4>3.0.CO;2-U-BIB4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1109\/56.2083","article-title":"A fast procedure for computing the distance between complex objects in three dimensional space","volume":"RA-4","author":"Gilbert","year":"1988","journal-title":"IEEE Trans. Rob. Autom."},{"key":"10.1002\/(SICI)1097-4563(199605)13:5<303::AID-ROB4>3.0.CO;2-U-BIB5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/70.88117","article-title":"Computing the distance between general convex objects in 3-dimensional space","volume":"RA-6","author":"Gilbert","year":"1990","journal-title":"IEEE Trans. Rob. Autom."},{"issue":"3","key":"10.1002\/(SICI)1097-4563(199605)13:5<303::AID-ROB4>3.0.CO;2-U-BIB6","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1177\/027836498900800303","article-title":"A foundation for the flexible trajectory approach to numeric path planning","volume":"8","author":"Buckley","year":"1989","journal-title":"Int. J. Rob. Res."},{"key":"10.1002\/(SICI)1097-4563(199605)13:5<303::AID-ROB4>3.0.CO;2-U-BIB7","doi-asserted-by":"crossref","unstructured":"S. A. Cameron and R. K. Culley, \u201cDetermining the minimum translation distance between two convex polyhedra,\u201d Proc. IEEE Int. Conf. Rob. Autom., 1986, pp. 591-596.","DOI":"10.1109\/ROBOT.1986.1087645"},{"key":"10.1002\/(SICI)1097-4563(199605)13:5<303::AID-ROB4>3.0.CO;2-U-BIB8","unstructured":"S. S. Keerthi and K. Sridharan, \u201cMeasures of intensity of collision between convex objects and their efficient computation,\u201d Proc. Int. Conf. Intel. Rob., Bangalore, India, 1991, pp. 266-272."},{"key":"10.1002\/(SICI)1097-4563(199605)13:5<303::AID-ROB4>3.0.CO;2-U-BIB9","first-page":"2508","volume-title":"Proc. IEEE Int. Conf. Rob. Autom.","author":"Sancheti","year":"1992"},{"key":"10.1002\/(SICI)1097-4563(199605)13:5<303::AID-ROB4>3.0.CO;2-U-BIB10","doi-asserted-by":"crossref","unstructured":"E. G. Gilbert and C. J. Ong, \u201cNew distances for the separation and penetration of objects,\u201d Proc. IEEE Conf. Rob. Autom., San Diego, 1994, pp. 579-586.","DOI":"10.1109\/ROBOT.1994.351237"},{"key":"10.1002\/(SICI)1097-4563(199605)13:5<303::AID-ROB4>3.0.CO;2-U-BIB11","unstructured":"C. J. Ong and E. G. Gilbert, \u201cRobot path planning with penetration growth distance,\u201d Proc. IEEE Int. Conf. Rob. Autom., San Diego, 1994, pp. 2146-2152."},{"key":"10.1002\/(SICI)1097-4563(199605)13:5<303::AID-ROB4>3.0.CO;2-U-BIB12","doi-asserted-by":"crossref","unstructured":"E. Rimon and S. P. Boyd, \u201cEfficient distance computation using best ellipsoid fit,\u201d Proc. IEEE Int. Symp. Intel. Control, Glasgow, 1992, pp. 360-365.","DOI":"10.1109\/ISIC.1992.225116"},{"volume-title":"Convex Sets and their Applications","year":"1982","author":"Lay","key":"10.1002\/(SICI)1097-4563(199605)13:5<303::AID-ROB4>3.0.CO;2-U-BIB13"},{"issue":"1","key":"10.1002\/(SICI)1097-4563(199605)13:5<303::AID-ROB4>3.0.CO;2-U-BIB14","doi-asserted-by":"crossref","DOI":"10.1145\/2422.322418","article-title":"Linear programming in linear time when the dimension is fixed","volume":"31","author":"Megiddo","year":"1984","journal-title":"Journal of Association for Computing Machinery"},{"volume-title":"Practical Methods of Optimization","year":"1987","author":"Fletcher","key":"10.1002\/(SICI)1097-4563(199605)13:5<303::AID-ROB4>3.0.CO;2-U-BIB15"},{"volume-title":"Solution of the general nonlinear programming problem with subroutine VMCON","year":"1980","author":"Crane","key":"10.1002\/(SICI)1097-4563(199605)13:5<303::AID-ROB4>3.0.CO;2-U-BIB16"},{"key":"10.1002\/(SICI)1097-4563(199605)13:5<303::AID-ROB4>3.0.CO;2-U-BIB17","unstructured":"W. Murray, \u2018Algorithms for large nonlinear problems,\u2019 in Mathematical Programming, State of the Art 1994, Proc. Int. Symp. Math. Program., 1994, pp. 172-185."},{"volume-title":"Linear and Nonlinear Programming","year":"1984","author":"Luenberger","key":"10.1002\/(SICI)1097-4563(199605)13:5<303::AID-ROB4>3.0.CO;2-U-BIB18"}],"container-title":["Journal of Robotic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F(SICI)1097-4563(199605)13:5%3C303::AID-ROB4%3E3.0.CO;2-U","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/(SICI)1097-4563(199605)13:5%3C303::AID-ROB4%3E3.0.CO;2-U","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T16:01:07Z","timestamp":1733155267000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/(SICI)1097-4563(199605)13:5<303::AID-ROB4>3.0.CO;2-U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1996,5]]}},"URL":"https:\/\/doi.org\/10.1002\/(sici)1097-4563(199605)13:5<303::aid-rob4>3.0.co;2-u","relation":{},"ISSN":["0741-2223","1097-4563"],"issn-type":[{"type":"print","value":"0741-2223"},{"type":"electronic","value":"1097-4563"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}