This project considers both theoretical and applied aspects of computational geometry. The geometric structure of, and efficient algorithms for, problems in a variety of areas are being investigated. Some particular areas of interest are: applications of Davenport- Schinzel sequences, generalized Voronoi diagrams, probabilistic techniques, and triangulations. This work has implications for robot motion planning, graphics, solid modeling and computer vision. A major emphasis is on the cross-fertilization between the basic research in computational geometry and the various applications areas.

Agency
National Science Foundation (NSF)
Institute
Division of Computer and Communication Foundations (CCF)
Application #
8901484
Program Officer
Dana S. Richards
Project Start
Project End
Budget Start
1989-06-15
Budget End
1993-05-31
Support Year
Fiscal Year
1989
Total Cost
$451,584
Indirect Cost
Name
New York University
Department
Type
DUNS #
City
New York
State
NY
Country
United States
Zip Code
10012