Feature-Preserving and Memory-Efficient Simplification of Polygonal Meshes

M. Hussain, Y. Okada, and K. Niijima

References

  1. [1] W.J. Schroeder, J.A. Zarge, & W.E. Lorenson, Decimation oftriangle meshes, Computer Graphics, 26(2), 1992, 65–70. doi:10.1145/142920.134010
  2. [2] M. Algorri & F. Schmitt, Mesh simplification, ComputerGraphics Forum, 15(3), 1996, 77–86. doi:10.1111/1467-8659.1530077
  3. [3] A. Gu´eziec, Locally toleranced surface simplification, IEEETrans. on Visualization and Computer Graphics, 5(2), 1999,168–189. doi:10.1109/2945.773810
  4. [4] P. Lindstrom & G. Turk, Fast and memory efficient polygonalsimplification, Proc. IEEE Visualization ’98, 1998, NorthCarolina, 279–286.
  5. [5] H. Hoppe, Progressive meshes, Proc. SIGGRAPH’96, NewOrleans, 1996, 99–108. doi:10.1145/237170.237216
  6. [6] J. Cohen, A. Varshney, D. Manocha, G. Turk, H. Weber,P. Agarwal, F. Brooks, & W. Wright, Simplification envelopes,Proc. SIGGRAPH’96, 1996, New Orleans, 119–128.
  7. [7] M. Garland & P.S. Heckbert, Surface simplification usingquadric error metric, Proc. SIGGRAPH’97, 1997, Los Angeles,209–216.
  8. [8] A. Ciampalini, P. Cignoni, C. Montani, & R. Scopigno,Multiresolution decimation based on global error, The VisualComputer, 13, 1997, 228–246. doi:10.1007/s003710050101
  9. [9] M. Hussain, Y. Okada, & K. Niijima, A fast and memory-efficient method for LOD modeling of polygonal models, Proc. GMAG03 (London: IEEE Computer Society Press, 2003), 137–142.
  10. [10] M. Hussain, Y. Okada, & K. Niijima, LOD modeling ofpolygonal models based on multiple choice optimization, Proc.MMM04, Brisbane, Australia, 2004, 203–210.
  11. [11] J. Wu & L. Kobbelt, Fast mesh decimation by multiple-choicetechniques, Proc. Vision, Modeling, and Visualization 2002,Erlangen, Germany, 2002, 241–248.
  12. [12] L. Kobbelt, S. Campagna, & H.P. Seidel, A general frameworkfor mesh decimation, Proc. Graphics Interface ’98, 1998,Vancouver, B.C., 311–318.
  13. [13] S.J. Kim, C.H. Kim, & D. Levin, Surface simplification usinga discrete curvature norm, Computers and Graphics, 26, 2002,657–663. doi:10.1016/S0097-8493(02)00121-8
  14. [14] M. Hussain, Y. Okada, & K. Niijima, Fast, simple, feature-preserving and memory efficient simplification of trianglemeshes, International Journal of Image and Graphics, 3(4),2003, 1–18. doi:10.1142/S021946780300124X
  15. [15] P. Heckbert & M. Garland, Survey of surface simplificationalgorithms, Technical report, Carnegie-Mellon University, De-partment of Computer Science, 1997.
  16. [16] P. Cignoni, C. Montani, & R. Scopigno, A comparison of meshsimplification algorithms, Computer & Graphics, 22(1), 1998,37–54. doi:10.1016/S0097-8493(97)00082-4
  17. [17] P. Cignoni, C. Rocchini, & R. Scopigno, Metro: Measuringerror on simplified surfaces, Computer Graphics Forum, 17(2),1998, 167–174. doi:10.1111/1467-8659.00236

Important Links:

Go Back