RSimp

Simplification Through Refinement

Dmitry Brodsky and I have created a simplification algorithm that works by refining a very crude initial approximation. The algorithm is extremely fast, and linear for fixed output size. At the same time, it has good output quality, once the output model is larger than a few hundred polygons.

Software

RSimp 3.8 source is available. We do not warrantee this code in any way. Reads ply and smf models. Shouldn't be any platform dependencies. Written in C++ by Dmitry Brodsky. Does not adapt to mesh boundaries or attributes.

RSimp 3.9 is also available. Again, it works well for us, but no promises. Reads ply and smf, no platform dependencies. Updated in C++ by Prasun Choudhury and Andrew Raij. Improvements over 3.8: responds to mesh boundaries, and implements error based control of output quality/size.

These codes are made freely available for non-commercial use only. Commercial users should contact us about licensing.

Publications

D. Brodsky, B.A. Watson (2000). Model simplification through refinement (pdf). Proc. Graphics Interface (Montreal, May), 221-228.

D. Brodsky & B.A. Watson (2000). Model simplification for interactive applications. Poster (gif) and extended abstract, Proc. IEEE Virtual Reality 2000 conference, 286.

D. Brodsky & B.A. Watson (2000). Parallelization, small memories and model simplification (pdf). Proc. 11th Western Canadian Computer Graphics Symposium, (Panorama, Canada, March), 75-84.

D. Brodsky, B.A. Watson (1999). R-Simp: model simplification in reverse, a vector quantization approach (pdf). Proceedings 10th Western Canadian Computer Graphics Symposium, (Banff, Canada, March), 83-92.

D. Brodsky, B.A. Watson (1999). R-Simp: model simplification in reverse. Graphics Interface 99 conference poster abstracts, 39-40 (London, Canada, June).

Imagery

	Reverse simplification Because RSimp refines rather than simplifies, it produces drastic simplifications quite quickly, while other algorithms actually take longer to produce less output. Here, time vs. output size for RSimp, QSlim, and vertex clustering.
	Simplification of Stanford's dragon Quality is worse than the slower qslim's, but much better than with faster vertex clustering.