Computational Geometry

Research Area
Algorithms, Graphs and Combinatorics
Description

Design and analysis of algorithms for discrete geometric problems. Convexity issues, proximity, shortest paths, geometric search, etc. Study techniques for troubleshooting in combinatorial geometry and establishing lower levels. Data structures for manifolds topology representation. Accurate representation of spherical maps. Oriented projective geometry.