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.
What's included
- Geometric primitives (points
- lines
- polygons)
- Convex hulls
- Voronoi diagrams
- Triangulation
- Range searching
- Nearest neighbor searching
- Geometric optimization
Keywords
- Geometric Algorithms
- Convex Hulls
- Voronoi Diagrams
- Computational Geometry
- Algorithms
- Geometry