discrete geometry
Finite spatial structures
Discrete geometry is the branch of mathematics studying combinatorial properties of geometric objects—points, lines, polygons, polyhedra—considered as distinct units rather than continuous spaces.
It addresses problems like how many ways objects can be arranged, how efficiently spheres can pack a container, or what shapes can tile a plane.
Discrete geometry underlies computer graphics and computational biology.
- triangulationLocation via three points
- tessellationGapless plane coverage
- Euler's formulae^(ix) relates to trigonometry
- arrangementOrdered configuration or agreement
- Platonic solidsFive perfectly symmetrical 3D shapes
nearest neighbor · faces · incidence · Euler · edges · combinatorial · polyhedra · tiling · packing · vertices · hulls · coverage · counting · cells · grids · partitions · collision detection · planarity