| Information | |
|---|---|
| has gloss | eng: Marching tetrahedrons is an algorithm in the field of computer graphics to render implicit surfaces. It was developed to circumvent a patent on the marching cubes algorithm. It also clarifies a minor ambiguity problem of marching cubes with some cube configurations. |
| lexicalization | eng: Marching Tetrahedrons |
| instance of | c/Computer graphics algorithms |
Lexvo © 2008-2026 Gerard de Melo. Contact Legal Information / Imprint