The following pages link to Computational Geometry (journal)
External toolsShowing 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Determinant (links | edit)
- Delaunay triangulation (links | edit)
- Rhombicuboctahedron (links | edit)
- Convex hull (links | edit)
- Sokoban (links | edit)
- Computational geometry (links | edit)
- List of unsolved problems in mathematics (links | edit)
- Packing problems (links | edit)
- Hamiltonian path (links | edit)
- Automatic label placement (links | edit)
- Graph drawing (links | edit)
- 2-satisfiability (links | edit)
- 3SUM (links | edit)
- Polygon triangulation (links | edit)
- Euclidean minimum spanning tree (links | edit)
- Szemerédi–Trotter theorem (links | edit)
- Sylvester–Gallai theorem (links | edit)
- Simple polygon (links | edit)
- Visibility graph (links | edit)
- Treemapping (links | edit)
- No-three-in-line problem (links | edit)
- Theta graph (links | edit)
- Timothy M. Chan (links | edit)
- Mesh generation (links | edit)
- Carpenter's rule problem (links | edit)
- Unit disk graph (links | edit)
- Chan's algorithm (links | edit)
- List of books in computational geometry (links | edit)
- Boolean operations on polygons (links | edit)
- Geometric median (links | edit)
- Pseudotriangle (links | edit)
- Boxicity (links | edit)
- Convex hull algorithms (links | edit)
- Moser spindle (links | edit)
- Relative neighborhood graph (links | edit)
- Laman graph (links | edit)
- Jump-and-Walk algorithm (links | edit)
- Delaunay refinement (links | edit)
- Wiener index (links | edit)
- 3D reconstruction (links | edit)
- Circle packing theorem (links | edit)
- Rotating calipers (links | edit)
- Median graph (links | edit)
- Fréchet distance (links | edit)
- Discrete & Computational Geometry (links | edit)
- Squaregraph (links | edit)
- Minimum-weight triangulation (links | edit)
- K-means++ (links | edit)
- Albertson conjecture (links | edit)
- Jörg-Rüdiger Sack (links | edit)