The following pages link to Discrete & Computational Geometry
External toolsShowing 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Antiprism (links | edit)
- Carl Friedrich Gauss (links | edit)
- Delaunay triangulation (links | edit)
- Floating-point arithmetic (links | edit)
- John Horton Conway (links | edit)
- Tesseract (links | edit)
- Möbius strip (links | edit)
- Convex hull (links | edit)
- Three utilities problem (links | edit)
- Polyomino (links | edit)
- Tomaž Pisanski (links | edit)
- Computational geometry (links | edit)
- List of unsolved problems in mathematics (links | edit)
- Packing problems (links | edit)
- Graham's number (links | edit)
- Shing-Tung Yau (links | edit)
- Isosceles triangle (links | edit)
- Dehn invariant (links | edit)
- Outline of combinatorics (links | edit)
- Kepler conjecture (links | edit)
- 44 (number) (links | edit)
- Minkowski addition (links | edit)
- Tom Duff (links | edit)
- Independent set (graph theory) (links | edit)
- Isogonal figure (links | edit)
- Non-measurable set (links | edit)
- Triangular bipyramid (links | edit)
- Polygon triangulation (links | edit)
- Ham sandwich theorem (links | edit)
- Gyroelongated square bipyramid (links | edit)
- Triaugmented triangular prism (links | edit)
- Pentagonal bipyramid (links | edit)
- Arrangement of lines (links | edit)
- Aperiodic tiling (links | edit)
- Heilbronn triangle problem (links | edit)
- Euclidean minimum spanning tree (links | edit)
- Szemerédi–Trotter theorem (links | edit)
- Sylvester–Gallai theorem (links | edit)
- Simple polygon (links | edit)
- Simplicial homology (links | edit)
- Net (polyhedron) (links | edit)
- Robert Ammann (links | edit)
- Linkage (mechanical) (links | edit)
- Incidence geometry (links | edit)
- Branko Grünbaum (links | edit)
- Holyhedron (links | edit)
- Plastic ratio (links | edit)
- Thomas Callister Hales (links | edit)
- Uniform polyhedron (links | edit)
- Napoleon's theorem (links | edit)