**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**. - The paper
**Kinetic Data Structures --- a State of the Art Report**, by L. Guibas. - The paper
**The Upper Bound Theorem for Polytopes: An Easy Proof of Its Asymptotic Version**, by R. Seidel. - The paper
**Data Structures for Mobile Data**, by J.~Basch, L.~Guibas, and J.~Hershberger. - Notes on
**Point Location in Two Dimensions.** - The orginal
**Optimal Point Localtion in Monotone Subdivisions**Paper [SIAM J. Comput.**15**, pp. 317-340]. - The orginal
**Optimal Search in Planar Subdivisions**by D. Kirkpatrick Paper [SIAM J. Comput.**12**, pp. 28-35]. - The DEC/SRC Tech. Report
**Ruler, Compass, and Computer : the Design and Analysis of Geometric Algorithms**, by Leonidas Guibas and Jorge Stolfi - The H. Edelsbrunner and E. P. Mucke.
**Three-Dimensional Alpha Shapes**Paper. [ACM Trans. Graphics 13 (1994), 43--72]. - The H. Edelsbrunner.
**Alpha Shapes --- a Survey**. In Tessellations in the Sciences. - The K. Fischer.
**Introduction to Alpha Shapes**Paper. - Notes on
**Triangulating Simple Polygons**. - Notes on
**Seidel's Trapezoidal Partitioning Algorithm**. - Notes on
**Randomized Divide and Conquer**. - Notes on
**Range Searching.** - The Matousek Paper on
**Geometric Range Searching.** - Notes on
**Numerical Issues in Computational Geometry**. - The
**Ham Sandwich Cut Computation**paper of Megiddo. - Notes on
**Shortest Path Problems**. - Notes on
**Hierarchical Structures for Convex Polygons and Polyhedra**.