Related Research Articles
In geometry, the convex hull or convex envelope or convex closure of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space, or equivalently as the set of all convex combinations of points in the subset. For a bounded subset of the plane, the convex hull may be visualized as the shape enclosed by a rubber band stretched around the subset.
The discipline of origami or paper folding has received a considerable amount of mathematical study. Fields of interest include a given paper model's flat-foldability, and the use of paper folds to solve up-to cubic mathematical equations.
Algorithmic topology, or computational topology, is a subfield of topology with an overlap with areas of computer science, in particular, computational geometry and computational complexity theory.
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.
Computational mathematics is an area of mathematics devoted to the interaction between mathematics and computer computation.
Joseph O'Rourke is the Spencer T. and Ann W. Olin Professor of Computer Science at Smith College and the founding chair of the Smith computer science department. His main research interest is computational geometry.
Frances Foong Chu Yao is a Chinese-born American mathematician and theoretical computer scientist. She is currently a Chair Professor at the Institute for Interdisciplinary Information Sciences (IIIS) of Tsinghua University. She was Chair Professor and Head of the Department of computer science at the City University of Hong Kong, where she is now an honorary professor.
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.
In geometry, the moment curve is an algebraic curve in d-dimensional Euclidean space given by the set of points with Cartesian coordinates of the form
Pankaj Kumar Agarwal is an Indian computer scientist and mathematician researching algorithms in computational geometry and related areas. He is the RJR Nabisco Professor of Computer Science and Mathematics at Duke University, where he has been chair of the computer science department since 2004. He obtained his Doctor of Philosophy (Ph.D.) in computer science in 1989 from the Courant Institute of Mathematical Sciences, New York University, under the supervision of Micha Sharir.
In the study of algorithms, an LP-type problem is an optimization problem that shares certain properties with low-dimensional linear programs and that may be solved by similar algorithms. LP-type problems include many important optimization problems that are not themselves linear programs, such as the problem of finding the smallest circle containing a given set of planar points. They may be solved by a combination of randomized algorithms in an amount of time that is linear in the number of elements defining the problem, and subexponential in the dimension of the problem.
Emmerich (Emo) Welzl is a computer scientist known for his research in computational geometry. He is a professor in the Institute for Theoretical Computer Science at ETH Zurich in Switzerland.
Otfried Cheong is a German computational geometer working in South Korea at KAIST. He is known as one of the authors of the widely used computational geometry textbook Computational Geometry: Algorithms and Applications and as the developer of Ipe, a vector graphics editor.
Jean Henri Gallier is a researcher in computational logic at the University of Pennsylvania, where he holds appointments in the Computer and Information Science Department and the Department of Mathematics.
Daniel Mier Gusfield is an American computer scientist, Distinguished Professor of Computer Science at the University of California, Davis. Gusfield is known for his research in combinatorial optimization and computational biology.
Monique Teillaud is a French researcher in computational geometry at the French Institute for Research in Computer Science and Automation (INRIA) in Nancy, France. She moved to Nancy in 2014 from a different INRIA center in Sophia Antipolis, where she was one of the developers of CGAL, a software library of computational geometry algorithms.
Yilun Dianna Xu is a mathematician and computer scientist whose research concerns the computational geometry of curves and surfaces, computer vision, and computer graphics. She is a professor of computer science at Bryn Mawr College where she chairs the computer science department.
Tamal Krishna Dey is an Indian mathematician and computer scientist specializing in computational geometry and computational topology. He is a professor at Purdue University.
Geometric Folding Algorithms: Linkages, Origami, Polyhedra is a monograph on the mathematics and computational geometry of mechanical linkages, paper folding, and polyhedral nets, by Erik Demaine and Joseph O'Rourke. It was published in 2007 by Cambridge University Press (ISBN 978-0-521-85757-4). A Japanese-language translation by Ryuhei Uehara was published in 2009 by the Modern Science Company (ISBN 978-4-7649-0377-7).
References
- ↑ Department people, Computer Science, UC Davis, retrieved 2015-06-29.
- 1 2 3 4 5 6 Fish, Corinna (Spring 2015), "From pines to pixels: 3-D modeling research by Nina Amenta helps map evolutionary trees and the surface of forests", UC Davis Magazine, 32 (2), archived from the original on 2020-11-09.
- ↑ Dey, Tamal K. (2006), Curve and Surface Reconstruction: Algorithms with Mathematical Analysis, Cambridge Monographs on Applied and Computational Mathematics, vol. 23, Cambridge University Press, p. 77, ISBN 9781139460682,
The first algorithm for surface reconstruction with proved guarantees was devised by Amenta and Bern
. - ↑ Amenta, Annamaria Beatrice (1993), Helly Theorems and Generalized Linear Programming (PDF), archived from the original (PDF) on 2020-11-09.
- ↑ Nina Amenta at the Mathematics Genealogy Project
- ↑ Proceedings of the twenty-second annual symposium on Computational geometry, Association for Computing Machinery, retrieved 2015-06-29.
