Category:Computer graphics data structures
![]() | Computing portal |
Here is a list of articles in the category Computer graphics data structures of the Computing portal that unifies foundations of mathematics and computations using computers.
Pages in category "Computer graphics data structures"
The following 30 pages are in this category, out of 30 total.
C
- Combinatorial map (computing)
D
- Generalized map (computing)
H
- Heightmap (computing)
I
- Implicit k-d tree (computing)
- Indexed color (computing)
K
- K-d tree (computing)
- K-D-B-tree (computing)
L
- Least squares conformal map (computing)
- Level set (data structures) (computing)
M
- Mipmap (computing)
N
- Nonobtuse mesh (computing)
O
- Octree (computing)
P
- Palette (computing) (computing)
- Pixel (computing)
- Pixel aspect ratio (computing)
- Polygon mesh (computing)
- Polygon soup (computing)
- Procedural surface (computing)
Q
- Quad-edge (computing)
R
- Raster graphics (computing)
S
- Scene graph (computing)
- Segment tree (computing)
- Semigraphics (computing)
- Smoothing group (computing)
- Summed-area table (computing)
T
- Triangle mesh (computing)
V
- Viewport (computing)
- Volume mesh (computing)
W
- Winged edge (computing)
- Wire-frame model (computing)