Talk:Triangle strip

This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Computing Low‑importance This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing Low This article has been rated as Low-importance on the project's importance scale. Computer graphics Mid‑importance This article is within the scope of WikiProject Computer graphics, a collaborative effort to improve the coverage of computer graphics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer graphicsWikipedia:WikiProject Computer graphicsTemplate:WikiProject Computer graphicscomputer graphics Mid This article has been rated as Mid-importance on the project's importance scale.

glBegin, glVertex, and glEnd got deprecated in OpenGL 3.0. They still work, but most of the OpenGL section may become unusable in the future. Todayman (talk) 01:13, 4 May 2009 (UTC)Reply

I'm missing a corresponding page on triangle fan. On the other hand, it will have a lot in common with this page. Mauritsmaartendejong 18:21, 25 June 2007 (UTC)Reply

"Fortunately, OpenGL will automatically rearrange the vertices in a triangle strip to make all of the triangles in the strip consistently clockwise or counterclockwise[2], depending on the value of glFrontFace()" -- This is wrong. OpenGL determines the winding from the first triangle in the strip. glFrontFace() determines whether front- or backfacing triangles are culled. For a triangle strip, this means that either all triangles in the strip are visible, or none (depending on whether the first one is). —Preceding unsigned comment added by 91.35.148.81 (talk) 15:26, 20 December 2007 (UTC)Reply

"The use of polygon strips in products distributed in the United States prior to December 4, 2014, may be subject to a patent owned by General Electric Company" I'm sure GE would wish. But, I'm sorry... this is just FUD. This (rather debatable) patent refers to a "special method" of generating triangle strips from a model in a CAD software, such as from isosurfaces or volumetric data. Besides, the document does not describe any novel invention or anything but the obvious trivial procedure that you can find in books from the 1960s. Triangle strips as such are not only not claimed by the patent, they had been invented long before the patent was filed, and were widely supported in hardware at that time. —Preceding unsigned comment added by 91.35.148.81 (talk) 15:56, 20 December 2007 (UTC)Reply

"...could also be represented as ABCDDFFEDC, which would be interpreted as triangles ABC CBD CDD DDF DFF FFE FED DEC.." I am far from an expert - just learning this stuff myself, but I suspect a typo here. Shouldn't the interpretation be ABC CBD CDD DDF FDF FFE FED DEC? Just flagging for a more knowledgeable editor to verify. Irephin (talk) 07:16, 29 September 2011 (UTC)Reply

A TriangleStrip should look like this: http://www.opengl.org/resources/code/samples/sig99/advanced99/notes/img11.gif and not like this: http://upload.wikimedia.org/wikipedia/en/a/ac/Triangle_Strip_In_OpenGL.gif — Preceding unsigned comment added by 77.21.206.168 (talk) 21:16, 4 November 2011 (UTC)Reply

A picture representation of the degenerate strip example would be nice, with the lines that the degenerate triangles define marked (as two of the vertices are the same), and the order that the triangles (or degenerate lines) in the strip are defined shown. But this optimally should be done with the program used to create the first, non-degenerate example, which is why I don't do it.. Yet anyway. 216.9.142.231 (talk) 19:26, 18 October 2011 (UTC)JimReply

"Optimally grouping a set of triangles into sequential strips has been proven NP-complete.[9]"

This sounds wrong. The optimization problem seems to be NP-Hard. The reference proves NP-completeness of the decision problem, not the optimization problem.

Max (talk) 07:45, 9 July 2013 (UTC)Reply