Computational Geometry

Introduction to Geometric Algorithms and Extensions to the Research Areas of Computational Geometry.

In particular:

• Convexity in two dimensions and in three dimensions, but also in a general dimension.
• Volume of curved polyhedra and Minkowski Sum of Polyhedra.
• Triangulation and Delaunay Triangulation / Voronoi Diagram.
• Geometric Search Algorithms, Geometric Data Structures, Nearest Neighbor, clustering.

Also, topics on geometric algorithms and the use of libraries (eg CGAL) for the development of geometric software in programming languages ​​like C / C ++, and Python are presented.