Geometric Algorithms
Completed by Joseph Paul González
June 8, 2019
17 hours (approximately)
Joseph Paul González's account is verified. Coursera certifies their successful completion of Geometric Algorithms
What you will learn
Analyze and design efficient geometric algorithms used in computer graphics, robotics, GIS, and spatial data analysis.
Use geometric data structures such as KD-Trees and Range Trees for multidimensional range searching.
Understand and construct Voronoi diagrams and Delaunay triangulations for spatial partitioning and geometric analysis.
Apply plane sweep algorithms to efficiently detect and process line segment intersections.
Skills you will gain
- Category: Spatial Data Analysis
- Category: Algorithms
- Category: Graph Theory
- Category: Spatial Analysis
- Category: Theoretical Computer Science
- Category: Computer Graphics
- Category: Geographic Information Systems
- Category: Data Structures
- Category: Geometry
