mainpage.userdoc 2.16 KB
 Matthias Möller committed Oct 26, 2012 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 /** \mainpage Documentation for Decimater Plugin \section Summary Decimates a given mesh to a low poly mesh. \ref quick_tutorial \ref decimater : \li \ref incremental \li \ref multiple_choice \li \ref mixed \section quick_tutorial Quick Tutorial First select one of the \ref decimater . The \ref incremental provides the best quality, while the \multiple_choice is the fastest one. Now, you can choose your constraints and the decimation order. Don't forget to define stop conditions. If done, press Initialize and then Decimate. After pressing "Initialize" or Decimate, it is possible to change the constraints' values and decimate again having the original error quadrics of you mesh. Otherwise, by adding or removing contraints, you have to reinitialize the decimater. This will update the error quadrics, so the next decimatation might be less accurate. Also, changing the \ref decimater, or the Decimition Order, will cause a reinitialization. \note The Initialization saves the error quadric of each vertex. They will not be updated, until Initialize is pressed again. \section decimater Decimater \subsection incremental Incremental Decimater The incremental decimater checks and takes each iteration the best collapse. So, this decimater is the first choice for the best results, but might be slow. Use \ref multiple_choice or \ref mixed to get faster, but less accurate results. \subsection multiple_choice Multiple Choice Decimater The multiple choice decimater checks #Random Samples and takes the best one for the next collapse. As there is no heap involved, this is faster than the incremental decimater but as it is randomized, the result is not guarantied to be the best, but still inside the specified constraints. \subsection mixed Mixed Decimater Uses Multiple Choice Decimater and Incremental Decimater to get good and fast results as possible. This decimater uses several steps of the Multiple Choice Decimater with increasing constraint threshold. When 80% of the maximal error are reached or 80% of the collapses have been performed, it switches back to the Incremental Decimater to do the rest. */