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
École, étude et sujet
- Établissement
- University Of California Berkeley School Of Optometry
- Cours
- Geometry
Infos sur le Document
- Publié le
- 23 janvier 2024
- Nombre de pages
- 17
- Écrit en
- 2023/2024
- Type
- Notes de cours
- Professeur(s)
- Prof,
- Contenu
- Toutes les classes
Sujets
-
computational geometry
-
affine set
-
constrained delaunay triangulation
-
travelling salesman problem
-
minimum euclidean matching