My primary research area is computational geometry, in which one studies the design and analysis of algorithms for geometric computation. Computational geometry finds application in problems from solid modeling, CAD/CAM, computer graphics, molecular biology, data structuring, and robotics, as well as problems from discrete geometry and topology.
Most of my work involves identifying, representing, and exploiting geometric and topological information that permit efficient computation. For example, previous results have included
My current focus is on applications of computational geometry in Molecular Biology and Geographic Information Systems (GIS). Examples of the former include docking and folding problems, and scoring protein structures using Delaunay tetrahedralization. Examples of the latter include polygon overlay processing and drainage on TINs. I am especially interested in tasks that require geometric structure.
See my on-line papers for more specifics.