Open GoogleCodeExporter opened 9 years ago
Original comment by wonchun
on 13 Aug 2011 at 3:08
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
Original issue reported on code.google.com by
wonchun
on 13 Aug 2011 at 3:04