Next:
The Sweep Line Algorithm
Up:
Effective Computational Geometry
Previous:
Exam
Boolean Operations on Polygons with Circular Arcs
Main Lecturer: Kurt Mehlhorn
The Sweep Line Algorithm for Line Segment Intersection
Polygons and Boolean Operations on Polygons
The LEDA Geometry Kernel, 3 Lectures
The CGAL Geometry Kernel, Nov 15
Circle Points and Predicates on Circle Points, Nov 20
The LEDA Number Class Real, Nov 22
Algebraic Numbers and Sign Test for Algebraic Expressions, Nov 27
Numerical Sign Test Based on Separation Bounds, Nov 29 and Dec 1
More on Algebraic Numbers
Experiences with Implementation and Optimizations, 2 Lectures
Open Problems and Further Work, 2 Lectures
Kurt Mehlhorn
2001-11-21
