This patch adds a new algorithm for mesh optimization. It's tuned for heightmaps, tiles in particular.
How it differs from the usual ones (such as the many ones in the irrExt repo):
- it is intended to be lossless
- it takes extra care around the mesh borders
These qualities let it be run on just about any static mesh. The main use for me is heightmap mesh tiles - if there are planar areas, this saves triangles and verts. The other common use is bad 3d art; you know what I'm talking about, a straight wall that has 60 tris when it should have 2.
The latter use case is somewhat hampered by the border code, but of course one should be teaching the artists, not post-processing their work
Heightmap tile before - after:
Note how the borders don't change. It still tiles seamlessly without T-junctions.
Example when run on a mesh, too tesselated cube:
In this case, you can see how it's lossless, but not as good as it could be. There are two parts to this, the mentioned border limit, and the fact the algorithm is pass-based - it does not run until stabilization. If you need the finest models, you should run it 4-5 times.
For Minecraft-style worlds, having the cube like above, avoiding T-junctions, would still be desirable of course.
PS: I do think the irrext simplification methods should be merged. They're self-sufficient and useful for lossy LOD.