To show the organization of the course that includes this module, follow this link Course organization
This module aims at illustrating the foundations of computational geometry, describing its main problems and algorithms.
* Introduction
* Background material
* Polygon triangulation
* Convex hull
* Intersections
* Plane subdivision
* Geometric search
* Proximity (Voroni diagrams, Delaunay triangulation)
Written exam at the end of the course, followed by an oral test.
Strada le Grazie 15
37134 Verona
VAT number01541040232
Italian Fiscal Code93009870234
© 2024 | Verona University
******** CSS e script comuni siti DOL - frase 9957 ********p>