Lecture Notes

Below are notes related to the lectures:

• The Basic Algorithms and Combinatorics in Computational Geometry notes.
• The Tagansky paper on analyzing substructures in arrangements A New Technique for Analyzing Substructures in Arrangements of Piecewise Linear Surfaces.
• Notes on Point Location in Two Dimensions
• The DEC/SRC Tech. Report Ruler, Compass, and Computer : the Design and Analysis of Geometric Algorithms, by Leonidas Guibas and Jorge Stolfi
• Notes on Triangulating Simple Polygons
• Notes on Seidel's Trapezoidal Partitioning Algorithm
• Notes on Shortest Path Problems
• Notes on Hierarchical Structures for Convex Polygons and Polyhedra