# Category:Discrete geometry

Computing portal |

Here is a list of articles in the Discrete geometry category of the Computing portal that unifies foundations of mathematics and computations using computers. **Discrete geometry** or **combinatorial geometry** may be loosely defined as study of geometrical objects and properties that are discrete or combinatorial, either by their nature or by their representation; the study that does not essentially rely on the notion of continuity.

## Subcategories

This category has the following 9 subcategories, out of 9 total.

### D

### F

### G

### L

### M

### P

### T

## Pages in category "Discrete geometry"

The following 64 pages are in this category, out of 64 total.

- Discrete geometry
*(computing)*

### A

- Arrangement (space partition)
*(computing)* - Arrangement of hyperplanes
*(computing)* - Arrangement of lines
*(computing)*

### B

- Bellman's lost in a forest problem
*(computing)* - Borsuk's conjecture
*(computing)*

### C

- Carpenter's rule problem
*(computing)* - Centroidal Voronoi tessellation
*(computing)* - Close-packing of equal spheres
*(computing)* - Combinatorial Geometry in the Plane
*(computing)* - Connective constant
*(computing)* - Covering problem of Rado
*(computing)*

### D

- Davenport–Schinzel sequence
*(computing)* - Davenport–Schinzel Sequences and Their Geometric Applications
*(computing)* - Discrete & Computational Geometry
*(computing)* - Disk covering problem
*(computing)* - Dissection problem
*(computing)*

### E

- Equidissection
*(computing)* - Erdős distinct distances problem
*(computing)* - Erdős–Diophantine graph
*(computing)*

### G

- Geometric combinatorics
*(computing)* - Guillotine problem
*(computing)*

### H

- Hadwiger conjecture (combinatorial geometry)
*(computing)* - Happy ending problem
*(computing)* - Heilbronn triangle problem
*(computing)* - Hilbert basis (linear programming)
*(computing)* - Hinged dissection
*(computing)* - Honeycomb conjecture
*(computing)*

### I

- Integer triangle
*(computing)* - Integrally-convex set
*(computing)* - Isosceles set
*(computing)*

### K

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

### L

- Lebesgue's universal covering problem
*(computing)* - List of shapes with known packing constant
*(computing)*

### M

- McMullen problem
*(computing)* - Moser's worm problem
*(computing)* - Mountain climbing problem
*(computing)* - Moving sofa problem
*(computing)*

### N

- Napkin folding problem
*(computing)* - Nearest neighbor search
*(computing)* - Necklace splitting problem
*(computing)*

### O

- Orchard-planting problem
*(computing)*

### P

- Packing density
*(computing)* - Penrose tiling
*(computing)* - Pinwheel tiling
*(computing)* - Polycube
*(computing)*

### Q

- Quaquaversal tiling
*(computing)*

### R

- Regular map (graph theory)
*(computing)*

### S

- Self-avoiding walk
*(computing)* - Sphere packing
*(computing)* - Sphere packing in a cylinder
*(computing)* - Squaring the square
*(computing)* - Straight skeleton
*(computing)* - Supersolvable arrangement
*(computing)*

### T

- Tarski's circle-squaring problem
*(computing)* - Tic-tac-toe
*(computing)*

### V

- Vertex enumeration problem
*(computing)* - Voronoi diagram
*(computing)*

### W

- Weighted Voronoi diagram
*(computing)*