{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T06:16:54Z","timestamp":1725689814292},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642073410"},{"type":"electronic","value":"9783540450580"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-45058-0_30","type":"book-chapter","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T15:51:48Z","timestamp":1340812308000},"page":"505-521","source":"Crossref","is-referenced-by-count":1,"title":["Fast Penetration Depth Estimation Using Rasterization Hardware and Hierarchical Refinement"],"prefix":"10.1007","author":[{"given":"Young J.","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming C.","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dinesh","family":"Manocha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","first-page":"227","volume":"7","author":"P. Agarwal","year":"2000","unstructured":"P. Agarwal, L. J. Guibas, S. Har-Peled, A. Rabinovitch, and M. Sharir. Penetration depth of two convex polytopes in 3D. Nordic J. Computing, 7: 227\u2013240, 2000.","journal-title":"Nordic J. Computing"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"1670","DOI":"10.1137\/S0097539793250755","volume":"26","author":"B. Aronov","year":"1997","unstructured":"Boris Aronov, Micha Sharir, and Boaz Tagansky. The union of convex polyhedra in three dimensions. SIAM J. Comput., 26:1670\u20131688, 1997.","journal-title":"SIAM J. Comput"},{"key":"30_CR3","volume-title":"The Geometry Center","author":"B. Barber","year":"1993","unstructured":"B. Barber, D. Dobkin, and H. Huhdanpaa. The quickhull algorithm for convex hull. Technical Report GCG53, The Geometry Center, MN, 1993."},{"key":"30_CR4","volume-title":"Game Developers Conference","author":"G. Bergen","year":"2001","unstructured":"G. Bergen. Proximity queries and penetration depth computation on 3D game objects. Game Developers Conference, 2001."},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"3112","DOI":"10.1109\/ROBOT.1997.606761","volume-title":"Proceedings of International Conference on Robotics and Automation","author":"S. Cameron","year":"1997","unstructured":"S. Cameron. Enhancing GJK: Computing minimum and penetration distance between convex polyhedra. Proceedings of International Conference on Robotics and Automation, pages 3112\u20133117, 1997."},{"key":"30_CR6","first-page":"591","volume-title":"Proceedings of International Conference on Robotics and Automation","author":"S. Cameron","year":"1986","unstructured":"S. Cameron and R. K. Culley. Determining the minimum translational distance between two convex polyhedra. Proceedings of International Conference on Robotics and Automation, pages 591\u2013596, 1986."},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0925-7721(96)00024-7","volume":"7","author":"B. Chazelle","year":"1997","unstructured":"Bernard Chazelle, D. Dobkin, N. Shouraboura, and A. Tal. Strategies for polyhedral surface decomposition: An experimental study. Comput. Geom. Theory Appl, 7: 327\u2013342, 1997.","journal-title":"Comput. Geom. Theory Appl"},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/BF01190153","volume":"9","author":"D. Dobkin","year":"1993","unstructured":"D. Dobkin, J. Hershberger, D. Kirkpatrick, and Subhash Suri. Computing the intersection-depth of polyhedra. Algorithmica, 9: 518\u2013533, 1993.","journal-title":"Algorithmica"},{"key":"30_CR9","first-page":"20","volume-title":"Computer Graphics Forum (Proc. of Eurographics\u20192001)","author":"S. Ehmann","year":"2001","unstructured":"S. Ehmann and M. C. Lin. Accurate and fast proximity queries between polyhedra using convex surface decomposition. Computer Graphics Forum (Proc. of Eurographics\u20192001), 20 (3), 2001.","edition":"3"},{"key":"30_CR10","volume-title":"Proc. of EG Workshop on Computer Animation and Simulation","author":"S. Fisher","year":"2001","unstructured":"S. Fisher and M. C. Lin. Deformed distance fields for simulation of nonpenetrating flexible bodies. Proc. of EG Workshop on Computer Animation and Simulation, 2001."},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/258734.258849","volume-title":"Proc. of ACM SIGGRAPH","author":"M. Garland","year":"1997","unstructured":"M. Garland and P. Heckbert. Surface simplification using quadric error bounds. Proc. of ACM SIGGRAPH, pages 209\u2013216, 1997."},{"key":"30_CR12","volume-title":"Proc. of IEEE Visualization Conference","author":"A. Gregory","year":"2000","unstructured":"A. Gregory, A. Mascarenhas, S. Ehmann, M. C. Lin, and D. Manocha. 6-DOF haptic display of polygonal models. Proc. of IEEE Visualization Conference, 2000."},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF02187878","volume":"2","author":"L. Guibas","year":"1987","unstructured":"L. Guibas and R. Seidel. Computing convolutions by reciprocal search. Discrete Comput. Geom, 2: 175\u2013193, 1987.","journal-title":"Discrete Comput. Geom"},{"key":"30_CR14","volume-title":"Proc. of ACM Symposium on Interactive 3D Graphics","author":"K. Hoff","year":"2001","unstructured":"K. Hoff, A. Zaferakis, M. Lin, and D. Manocha. Fast and simple geometric proximity queries using graphics hardware. Proc. of ACM Symposium on Interactive 3D Graphics, 2001."},{"key":"30_CR15","volume-title":"Proc. of 3rd Workshop on Algorithmic Foundations of Robotics","author":"D. Hsu","year":"1998","unstructured":"D. Hsu, L. Kavraki, J. Latombe, R. Motwani, and S. Sorkin. On finding narrow passages with probabilistic roadmap planners. Proc. of 3rd Workshop on Algorithmic Foundations of Robotics, 1998."},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0097-8493(92)90077-9","volume":"16","author":"A. Kaul","year":"1992","unstructured":"A. Kaul and J. Rossignac. Solid-interpolating deformations: construction and animation of PIPS. Computer and Graphics, 16: 107\u2013116, 1992.","journal-title":"Computer and Graphics"},{"key":"30_CR17","volume-title":"Journal of Graphics Tools","author":"Y. Kim","year":"2003","unstructured":"Y. Kim, K. Hoff, M. Lin, and D. Manocha. Closest point query among the union of convex polytopes using rasterization hardware. Journal of Graphics Tools, 2003. to appear."},{"key":"30_CR18","volume-title":"IEEE Conference on Robotics and Automation","author":"Y. Kim","year":"2002","unstructured":"Y. Kim, M. Lin, and D. Manocha. DEEP: Dual-space Expansion for Estimating Penetration depth between convex polytopes. In IEEE Conference on Robotics and Automation, 2002."},{"key":"30_CR19","volume-title":"ACM Symposium on Computer Animation","author":"Y. Kim","year":"2002","unstructured":"Y. Kim, M. Otaduy, M. Lin, and D. Manocha. Fast penetration depth computation for physically-based animation. In ACM Symposium on Computer Animation, 2002."},{"key":"30_CR20","volume-title":"UNC-Chapel Hill TR02-014","author":"Y. Kim","year":"2002","unstructured":"Y. Kim, M. Otaduy, M. Lin, and D. Manocha. Fast penetration depth computation using rasterization hardware and hierarchical refinement. Technical report, UNC-Chapel Hill TR02\u2013014, 2002."},{"key":"30_CR21","volume-title":"ACM-SIAM Symposium on Discrete Algorithms","author":"S. Krishnan","year":"2002","unstructured":"S. Krishnan, N. Mustafa, and S. Venkatasubramanian. Hardware-assisted computation of depth contours. In ACM-SIAM Symposium on Discrete Algorithms, 2002."},{"key":"30_CR22","volume-title":"Proc. of IMA Conference on Mathematics of Surfaces","author":"M. Lin","year":"1998","unstructured":"M. Lin and S. Gottschalk. Collision detection between geometric models: A survey. In Proc. of IMA Conference on Mathematics of Surfaces, 1998."},{"key":"30_CR23","first-page":"1008","volume-title":"IEEE Conference on Robotics and Automation","author":"M.C. Lin","year":"1991","unstructured":"M.C. Lin and John F. Canny. Efficient algorithms for incremental distance computation. In IEEE Conference on Robotics and Automation, pages 1008\u20131014, 1991."},{"key":"30_CR24","first-page":"29","volume-title":"Computer Graphics (SIGGRAPH 90 Proceedings)","author":"M. Mckenna","year":"1990","unstructured":"Michael McKenna and David Zeltzer. Dynamic simulation of autonomous legged locomotion. In Forest Baskett, editor, Computer Graphics (SIGGRAPH \u201880 Proceedings), volume 24, pages 29\u201338, August 1990.","edition":"volume 24"},{"key":"30_CR25","first-page":"401","volume-title":"Proc. of ACM SIGGRAPH","author":"W. Mcneely","year":"1999","unstructured":"W. McNeely, K. Puterbaugh, and J. Troy. Six degree-of-freedom haptic rendering using voxel sampling. Proc. of ACM SIGGRAPH, pages 401\u2013408, 1999."},{"key":"30_CR26","volume-title":"Proc. of ACM SIGGRAPH","author":"B. Mirtich","year":"2000","unstructured":"B. Mirtich. Timewarp rigid body simulation. Proc. of ACM SIGGRAPH, 2000."},{"key":"30_CR27","first-page":"12","volume-title":"IEEE Transactions on Robotics and Automation","author":"C. J. Ong","year":"1996","unstructured":"C. J. Ong and E.G. Gilbert. Growth distances: New measures for object separation and penetration. IEEE Transactions on Robotics and Automation, 12 (6), 1996.","edition":"6"},{"key":"30_CR28","volume-title":"Tracings and Their Convolution: Theory and Applications","author":"G. D. Ramkumar","year":"1998","unstructured":"G. D. Ramkumar. Tracings and Their Convolution: Theory and Applications. PhD thesis, Standford, March 1998."},{"issue":"4","key":"30_CR29","first-page":"269","volume":"6","author":"A.A.G. Requicha","year":"1993","unstructured":"A.A.G. Requicha. Mathematical definition of tolerance specifications. ASME Manufacturing Review, 6 (4): 269\u2013274, 1993.","journal-title":"ASME Manufacturing Review"},{"key":"30_CR30","doi-asserted-by":"publisher","first-page":"2673","DOI":"10.1002\/(SICI)1097-0207(19960815)39:15<2673::AID-NME972>3.0.CO;2-I","volume":"39","author":"D. E. Stewart","year":"1996","unstructured":"D. E. Stewart and J. C. Trinkle. An implicit time-stepping scheme for rigid body dynamics with inelastic collisions and coulomb friction. International Journal of Numerical Methods in Engineering, 39: 2673\u20132691, 1996.","journal-title":"International Journal of Numerical Methods in Engineering"},{"key":"30_CR31","volume-title":"Proc. of 9th International Conference on Computer Graphics, Visualization and Computer Vision, WSCG","author":"T. Theoharis","year":"2001","unstructured":"T. Theoharis, G. Papaiannou, and E. Karabassi. The magic of the Z-buffer: A survey. Proc. of 9th International Conference on Computer Graphics, Visualization and Computer Vision, WSCG, 2001."}],"container-title":["Springer Tracts in Advanced Robotics","Algorithmic Foundations of Robotics V"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45058-0_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T17:12:16Z","timestamp":1556903536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45058-0_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783642073410","9783540450580"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45058-0_30","relation":{},"ISSN":["1610-7438","1610-742X"],"issn-type":[{"type":"print","value":"1610-7438"},{"type":"electronic","value":"1610-742X"}],"subject":[],"published":{"date-parts":[[2004]]}}}