Sign in to follow this  

Mesh simplification: QSlim vs Others

This topic is 2667 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts


For the past few weeks, I was looking for an optimized Mesh simplification algorithm.
I tried with few simplifications algorithms(QSlim, Simplified Progressive mesh etc).
Each of the algorithms have their own merits and demrits. Infact there is a tradeoff between speed and mesh quality.

In particular, I found QSlim as the best Performing simplification algorithm among them. Though the quality of simplified is not appreciable, speed of the algorithm has no match.

I did some research to understand the QSlim algorithm.But I could not figure the reason for its high speed.

Now my question is why QSlim is faster than other algorithms?

I assume that, all mesh simplification algorithms work by collapsing the edges. difference lies in the error calculation for each collaspe.






Share this post


Link to post
Share on other sites
While I don't have a direct answer to your question (having not worked with QSlim and others) i found the following paper to be an excellent survey of mesh simplification. It explains the different type of algorithm (edge collapse isn't the only option):

A Developer's Survey of Polygonal Simplification Algorithms

Hope you find it useful, sorry I can't be of more direct help.

Share this post


Link to post
Share on other sites

This topic is 2667 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

Sign in to follow this