The Algorithms group is renowned for its dual expertise in mathematical rigor and practical development. Specialities include areas of data structures, parallel algorithms, large-scale computing, computational and combinational geometry, robotics and machine learning, graph algorithms, data compression for efficient storage and transmission of data, and combinatorial optimization. Search strategies, randomized algorithms, algebraic computation, and optical computing are some additional topics of research. The CGC is focused on multidisciplinary, coordinated research dedicated to the development of new geometric computing algorithms and the applications of such algorithms to research domains that deal with geometric data. The faculty in the Algorithms group are listed below.
More detailed information appears on subsequent pages.
Computational and combinatorial geometry, robotics, graph algorithms, data structures, combinatorial optimization. My research interests lie in the area of design and analysis of efficient algorithms. I have been working on various problems in computational and combinatorial geometry, robotics, computer graphics, and geographic information systems. Problems from motion planning, computer graphics, geographic information systems, and several other areas have motivated the study of a variety of geometric questions from a computational point of view. I am interested in developing general techniques that yield fast algorithms for various geometric problems.