"Analytical geometry has never existed. There are only people who do linear geometry badly, by taking coordinates, and they call this analytical geometry. Out with them!"- Jean Dieudonné

"The first test of potential in mathematics is whether you can get anything out of geometry." Quoted in D MacHale, Comic Sections(Dublin 1993)

"The significant problems we face cannot be solved at the same level of thinking we were at when we created them." - Einstein

Algorithms | Computer Architecture | Compilers | Operating Systems | Graph Theory
Computer Science | Engineering/Technology | Java | Parallel Computing  


Computational Geometry Lecture Notes

  1. Introduction
  2. Polygon Partitioning
  3. Convex Hull
  4. Voronoi Diagram
  5. Delaunay Triangulation
  6. Proximity Problem
  7. Reporting Intersection of a Set of Half Planes
  8. Convex Polygon Decomposition
  9. Famous NP-Complete Problems in Computational Geometry
  10. Appendix



Computational Geometry Notes  by  Professor Jianer Chen  
Geometry Center
-- Center for the Computation and Visualization of Geometric Structures.
History of Geometry
History of Mathematics Archive

Euclid's Element

Introduction to the Works of Euclid


Arithmetic Tools

Objects and Data Structures


Arbitrary-Dimensional Convex Hull & Programs

3-Dimensional VoronoiDiagram (VD), Delunay Triangulation (DT), and Convex Hull (CH)

2-Dimensional Voronoi Diagram, Delunay Triangulation, and Convex Hull

2-Dimensional Triangulation and Trapezoidation

2-Dimensional Mesh Generation

3-Dimensional Mesh Generation

Problems on Polygons

LP-Type Problems

Point Set Problems

Bibliography Search

Books and Online papers



Graphics Links in Computational Geometry

Software Libraries and Tools for Graph Drawing

Conferences, Workshops & Symposiums


There is no place like Home