Readablewiki

Tamal Dey

Content sourced from Wikipedia, licensed under CC BY-SA 3.0.

Tamal Krishna Dey (born 1964) is an Indian mathematician and computer scientist who specializes in computational geometry and computational topology. He is a professor at Purdue University. He earned a BSc in electronics from Jadavpur University (1985), an MSc from the Indian Institute of Science (1987), and a PhD from Purdue University (1991) with a dissertation on decompositions of polyhedra in three dimensions under Chandrajit Bajaj. After a postdoctoral stint with Herbert Edelsbrunner at the University of Illinois at Urbana–Champaign, he joined Purdue in 1992. He moved to IIT Kharagpur in 1994, then to the Computer Science and Engineering department at Ohio State University in 1999. At Ohio State, he held a courtesy appointment in mathematics in 2015, served as interim chair of the computer science department in 2019, and returned to Purdue in 2020.

Dey is known for proving the best-known upper bounds on the k-set problem and for his work in 3D reconstruction and computational topology. He coauthored Curve and Surface Reconstruction: Algorithms with Mathematical Analysis (Cambridge University Press, 2006) and, with Siu-Wing Cheng and Jonathan Shewchuk, Delaunay Mesh Generation (CRC Press, 2012). He was elected an ACM Fellow in 2018 for contributions to computational geometry and computational topology and is also a fellow of the IEEE.


This page was last edited on 2 February 2026, at 12:07 (CET).