Computer graphics data structures

right|upright=0.45|frame|This example shows an image with a portion greatly enlarged so that individual pixels, rendered as small squares, can easily be seen.

dot matrix data structure, representing a generally rectangular grid of pixels, or points of color, viewable via a monitor, paper, or other display medium

set of edges, vertices, and polygons which define a 3D model's shape

visual presentation of a 3-dimensional or physical object used in 3D computer graphics

thumb|Left: Recursive subdivision of a cube into octant (solid geometry)|octants. Right: The corresponding octree.

in computer graphics, a finite set of colors

multidimensional search tree for points in k dimensional space

tree data structure used in computer science

In computer graphics, a mipmap (mip being an acronym of the Latin phrase multum in parvo, meaning "much in little") is a pre-calculated, optimized sequence of images, each of which has an image resolution which is a factor of two smaller than the previous. Their use is known as mipmapping.

Type of data structure algorithm

thumb|right|200px|A heightmap created with Terragen thumb|right|200px|The same heightmap converted to a Polygon mesh|3D mesh and rendered with [[Anim8or]]

proportion between the width and the height of a pixel

Form of data structure

technique to manage digital images' colors in a limited fashion

thumb | right A viewport is a polygon viewing region in computer graphics.

thumb|Image rendered using IBM Monochrome Display Adapter|MDA block graphics thumb|Color image rendered using World System Teletext|Teletext semigraphic characters

polygon mesh composed of triangles

data structure for representing polygon meshes in computer memory