%0 Journal Article %1 journals/cgf/EhmannL01 %A Ehmann, Stephen A. %A Lin, Ming C. %D 2001 %J Comput. Graph. Forum %K dblp %N 3 %P 500-511 %T Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition. %U http://dblp.uni-trier.de/db/journals/cgf/cgf20.html#EhmannL01 %V 20

@article{journals/cgf/EhmannL01, added-at = {2012-04-14T00:00:00.000+0200}, author = {Ehmann, Stephen A. and Lin, Ming C.}, biburl = {https://www.bibsonomy.org/bibtex/22f42631d24da2bc380541165e81da0b9/dblp}, ee = {http://dx.doi.org/10.1111/1467-8659.00543}, interhash = {34106a2f3f3aa526779da59b1b573931}, intrahash = {2f42631d24da2bc380541165e81da0b9}, journal = {Comput. Graph. Forum}, keywords = {dblp}, number = 3, pages = {500-511}, timestamp = {2012-04-17T12:03:55.000+0200}, title = {Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition.}, url = {http://dblp.uni-trier.de/db/journals/cgf/cgf20.html#EhmannL01}, volume = 20, year = 2001 }