Ming C. Lin

Lin was born in Taiwan. Her family immigrated to the United States in 1980 and settled in California, where she attended Sunny Hills High School. After high school, she graduated from the University of California, Berkeley, with a Bachelor of Science (B.S.) in 1988, a Master of Science (M.S.) in 1991, and a Ph.D. in computer science and electrical engineering in 1993. She joined the UNC faculty in 1997. == Career ==

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. 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. == Awards and honors ==

In 2003, UNC gave Lin their Hettleman Prize for Scholarly and Artistic Achievements, and in 2007, she was named as the Beverly W. Long Distinguished Professor. In 2011 she was listed as a fellow of the Association for Computing Machinery for her research in geometric modeling and computer graphics, and she was listed as one of the 2012 IEEE Fellows for her "contributions to real-time physics-based interaction and simulation for virtual environments, robotics and haptics". == Personal life ==

Lin is married to her frequent collaborator and UMD faculty colleague, Dinesh Manocha. == References ==