SGI algorithm
The SGI algorithm creates triangle strips from a set of triangles. It was published by K. Akeley, P. Haeberli, and D. Burns as a C program named "tomesh.c" for use with Silicon Graphics' IRIS GL API. The algorithm operates on the set of triangles that have not yet been added to a triangle strip, starting with the entire set of input triangles. Triangles are greedily added to a strip until no triangle is available that can be appended to the strip; a new strip will be started in this case. When choosing a triangle for starting or continuing a triangle strip, the selection is based on a triangle's degree (i.e. the number of triangles adjacent to it), with smaller degrees being preferred.
- Comment
- enThe SGI algorithm creates triangle strips from a set of triangles. It was published by K. Akeley, P. Haeberli, and D. Burns as a C program named "tomesh.c" for use with Silicon Graphics' IRIS GL API. The algorithm operates on the set of triangles that have not yet been added to a triangle strip, starting with the entire set of input triangles. Triangles are greedily added to a strip until no triangle is available that can be appended to the strip; a new strip will be started in this case. When choosing a triangle for starting or continuing a triangle strip, the selection is based on a triangle's degree (i.e. the number of triangles adjacent to it), with smaller degrees being preferred.
- Has abstract
- enThe SGI algorithm creates triangle strips from a set of triangles. It was published by K. Akeley, P. Haeberli, and D. Burns as a C program named "tomesh.c" for use with Silicon Graphics' IRIS GL API. The algorithm operates on the set of triangles that have not yet been added to a triangle strip, starting with the entire set of input triangles. Triangles are greedily added to a strip until no triangle is available that can be appended to the strip; a new strip will be started in this case. When choosing a triangle for starting or continuing a triangle strip, the selection is based on a triangle's degree (i.e. the number of triangles adjacent to it), with smaller degrees being preferred. If implemented using a priority queue to quickly identify triangles that can start a new strip, the algorithm runs in linear time.
- Is primary topic of
- SGI algorithm
- Label
- enSGI algorithm
- Link from a Wikipage to another Wikipage
- C (programming language)
- Category:Computer graphics algorithms
- Category:SGI graphics
- Greedy algorithm
- IRIS GL
- Silicon Graphics International
- Triangle strip
- SameAs
- HKU5
- m.0g9wzjp
- Q1254117
- SGI algorithm
- SGI-algoritmus
- Subject
- Category:Computer graphics algorithms
- Category:SGI graphics
- WasDerivedFrom
- SGI algorithm?oldid=984498275&ns=0
- WikiPageLength
- 1401
- Wikipage page ID
- 30547939
- Wikipage revision ID
- 984498275