25th Annual Symposium on Computational Geometry

The 25th Annual Symposium on Computational Geometry will be held on June 8-10, 2009 in Lakeside Lecture Theatres (Søauditorie 1) and is organized by the Center for Massive Data Algorithmics (MADALGO).

See www.madalgo.au.dk/socg2009/ for details.

The topics of the symposium reflect the rich diversity of research interests in computational geometry. Topics of interest include, but are not limited to: discrete and combinatorial geometry and topology; design and analysis of geometric algorithms and data structures; experimental evaluation of geometric algorithms and heuristics; numerical and algebraic issues arising in implementations; lower bounds on the computational complexity of geometric problems; and novel algorithmic applications of geometry in computer graphics, geometric modeling, computer-aided design and manufacturing, scientific computing, geographic information systems, database systems, robotics, computational biology, machine learning, sensor networks, combinatorial optimization, theoretical computer science, economics, pure mathematics, and other fields.

Host: Lars Arge