He earned a master's degree from the Indian Institute of Science Bangalore in 1987, and completed his Ph.D. at Purdue University in 1991.
[4] After postdoctoral research with Herbert Edelsbrunner at the University of Illinois at Urbana–Champaign, Dey joined the Purdue faculty in 1992.
[3][2] Dey is known for proving the tightest-known upper bounds on the k-set problem[5] and for his work on 3D reconstruction and computational topology.
[citation needed] He is the author of the book Curve and Surface Reconstruction: Algorithms with Mathematical Analysis (Cambridge University Press, 2006).
[6] With Siu-Wing Cheng and Jonathan Shewchuk, he is the co-author of Delaunay Mesh Generation (CRC Press, 2012).