  "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

### Arbitrary-Dimensional Convex Hull & Programs

• hull -- Incremental algorithm. Resolves degeneracies lexicographically. Optional Randomization. Outputs include VD, DT, Volume of Voronoi faces, and alpha shapes. .. etc.
• lrs (ftp)  -- pivoting paradigm. Half-space Intersection (deterministic transversal), resolve degeneracies lexicographically, compute volume.
• chD (ftp)  -- Incremental algorithm. Uses symbolic perturbation. Computes volume.

### 2-Dimensional Mesh Generation

• Triangle -- Delaunay refinement. Ruppert's algorithm.
• Tripoint (ftp) -- Quad-tree. Mitchell's algorithm for meshes. MATLAB interface.
• Meshing code in SimLab, Cornell U.   -- a Delaunay refinement. Chew's algorithm. Handles curved boundaries. Built on algebraic and topological computation system.

### Point Set Problems

• Alpha Shapes Software -- Package to generate, display, compute volume, surface area of weighed or un-weighted of 2D and 3D alpha shapes. Finds and measures holes, pockets and voids. Handles degeneracy.
• AlphaShapes (Hull)  -- Computes alpha shapes in any dimension. Handles degeneracy.
• k-nearest neighbors (Ranger)  -- Space decomposition algorithms. Does orthogonal range queries.

### Software Libraries and Tools for Graph Drawing

• AGD -- LEDA-based library of C++ classes for graph drawing.
• aiSee -- graph drawing tool that supports a variety of layout methods.
• Graph Drawing Server -- Web-based graph drawing service.
• Graphviz -- open source graph drawing software at AT&T.
• GDToolkit -- LEDA-based library of C++ classes for graph drawing.
• 3DCube -- tool for 3D graph drawing.

### Conferences, Workshops & Symposiums There is no place like Home