Computational Geometry
Master of Science in Computer Science · University · Theory of Computation
This unit delves into the fundamentals of computational geometry, equipping students with expertise in geometric algorithms, convex hulls, and Voronoi diagrams. By the end of the unit, students will possess a deep understanding of these concepts and their applications in various domains.
Zum Üben gibt es 56 Aufgaben. Jede Antwort bekommt sofort eine Rückmeldung, kostenlos und ohne Anmeldung.
Das gehört dazu
- Geometric primitives (points
- lines
- polygons)
- Convex hulls
- Voronoi diagrams
- Triangulation
- Range searching
- Nearest neighbor searching
- Geometric optimization
Stichworte
- Geometric Algorithms
- Convex Hulls
- Voronoi Diagrams
- Computational Geometry
- Algorithms
- Geometry