
Instructor: David Eppstein
Office: CS 358D, phone 824-8384
Email: eppstein@ics.uci.edu
Textbooks:
Preparata and Shamos, Computational Geometry (required)
O'Rourke, Computational Geometry in C (recommended)
See also O'Rourke's online errata and source code.
Note: on May 23 and 28 I will be away at the Symposium on Computational Geometry, so there will be no lectures on those days.
Cartesian coordinates
projective coordinates
complex coordinates
Arrangements, incidence problems, and levels
Convex hulls
"The locus method" -- Voronoi diagrams
Data structures -- range search, range reporting, point location
Projective duality
Planar duality
The lifting transformation and linearization
Pluecker coordinates
Segment trees
Interval trees
Dobkin-Kirkpatrick recursive decomposition
Fractional cascading -- halfspace range reporting
Klee's measure problem
Arrangements of lines and curves
Voronoi diagrams
3d convex hulls
Output-sensitive convex hulls
Ham sandwich trees
Lower envelopes and single faces in arrangements
Davenport-Schinzel sequences
Line arrangements
Delaunay triangulation and convex hulls
Fixed-dimension linear programming
Fixed dimension linear programming
Polyhedron approximation and grasp planning
Center points
Optimal triangulation
Geometric approximation algorithms
David Eppstein,
Dept. Information & Computer Science,
UC Irvine
Last update: 26 May 2006, 16:34:46 PDT