Scott Alan Mitchell | |
|---|---|
 Scott A. Mitchell with whiteboard and bicycle | |
| Citizenship | United States |
| Alma mater | University of Wisconsin–Madison Cornell University |
| Known for | Mesh generation |
| Scientific career | |
| Fields | Applied Mathematics Computational Geometry Computer Graphics |
| Institutions | Sandia National Laboratories |
| Doctoral advisor | Stephen A. Vavasis |
| Website | cs |
Scott Alan Mitchell is a researcher of applied mathematics in the Center for Computing Research at Sandia National Laboratories.
Mitchell received a B.S in Applied Math, Engineering & Physics from the University of Wisconsin-Madison (1988), and an M.S. (1991) and Ph.D. (1993) in Applied Math from Cornell University. He worked the summer of 1991 at Xerox PARC (now PARC ). Since 1992 he has been at Sandia National Laboratories in the Center for Computing Research, with several different roles. He researched theoretical computational geometry meshing from 1992—1993. He contributed to applied meshing in the CUBIT project: R&D 1993—2000, project leader 2000—2002, R&D 2015—. He managed Sandia's Optimization and Uncertainty Estimation department, and had programmatic roles on the Laboratory Directed Research and Development program and NNSA's ASC program from 2002-2007. He researched informatics and applying persistent homology from 2008-2011. Since 2011 he researches mesh generation and sampling.
He served on the committee of the Meshing Roundtable and International Symposium on Computational Geometry SoCG conferences. He served as a guest editor for the journal CAD. As an adjunct professor, he taught a small graduate course on computational geometry at the University of New Mexico. He is a member of ACM and SIAM.
He published [1] [2] [3] algorithms in the areas of mesh generation, reconstruction and sampling, for the contexts of computational geometry, simulation, computer graphics and uncertainty quantification. His main contributions have been geometric algorithms with provable correctness and output quality guarantees. His PhD thesis was the first tetrahedral meshing algorithm with guarantees on both the number of elements and their shape. He is also well known for a series of papers on whisker weaving and other algorithms for hexahedral mesh generation using the dual spatial twist continuum. He used optimization for mesh generation, specifically interval assignment, deciding the right number of edges locally so the model can be meshed globally. Since 2011 he contributed sampling algorithms for computer graphics and uncertainty quantification, and algorithms for mesh generation (including duality) and surface reconstruction.
Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems are also considered to be part of computational geometry. While modern computational geometry is a recent development, it is one of the oldest fields of computing with a history stretching back to antiquity.
Theoretical computer science (TCS) is a subset of general computer science and mathematics that focuses on mathematical aspects of computer science such as the theory of computation, lambda calculus, and type theory.
Jack J. Dongarra ForMemRS; is an American University Distinguished Professor of Computer Science in the Electrical Engineering and Computer Science Department at the University of Tennessee. He holds the position of a Distinguished Research Staff member in the Computer Science and Mathematics Division at Oak Ridge National Laboratory, Turing Fellowship in the School of Mathematics at the University of Manchester, and is an adjunct professor in the Computer Science Department at Rice University. He served as a faculty fellow at Texas A&M University's institute for advanced study (2014–2018). Dongarra is the founding director of Innovative Computing Laboratory.
In scientific visualization and computer graphics, volume rendering is a set of techniques used to display a 2D projection of a 3D discretely sampled data set, typically a 3D scalar field.
Computational science, also known as scientific computing or scientific computation (SC), is a rapidly growing field that uses advanced computing capabilities to understand and solve complex problems. It is an area of science which spans many disciplines, but at its core, it involves the development of models and simulations to understand natural systems.
Geometry processing, or mesh processing, is an area of research that uses concepts from applied mathematics, computer science and engineering to design efficient algorithms for the acquisition, reconstruction, analysis, manipulation, simulation and transmission of complex 3D models. As the name implies, many of the concepts, data structures, and algorithms are directly analogous to signal processing and image processing. For example, where image smoothing might convolve an intensity signal with a blur kernel formed using the Laplace operator, geometric smoothing might be achieved by convolving a surface geometry with a blur kernel formed using the Laplace-Beltrami operator.
In electrical engineering and computer science, Lloyd's algorithm, also known as Voronoi iteration or relaxation, is an algorithm named after Stuart P. Lloyd for finding evenly spaced sets of points in subsets of Euclidean spaces and partitions of these subsets into well-shaped and uniformly sized convex cells. Like the closely related k-means clustering algorithm, it repeatedly finds the centroid of each set in the partition and then re-partitions the input according to which of these centroids is closest. In this setting, the mean operation is an integral over a region of space, and the nearest centroid operation results in Voronoi diagrams.
Mesh generation is the practice of creating a mesh, a subdivision of a continuous geometric space into discrete geometric and topological cells. Often these cells form a simplicial complex. Usually the cells partition the geometric input domain. Mesh cells are used as discrete local approximations of the larger domain. Meshes are created by computer algorithms, often with human guidance through a GUI, depending on the complexity of the domain and the type of mesh desired. The goal is to create a mesh that accurately captures the input domain geometry, with high-quality (well-shaped) cells, and without so many cells as to make subsequent calculations intractable. The mesh should also be fine in areas that are important for the subsequent calculations.
David Arthur Eppstein is an American computer scientist and mathematician. He is a Distinguished Professor of computer science at the University of California, Irvine. He is known for his work in computational geometry, graph algorithms, and recreational mathematics. In 2011, he was named an ACM Fellow.
Computer graphics is a sub-field of computer science which studies methods for digitally synthesizing and manipulating visual content. Although the term often refers to the study of three-dimensional computer graphics, it also encompasses two-dimensional graphics and image processing.
Chandrajit Bajaj is an American computer scientist. He is a Professor of Computer science at the University of Texas at Austin holding the Computational Applied Mathematics Chair in Visualization and is the director of the Computational Visualization Center, in the Institute for Computational Engineering and Sciences (ICES).
Bruce Randall Donald is an American computer scientist and computational biologist. He is the James B. Duke Professor of Computer Science and Biochemistry at Duke University. He has made numerous contributions to several fields in Computer Science such as robotics, Microelectromechanical Systems (MEMS), Geometric & physical algorithms and computational geometry; as well as in areas of Structural Molecular Biology & Biochemistry such as Protein design, Protein Structure Determination and Computational Chemistry.
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.
Annamaria Beatrice (Nina) Amenta is an American computer scientist who works as the Tim Bucher Family Professor of Computer Science and the chair of the Computer Science Department at the University of California, Davis. She specializes in computational geometry and computer graphics, and is particularly known for her research in reconstructing surfaces from scattered data points.
Computational Geometry, also known as Computational Geometry: Theory and Applications, is a peer-reviewed mathematics journal for research in theoretical and applied computational geometry, its applications, techniques, and design and analysis of geometric algorithms. All aspects of computational geometry are covered, including the numerical, graph theoretical and combinatorial aspects, as well as fundamental problems in various areas of application of computational geometry: in computer graphics, pattern recognition, image processing, robotics, electronic design automation, CAD/CAM, and geographical information systems.
Tamara G. Kolda is an American applied mathematician and Distinguished Member of Technical Staff at Sandia National Laboratories. She is noted for her contributions in computational science, multilinear algebra, data mining, graph algorithms, mathematical optimization, parallel computing, and software engineering. She is currently a member of the SIAM Board of Trustees and served as associate editor for both the SIAM Journal on Scientific Computing and the SIAM Journal on Matrix Analysis and Applications.
Tamal Krishna Dey is an Indian mathematician and computer scientist specializing in computational geometry and computational topology. He is a professor at Purdue University.