{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:25:13Z","timestamp":1729653913855,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1109\/icra.2015.7138980","type":"proceedings-article","created":{"date-parts":[[2015,7,6]],"date-time":"2015-07-06T21:20:30Z","timestamp":1436217630000},"page":"57-62","source":"Crossref","is-referenced-by-count":2,"title":["PhongPD: Gradient-continuous penetration metric for polygonal models using Phong projection"],"prefix":"10.1109","author":[{"given":"Youngeun","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Young J.","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(99)00032-2"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360839"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2461912.2461935"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44985-X_29"},{"key":"ref13","article-title":"Proximity queries and penetration depth computation on 3d game objects","author":"bergen","year":"2001","journal-title":"Game Developers Conference"},{"key":"ref14","first-page":"921","article-title":"DEEP: an incremental algorithm for penetration depth computation between convex polytopes","author":"kim","year":"2002","journal-title":"Proceedings of IEEE International Conference on Robotics and Automation"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9219-6"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/545261.545266"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00312-7_25"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1236246.1236270"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2009.01.001"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1080\/2151237X.2006.10129216"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913478990"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1576246.1531380"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2012.6385741"},{"key":"ref6","first-page":"3743","article-title":"An efficient retraction-based rrt planner","author":"zhang","year":"2008","journal-title":"Proceedings IEEE International Conference on Robotics and Automation"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/b106657_6"},{"key":"ref5","first-page":"141","article-title":"On finding narrow passages with probabilistic roadmap planners","author":"hsu","year":"1998","journal-title":"Natick MA USA"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2077341.2077346"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.15607\/RSS.2007.III.034","article-title":"A fast and practical algorithm for generalized penetration depth computation","author":"zhang","year":"2007","journal-title":"Proceedings of Robotics Science and Systems Conference"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01190153"},{"key":"ref9","article-title":"Continuous penetration depth","author":"zhang","year":"2013","journal-title":"SIAM Geometric and Physics Modeling"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1986.1087645"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2517108"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1994.351237"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2508363.2508305"},{"key":"ref24","doi-asserted-by":"crossref","DOI":"10.15607\/RSS.2009.V.010","article-title":"Inner sphere trees for proximity and penetration queries","volume":"2","author":"weller","year":"2009","journal-title":"Robotics Science and Systems"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/70.544772","article-title":"Growth distances: new measures for object separation and penetration","volume":"12","author":"ong","year":"1996","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"1144","DOI":"10.1145\/1141911.1142006","article-title":"Fast proximity computation among deformable models using discrete voronoi diagrams","volume":"25","author":"sud","year":"2006","journal-title":"ACM Trans Graphics (Proceedings of SIGGRAPH 2004)"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1833349.1778819"}],"event":{"name":"2015 IEEE International Conference on Robotics and Automation (ICRA)","start":{"date-parts":[[2015,5,26]]},"location":"Seattle, WA, USA","end":{"date-parts":[[2015,5,30]]}},"container-title":["2015 IEEE International Conference on Robotics and Automation (ICRA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7128761\/7138973\/07138980.pdf?arnumber=7138980","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T01:27:27Z","timestamp":1566955647000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7138980\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/icra.2015.7138980","relation":{},"subject":[],"published":{"date-parts":[[2015,5]]}}}