{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T20:57:54Z","timestamp":1761512274471,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,6,6]],"date-time":"2006-06-06T00:00:00Z","timestamp":1149552000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,6,6]]},"DOI":"10.1145\/1128888.1128914","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"173-184","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Generalized penetration depth computation"],"prefix":"10.1145","author":[{"given":"Liangjun","family":"Zhang","sequence":"first","affiliation":[{"name":"University of North Carolina at Chapel Hill"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Young J.","family":"Kim","sequence":"additional","affiliation":[{"name":"Ewha Womans University, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gokul","family":"Varadhan","sequence":"additional","affiliation":[{"name":"University of North Carolina at Chapel Hill"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dinesh","family":"Manocha","sequence":"additional","affiliation":[{"name":"University of North Carolina at Chapel Hill"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,6,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009337"},{"key":"e_1_3_2_1_2_1","first-page":"227","article-title":"Penetration depth of two convex polytopes in 3d","volume":"7","author":"Agarwal P.","year":"2000","unstructured":"Agarwal , P. , Guibas , L. , Har-Peled , S. , Rabinovitch , A. , and Sharir , M. 2000 . Penetration depth of two convex polytopes in 3d . Nordic J. Computing 7 , 227 -- 240 . Agarwal, P., Guibas, L., Har-Peled, S., Rabinovitch, A., and Sharir, M. 2000. Penetration depth of two convex polytopes in 3d. Nordic J. Computing 7, 227--240.","journal-title":"Nordic J. Computing"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/70.864240"},{"key":"e_1_3_2_1_4_1","first-page":"5","article-title":"Polygon placement under translation and rotation","volume":"23","author":"Avnaim F.","year":"1989","unstructured":"Avnaim , F. , and Boissonnat , J. 1989 . Polygon placement under translation and rotation . In ITA , vol. 23 , 5 -- 28 . Avnaim, F., and Boissonnat, J. 1989. Polygon placement under translation and rotation. In ITA, vol. 23, 5--28.","journal-title":"ITA"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1997.606761"},{"key":"e_1_3_2_1_6_1","first-page":"1","article-title":"The polygon containment problem","volume":"1","author":"Chazelle B.","year":"1983","unstructured":"Chazelle , B. 1983 . The polygon containment problem . Advances in Computing Research 1 , 1 -- 33 . Chazelle, B. 1983. The polygon containment problem. Advances in Computing Research 1, 1--33.","journal-title":"Advances in Computing Research"},{"volume-title":"The 4th Israel-Korea Bi-National Conference on Geometric Modeling.","author":"Cohen-Or D.","key":"e_1_3_2_1_7_1","unstructured":"Cohen-Or , D. , Lev-Yehudi , S. , Karol , A. , and Tal , A . 2002. Inner-cover of non-convex shapes . In The 4th Israel-Korea Bi-National Conference on Geometric Modeling. Cohen-Or, D., Lev-Yehudi, S., Karol, A., and Tal, A. 2002. Inner-cover of non-convex shapes. In The 4th Israel-Korea Bi-National Conference on Geometric Modeling."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01190153"},{"volume-title":"Proc. of Eurographics.","author":"Ehmann S.","key":"e_1_3_2_1_9_1","unstructured":"Ehmann , S. , and Lin , M . 2001. Accurate and fast proximity queries between polyhedra using surface decomposition . In Proc. of Eurographics. Ehmann, S., and Lin, M. 2001. Accurate and fast proximity queries between polyhedra using surface decomposition. In Proc. of Eurographics."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/237170.237244"},{"key":"e_1_3_2_1_11_1","first-page":"368","article-title":"Containment of a single polygon using mathematical programming. In European Journal of Operational Research","volume":"92","author":"Grinde R.","year":"1996","unstructured":"Grinde , R. , and Cavalier , T. 1996 . Containment of a single polygon using mathematical programming. In European Journal of Operational Research , Elsevier Science , vol. 92 , 368 -- 386 . Grinde, R., and Cavalier, T. 1996. Containment of a single polygon using mathematical programming. In European Journal of Operational Research, Elsevier Science, vol. 92, 368--386.","journal-title":"Elsevier Science"},{"volume-title":"Handbook of Discrete and Computational Geometry, J. E. Goodman and J. O'Rourke, Eds","author":"Halperin D.","key":"e_1_3_2_1_12_1","unstructured":"Halperin , D. 1997. Arrangements . In Handbook of Discrete and Computational Geometry, J. E. Goodman and J. O'Rourke, Eds . CRC Press LLC , Boca Raton, FL , ch. 21, 389--412. Halperin, D. 1997. Arrangements. In Handbook of Discrete and Computational Geometry, J. E. Goodman and J. O'Rourke, Eds. CRC Press LLC, Boca Raton, FL, ch. 21, 389--412."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Halperin D. 2002. Robust geometric computing in motion. International Journal of Robotics Research 21(3).  Halperin D. 2002. Robust geometric computing in motion. International Journal of Robotics Research 21(3).","DOI":"10.1177\/027836402320556412"},{"key":"e_1_3_2_1_14_1","unstructured":"Halperin D. 2005. Private communication.  Halperin D. 2005. Private communication."},{"volume-title":"Proc. of 3rd Workshop on Algorithmic Foundations of Robotics, 25--32","author":"Hsu D.","key":"e_1_3_2_1_15_1","unstructured":"Hsu , D. , Kavraki , L. , Latombe , J. , Motwani , R. , and Sorkin , S . 1998. On finding narrow passages with probabilistic roadmap planners . Proc. of 3rd Workshop on Algorithmic Foundations of Robotics, 25--32 . Hsu, D., Kavraki, L., Latombe, J., Motwani, R., and Sorkin, S. 1998. On finding narrow passages with probabilistic roadmap planners. Proc. of 3rd Workshop on Algorithmic Foundations of Robotics, 25--32."},{"volume-title":"Proc. of Workshop on Algorithmic Foundations of Robotics.","author":"Kim Y. J.","key":"e_1_3_2_1_16_1","unstructured":"Kim , Y. J. , Lin , M. C. , and Manocha , D . 2002. Fast penetration depth computation using rasterization hardware and hierarchical refinement . Proc. of Workshop on Algorithmic Foundations of Robotics. Kim, Y. J., Lin, M. C., and Manocha, D. 2002. Fast penetration depth computation using rasterization hardware and hierarchical refinement. Proc. of Workshop on Algorithmic Foundations of Robotics."},{"volume-title":"Proc. IEEE International Conference on Robotics and Automation.","author":"Kim Y.","key":"e_1_3_2_1_17_1","unstructured":"Kim , Y. , Lin , M. , and Manocha , D . 2002. Deep: Dual-space expansion for estimating penetration depth between convex polytopes . In Proc. IEEE International Conference on Robotics and Automation. Kim, Y., Lin, M., and Manocha, D. 2002. Deep: Dual-space expansion for estimating penetration depth between convex polytopes. In Proc. IEEE International Conference on Robotics and Automation."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1162\/105474603765879530"},{"volume-title":"Effective sampling and distance metrics for 3d rigid body path planning","author":"Kuffner J.","key":"e_1_3_2_1_19_1","unstructured":"Kuffner , J. 2004. Effective sampling and distance metrics for 3d rigid body path planning . In IEEE Int'l Conf. on Robotics and Automation . Kuffner, J. 2004. Effective sampling and distance metrics for 3d rigid body path planning. In IEEE Int'l Conf. on Robotics and Automation."},{"volume-title":"Robot Motion Planning","author":"Latombe J.","key":"e_1_3_2_1_20_1","unstructured":"Latombe , J. 1991. Robot Motion Planning . Kluwer Academic Publishers . Latombe, J. 1991. Robot Motion Planning. Kluwer Academic Publishers."},{"volume-title":"Planning Algorithms","author":"Lavalle S. M.","key":"e_1_3_2_1_21_1","unstructured":"Lavalle , S. M. 2006. Planning Algorithms . Cambridge University Press ( also available at http:\/\/ms1.cs.uiuc.edu\/planning\/). to appear. Lavalle, S. M. 2006. Planning Algorithms. Cambridge University Press (also available at http:\/\/ms1.cs.uiuc.edu\/planning\/). to appear."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Lin M. and Manocha D. 2003. Collision and proximity queries. In Handbook of Discrete and Computational Geometry.  Lin M. and Manocha D. 2003. Collision and proximity queries. In Handbook of Discrete and Computational Geometry.","DOI":"10.1201\/9781420035315.ch35"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/383259.383263"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(98)00012-1"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(99)00006-1"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/344779.344866"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/142675.142737"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/304893.304965"},{"key":"e_1_3_2_1_29_1","article-title":"A fast method for local penetration depth computation","author":"Redon S.","year":"2005","unstructured":"Redon , S. , and Lin , M. 2005 . A fast method for local penetration depth computation . Journal of Graphical Tools. Redon, S., and Lin, M. 2005. A fast method for local penetration depth computation. Journal of Graphical Tools.","journal-title":"Journal of Graphical Tools."},{"key":"e_1_3_2_1_30_1","first-page":"269","article-title":"Mathematical definition of tolerance specifications","volume":"6","author":"Requicha A.","year":"1993","unstructured":"Requicha , A. 1993 . Mathematical definition of tolerance specifications . ASME Manufacturing Review 6 , 4, 269 -- 274 . Requicha, A. 1993. Mathematical definition of tolerance specifications. ASME Manufacturing Review 6, 4, 269--274.","journal-title":"ASME Manufacturing Review"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2004.838012"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0207(19960815)39:15<2673::AID-NME972>3.0.CO;2-I"},{"key":"e_1_3_2_1_33_1","volume-title":"Game Developers Conference.","author":"Van Den Bergen G.","year":"2001","unstructured":"Van Den Bergen , G. 2001 . Proximity queries and penetration depth computation on 3d game objects . Game Developers Conference. Van Den Bergen, G. 2001. Proximity queries and penetration depth computation on 3d game objects. Game Developers Conference."},{"volume-title":"Proc. of Robotics: Science and Systems.","author":"Varadhan G.","key":"e_1_3_2_1_34_1","unstructured":"Varadhan , G. , and Manocha , D . 2005. Star-shaped roadmaps - a determinstic sampling approach for complete motion planning . In Proc. of Robotics: Science and Systems. Varadhan, G., and Manocha, D. 2005. Star-shaped roadmaps - a determinstic sampling approach for complete motion planning. In Proc. of Robotics: Science and Systems."},{"key":"e_1_3_2_1_35_1","volume-title":"Tech. Rep. 06--006, Department of Computer Science","author":"Zhang L.","year":"2006","unstructured":"Zhang , L. , Kim , Y. , and Manocha , D . 2006 . A simple path non-existence algorithm for low dof robots. Tech. Rep. 06--006, Department of Computer Science , University of North Carolina at Chapel Hill. Zhang, L., Kim, Y., and Manocha, D. 2006. A simple path non-existence algorithm for low dof robots. Tech. Rep. 06--006, Department of Computer Science, University of North Carolina at Chapel Hill."},{"key":"e_1_3_2_1_36_1","volume-title":"IEEE International Conference on Robotics and Automation (ICRA","author":"Zhang L.","year":"2006","unstructured":"Zhang , L. , Kim , Y. , Varadhan , G. , and D. Manocha . 2006. Fast c-obstacle query computation for motion planning . In IEEE International Conference on Robotics and Automation (ICRA 2006 ). Zhang, L., Kim, Y., Varadhan, G., and D. Manocha. 2006. Fast c-obstacle query computation for motion planning. In IEEE International Conference on Robotics and Automation (ICRA 2006)."}],"event":{"name":"SPM06: 2006 ACM Symposium on Solid and Physical Modeling","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques"],"location":"Cardiff, Wales United Kingdom","acronym":"SPM06"},"container-title":["Proceedings of the 2006 ACM symposium on Solid and physical modeling"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1128888.1128914","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1128888.1128914","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:17Z","timestamp":1750259177000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1128888.1128914"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,6]]},"references-count":36,"alternative-id":["10.1145\/1128888.1128914","10.1145\/1128888"],"URL":"https:\/\/doi.org\/10.1145\/1128888.1128914","relation":{},"subject":[],"published":{"date-parts":[[2006,6,6]]},"assertion":[{"value":"2006-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}