The interface, modeling, 3d editing tools, import/export, feature requests, etc

Moderators: jesterKing, stiv

Post Reply
Posts: 0
Joined: Mon Oct 20, 2003 7:14 am


Post by leon » Mon Nov 03, 2003 2:03 am

Hi all,

Not sure how easy to code this is, so thought i'd just mention this in case no-one had suggested it before.

I've been using the subdivide then subsurf method to get nice rounded edges on objects - this works fine, but gives far more vertices than are really needed.

If you then use the decimator, it also decimates your nice rounded edges, which is not really what I want. Does anyone else think it would be nice to have an option for the decimator to only operate on co-planar faces (i.e. just the flat "useless" ones)?

Or is there an easy way to do this that I don't know about?



Posts: 289
Joined: Wed Oct 16, 2002 2:38 am

Post by z3r0_d » Mon Nov 03, 2003 4:35 am

if you don't set the decimator input number of triangles thigy too low it will not trash your triangles

that said, I wish I were working on a better decimator. I seem to have stopped working on it for other projects (mostly websites). Grr, and I am not really in the mindset to explain well how it would work here.

but essentially it would measure the angle across verticies or edges, and use that to determine if to (and what to) colapse so as to use fewer polygons. It would also be nice to have a minimum size option, and have it consider the uv mapping and rigging.

Posts: 16
Joined: Sun Oct 20, 2002 11:20 pm

Post by mmelo » Mon Nov 03, 2003 12:20 pm

z3r0_d wrote:It would also be nice to have a minimum size option, and have it consider the uv mapping and rigging.
Yeah, taking into account of uv mapping would be great... :)

Posts: 4
Joined: Fri Oct 18, 2002 11:17 am

Post by LoZaR » Tue Nov 25, 2003 11:12 am

I don't plan to do anything with this code for the time being if you would like to read up on the algorithm behind the implementation then check out: ... drics.html

The author also includes extensions to the algorithm to deal with other surface properties such as uv coordinates. Although I think Hoppe's algorithm is generally excepted as better (but more hassle to implement)

see "New quadric metric for simplifying meshes with appearance attributes."

It's also worth noting that the source code from the first algorithm is available as free software (but not under the GPL). Could be interesting to just ditch the current decimator sources and import his implementation.

As far as the original question - bizaarly dealing gracefully with flat polygonal areas is not something the current implementation deals at all well with (it's very easy to get flipped triangles). Although it should always decimate flat areas before curved areas.

The current implementation is very basic and there is lots of room for improvement.


Post Reply