Joseph S. B. Mitchell is an American computer scientist and mathematician. He is Distinguished Professor and Department Chair of Applied Mathematics and Statistics and Research Professor of Computer Science at Stony Brook University.

Mitchell received a BS (1981, Physics and Applied Mathematics), and an MS (1981, Mathematics) from Carnegie Mellon University, and Ph.D. (1986, Operations Research) from Stanford University (under advisership of Christos Papadimitriou).^[1] He was with Hughes Research Laboratories (1981–86) and then on the faculty of Cornell University (1986–1991). He now serves as Distinguished Professor of Applied Mathematics and Statistics and Research Professor of Computer Science at Stony Brook University. He serves as Chair of the Department of Applied Mathematics and Statistics (since 2014).

Mitchell has served for several years on the Computational Geometry Steering Committee,^[2] often as Chair. He is on the editorial board of the journals Discrete and Computational Geometry,^[3] Computational Geometry: Theory and Applications,^[4] Journal of Computational Geometry,^[5] and the Journal of Graph Algorithms and Applications,^[6] and is an editor-in-chief of the International Journal of Computational Geometry and Applications.^[7] He has served on numerous program committees and was co-chair of the PC for the 21st ACM Symposium on Computational Geometry (2005).

Mitchell's primary research area is computational geometry, applied to problems in computer graphics, visualization, air traffic management, manufacturing, and geographic information systems.

Mitchell has been an NSF Presidential Young Investigator, Fulbright Scholar, and a recipient of the President's Award for Excellence in Scholarship and Creative Activities. He shared the 2010 Gödel Prize with Sanjeev Arora for devising a polynomial-time approximation scheme for the Euclidean travelling salesman problem.^[8][9] In 2011 the Association for Computing Machinery listed him as an ACM Fellow for his research in computational geometry and approximation algorithms.^[10] He has also won numerous teaching awards.