Computational Geometry,
Research of Computational Geometry, which will be named as the introduction and it will start from the definition- Euclidean Plane, what is Euclidean geometry? Then Affine set, Convex set, convex hull, nested convex hull, Extreme point, Extremal edges, Internal edges, Voronoi Diagram and properties, then move into different planar triangulations (mainly Delaunay Triangulation, Minimum weight triangulation, Greedy, Constrained Delaunay triangulation) and moving in depth into the geometric graphs- explaining Closest pair, all nearest neighbors, Euclidean minimum spanning tree, Travelling salesman problem, Minimum Euclidean Matching
Geschreven voor
- Instelling
- University Of California Berkeley School Of Optometry
- Vak
- Geometry
Documentinformatie
- Geüpload op
- 23 januari 2024
- Aantal pagina's
- 17
- Geschreven in
- 2023/2024
- Type
- College aantekeningen
- Docent(en)
- Prof,
- Bevat
- Alle colleges
Onderwerpen
-
computational geometry
-
affine set
-
constrained delaunay triangulation
-
travelling salesman problem
-
minimum euclidean matching