Chee Yap
University/Research Lab: Courant Institute, New York University
Location: (New York City)
Personal Research Web Page: http://cs.nyu.edu/yap/
Keywords: exact numerical and algebraic computation, zero bounds, numerical computational geometry, nonrobustness issues, geometric processing, computational geometry, computer algebra, robust curves and surface computations, complexity theory for real computation.
Location: (New York City)
Personal Research Web Page: http://cs.nyu.edu/yap/
Keywords: exact numerical and algebraic computation, zero bounds, numerical computational geometry, nonrobustness issues, geometric processing, computational geometry, computer algebra, robust curves and surface computations, complexity theory for real computation.
Posted on: Wednesday, April 28th, 2010
Broad Research Area: Graphics / Visualization, Numerical/Scientific Computing / HPC / Data-Intensive Scalable Computing, Theory / Algorithms
Research Interests:
I am interested in the interface between discrete and continuous computations. The theory of real computation is a current challenge, and its complexity theory is in infancy.
I am also interested in the algorithmic challenges in applications from computational geometry, graphics, algebraic geometry and continuous mathematics. In the last 20 years,
we have understood a great deal of how to solve the nonrobustness problems in basic geometric algorithms, but much tougher challenges lie ahead in nonlinear geometry, and in transcendental computations.
