Stripifier

[GoogleCodeExporter]

Triangle strips require fewer indices due to implicit connectivity. This could 
halve the number of indices required. One downside is that you have to deal 
with restarts and/or degenerate triangles.

One benefit from the implicit connectivity is that it gives you a convenient 
way to perform parallelogram prediction, which should be better than delta.

Original issue reported on code.google.com by wonchun on 13 Aug 2011 at 3:04

[GoogleCodeExporter]

Original comment by wonchun on 13 Aug 2011 at 3:08

• Added labels: Type-Enhancement
• Removed labels: Type-Defect

[GoogleCodeExporter]

To some extent, the edge back reference approach in obj2utf8x r97 is a 
superior, less coupled approach than actually implementing triangle strips.

With this more general approach, we can look at the problem of triangle 
ordering a bit more generally. For example, we can turn this problem into a 
travelling salesman problem, which has a reasonable heuristic solution based on 
minimum spanning trees. The sketch of the idea would be to examine the dual 
graph of the triangle mesh where edges connect triangles based on how expensive 
the parallelogram prediction would be. Optimizing for TSP on this graph would 
minimize the residues of parallelogram prediction (probably the L1 norm).

Original comment by wonchun on 18 Aug 2012 at 10:57

• Changed state: Started
• Added labels: Priority-Low
• Removed labels: Priority-Medium