# Category:Triangulation (geometry)

Here is a list of articles in the Triangulation (geometry) category of the Computing portal that unifies foundations of mathematics and computations using computers.

This category concerns subdivisions of the plane or of regions of the plane into triangles, and related mathematical structures. For other unrelated meanings of "triangulation", see Triangulation (disambiguation).

## Pages in category "Triangulation (geometry)"

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

- Triangulation (geometry)
*(computing)*

### A

- Apollonian network
*(computing)*

### B

- Barycentric subdivision
*(computing)* - Bowyer–Watson algorithm
*(computing)*

### C

- Chew's second algorithm
*(computing)* - Constrained Delaunay triangulation
*(computing)*

### D

- Delaunay triangulation
*(computing)*

### F

- Fan triangulation
*(computing)*

### G

- Greedy triangulation
*(computing)*

### J

- Jump-and-Walk algorithm
*(computing)*

### K

- Kinetic triangulation
*(computing)*

### M

- Mesh generation
*(computing)* - Minimum-weight triangulation
*(computing)*

### N

- Nonobtuse mesh
*(computing)*

### P

- Pitteway triangulation
*(computing)* - Point set triangulation
*(computing)* - Polygon triangulation
*(computing)* - Principles of grid generation
*(computing)* - Principles of Grid Generation
*(computing)* - Pseudotriangle
*(computing)*

### Q

- Quasi-triangulation
*(computing)*

### R

- Rotation distance
*(computing)* - Ruppert's algorithm
*(computing)*

### S

- Simplicial complex
*(computing)* - Sperner's lemma
*(computing)*

### T

- Triangle mesh
*(computing)* - Triangulated irregular network
*(computing)* - Triangulation (topology)
*(computing)*