Geometric Algorithms
Completed by Nicolas Tandé
December 12, 2025
17 hours (approximately)
Nicolas Tandé'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: Algorithms
- Category: Data Structures
- Category: Geographic Information Systems
- Category: Theoretical Computer Science
- Category: Computer Graphics
- Category: Graph Theory
- Category: Spatial Analysis
- Category: Spatial Data Analysis
- Category: Geometry
