Ming C. Lin
- 1 min read
- 2 chapters
Related on Lably
Through Robotics and Interactivity
Research
Lin is known for her work on collision detection, and in particular for the Lin–Canny algorithm for maintaining the closest pair of features of two moving objects, for the idea (with Cohen, Manocha, and Ponamgi) of using axis-aligned bounding boxes to quickly eliminate from consideration pairs of objects that are far from colliding, and for additional speedups to collision detection using bounding box hierarchies. Her software libraries implementing these algorithms are widely used in commercial applications including computer aided design and computer games. More generally, her research interests are in physically based modeling, haptics, robotics, 3D computer graphics, computational geometry, and interactive computer simulation.
Sign in to keep reading
One more chapter is free with a Lably account.
Biography
Lin did her undergraduate and graduate studies at the University of California, Berkeley before joining the UNC faculty in 1997. She is the Editor in Chief Emeritus of IEEE Transactions on Visualization and Computer Graphics (2011-2014). She is currently a member of the IEEE Computer Society Board of Governors and a member of Computing Research Association-Women (CRA-W) Board of Directors.
Lin is married to her frequent collaborator and UMD faculty colleague, Dinesh Manocha.