|
||||||||
Computational Geometry DAalto University<p>The main concepts and tools used in computational geometry: data structures, exact and approximation algorithms, computational hardness. Topics include: arrangements and duality, convex hulls, low-dimensional linear programming, orthogonal range searching, plane sweep, Voronoi diagrams and Delaunay triangulations, quadtrees, spanners, clustering, range spaces.</p> |
|
|||||||