Main learning outcomes for this class
- Computational Geometry Data Structures and Primitives:
- I know how to represent points, lines and simple polygons
- I know how to compute distances and intersections in simple geometrical objects
- I know how to compute if a point is inside a polygon
- I know how to compute the area of a polygon using the shoelace formula
- I know and understand the ccw (counterclockwise) primitive
- I know how to compute if a polygon is convex
- I know what a convex hull is and I know an O(n log N) algorithm to compute it (ex: Graham's Scan)
- I know the concept of divide and conquer in the closest pair of points classical algorithm
Study Material
Main References
Pedro Ribeiro - DCC/FCUP | Last update:
