Computational geometry Algorithms for solving geometric problems in 2D and higher Fundamental objects: o point line segment Ine Basic structures triangulation convex hull c 2001 by erik D. Demaine Introduction to Agorithms Day 21 L12.3© 2001 by Erik D. Demaine Introduction to Algorithms Day 21 L12.3 Computational geometry Algorithms for solving “geometric problems” in 2D and higher. Fundamental objects: point line segment line Basic structures: triangulation convex hull