Next:
Overview and Organizational Matters,
Effective Computational Geometry
Kurt Mehlhorn and Elmar Schömer and Lutz Kettner
Date:
WS 01/02
Overview and Organizational Matters, 1 Lecture
The Instructors
Contents
Exercise Sessions
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
Arrangements of Ellipsoids
Main Lecturer: Elmar Schömer
Overview of Algorithms, 1 Lecture
Systems of Polynomial Equations, 2 Lectures
Roots of Univariate Polynomials, 4 Lectures
Basics of Differential Geometry, 4 Lectures
Bibliography
About this document ...
Kurt Mehlhorn
2001-11-21
