Category:Discrete geometry

D

• ► Digital geometry‎ (1 C, 45 P)

F

• ► Finite geometry‎ (6 P)

G

• ► Geometric transversal theory‎ (5 P)

L

• ► Lattice points‎ (1 C, 31 P)

M

• ► Mathematics of rigidity‎ (8 P)
• ► Matroid theory‎ (3 C, 56 P)

P

• ► Packing problem‎ (1 C, 10 P)
• ► Polyhedral combinatorics‎ (14 P)

T

• ► Tessellation‎ (5 C, 172 P)
• ► Theorems in discrete geometry‎ (19 P)
• ► Triangulation (geometry)‎ (20 P)

*

• Discrete geometry

A

• Ammann–Beenker tiling
• Arrangement of hyperplanes
• Arrangement of lines

B

• Bedlam cube
• Borsuk's conjecture

C

• Carpenter's rule problem
• Centroidal Voronoi tessellation
• Close-packing of equal spheres
• Connective constant
• Conway puzzle
• Covering problem of Rado

D

• Davenport–Schinzel sequence
• Disk covering problem
• Dissection problem

E

• Equidissection
• Erdős distinct distances problem
• Erdős–Diophantine graph

F

• Flexible polyhedron

G

• Geombinatorics
• Geometric combinatorics
• Guillotine problem

H

• Hadwiger conjecture (combinatorial geometry)
• Happy Ending problem
• Heilbronn triangle problem
• Heronian triangle
• Honeycomb conjecture

I

• Integer triangle

K

• K-set (geometry)
• Kakeya set
• Kepler conjecture
• Kissing number problem
• Kobon triangle problem

M

• McMullen problem
• Moser's worm problem
• Mountain climbing problem
• Moving sofa problem

N

• Napkin folding problem

N cont.

• Nearest neighbor search
• Necklace splitting problem

O

• Orchard-planting problem

P

• Penrose tiling
• Pinwheel tiling

Q

• Quaquaversal tiling

R

• Regular map (graph theory)

S

• Self-avoiding walk
• Slothouber–Graatsma puzzle
• Sphere packing
• Squaring the square
• Straight skeleton
• Supersoluble arrangement

T

• Tarski's circle-squaring problem

V

• Vertex enumeration problem
• Voronoi diagram

W

• Weighted Voronoi diagram