Definitions from Wiktionary (Cohen-Sutherland algorithm)
▸ noun: (computer graphics) An algorithm used for line clipping. It divides a two-dimensional space into nine regions (or a three-dimensional space into 27 regions), and then efficiently determines the lines and portions of lines that are visible in the central region, or viewport.
▸ Words similar to Cohen-Sutherland algorithm
▸ Usage examples for Cohen-Sutherland algorithm
▸ Idioms related to Cohen-Sutherland algorithm
▸ Wikipedia articles (New!)
▸ Words that often appear near Cohen-Sutherland algorithm
▸ Rhymes of Cohen-Sutherland algorithm
▸ Invented words related to Cohen-Sutherland algorithm
▸ noun: (computer graphics) An algorithm used for line clipping. It divides a two-dimensional space into nine regions (or a three-dimensional space into 27 regions), and then efficiently determines the lines and portions of lines that are visible in the central region, or viewport.
Similar:
Cyrus–Beck algorithm,
Liang–Barsky algorithm,
marching cubes,
Warnock algorithm,
Warnock's algorithm,
algo,
Ramer-Douglas-Peucker algorithm,
compressed sensing,
Hosaka-Cohen transformation,
cocluster,
more...
▸ Words similar to Cohen-Sutherland algorithm
▸ Usage examples for Cohen-Sutherland algorithm
▸ Idioms related to Cohen-Sutherland algorithm
▸ Wikipedia articles (New!)
▸ Words that often appear near Cohen-Sutherland algorithm
▸ Rhymes of Cohen-Sutherland algorithm
▸ Invented words related to Cohen-Sutherland algorithm