{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T02:50:12Z","timestamp":1648695012771},"reference-count":18,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Graphics"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0097-8493(02)00133-4","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T19:24:03Z","timestamp":1034018643000},"page":"785-793","source":"Crossref","is-referenced-by-count":1,"title":["Efficient computation of a measure of depth between convex objects for graphics applications"],"prefix":"10.1016","volume":"26","author":[{"given":"K.","family":"Sridharan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0097-8493(02)00133-4_BIB1","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 Transactions on Robotics and Automation"},{"key":"10.1016\/S0097-8493(02)00133-4_BIB2","doi-asserted-by":"crossref","unstructured":"Gilbert EG, Hong SM. A new algorithm for detecting the collision of moving objects. In: Proceedings of the IEEE International Conference on Robotics and Automation. 1989. p. 8\u201314.","DOI":"10.1109\/ROBOT.1989.99960"},{"key":"10.1016\/S0097-8493(02)00133-4_BIB3","doi-asserted-by":"crossref","unstructured":"Cameron SA. A study of the clash detection problem in robotics. In: Proceedings of the IEEE International Conference on Robotics and Automation, 1985. p. 488\u201393.","DOI":"10.1109\/ROBOT.1985.1087245"},{"key":"10.1016\/S0097-8493(02)00133-4_BIB4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/S0097-8493(00)00130-8","article-title":"3D collision detection","volume":"25","author":"Jimenez","year":"2001","journal-title":"Computers and Graphics"},{"key":"10.1016\/S0097-8493(02)00133-4_BIB5","unstructured":"Buckley CE, Leifer LJ. A proximity metric for continuum path planning. In: Proceedings of Ninth International Conference on Artificial Intelligence. 1985. p. 1096\u2013102."},{"key":"10.1016\/S0097-8493(02)00133-4_BIB6","doi-asserted-by":"crossref","unstructured":"Cameron SA, Culley RK. Determining the minimum translational distance between two convex polyhedra. In: Proceedings of the IEEE International Conference on Robotics and Automation. 1986. p. 591\u20136.","DOI":"10.1109\/ROBOT.1986.1087645"},{"key":"10.1016\/S0097-8493(02)00133-4_BIB7","doi-asserted-by":"crossref","unstructured":"Sancheti NK, Keerthi SS. Computation of certain measures of proximity between convex polytopes: a complexity viewpoint. In: Proceedings of IEEE International Conference on Robotics and Automation. 1992. p. 2508\u201313.","DOI":"10.1109\/ROBOT.1992.220064"},{"key":"10.1016\/S0097-8493(02)00133-4_BIB8","unstructured":"Keerthi SS, Sridharan K. Measures of intensity of collision between convex objects and their efficient computation. In: Proceedings of the International Symposium on Intelligent Robotics. 1991. p. 266\u201375."},{"key":"10.1016\/S0097-8493(02)00133-4_BIB9","doi-asserted-by":"crossref","unstructured":"Gilbert EG, Ong CJ. New distances for the separation and penetration of objects. In: Proceedings of the IEEE International Conference on Robotics and Automation. 1994. p. 579\u201386.","DOI":"10.1109\/ROBOT.1994.351237"},{"key":"10.1016\/S0097-8493(02)00133-4_BIB10","first-page":"227","article-title":"Penetration depth of two convex polytopes in 3D","volume":"7","author":"Agarwal","year":"2000","journal-title":"Nordic Journal of Computing"},{"key":"10.1016\/S0097-8493(02)00133-4_BIB11","unstructured":"Sridharan K, Subramanian CR, Sudha N. Properties of touching distances between planar objects. In: Volumes of Abstracts for International Symposium on Intelligent Robotic Systems. 1998. p. 153\u20136."},{"issue":"2","key":"10.1016\/S0097-8493(02)00133-4_BIB12","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/TC.1983.1676196","article-title":"Spatial planning","volume":"C-32","author":"Lozano-P\u00e8rez","year":"1983","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0097-8493(02)00133-4_BIB13","doi-asserted-by":"crossref","first-page":"114","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 the ACM"},{"key":"10.1016\/S0097-8493(02)00133-4_BIB14","series-title":"Parallel computation: models and methods","author":"Akl","year":"1997"},{"key":"10.1016\/S0097-8493(02)00133-4_BIB15","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/174652.174661","article-title":"Parallel linear programming in fixed dimension almost surely in constant time","volume":"41","author":"Alon","year":"1994","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0097-8493(02)00133-4_BIB16","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1137\/S0097539792234858","article-title":"A deterministic poly(loglogn)-time n-processor algorithm for linear programming in fixed dimension","volume":"25","author":"Ajtai","year":"1996","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0097-8493(02)00133-4_BIB17","doi-asserted-by":"crossref","unstructured":"Dyer M. A parallel algorithm for linear programming in fixed dimension. In: Proceedings of the ACM Symposium on Computational Geometry. 1995. p. 345\u20139.","DOI":"10.1145\/220279.220316"},{"key":"10.1016\/S0097-8493(02)00133-4_BIB18","unstructured":"Sen S. A deterministic poly(loglogn) time CRCW PRAM algorithm for linear programming in fixed dimensions. Technical Report TR-95-08, Australia: University of Newcastle, 1995."}],"container-title":["Computers & Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097849302001334?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097849302001334?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T02:26:11Z","timestamp":1554776771000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0097849302001334"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0097849302001334"],"URL":"https:\/\/doi.org\/10.1016\/s0097-8493(02)00133-4","relation":{},"ISSN":["0097-8493"],"issn-type":[{"value":"0097-8493","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}