Model courtesy of Cyberware;
Parameterized by SPAM
(written by Igor Guskov and Kiril Vidimce)

I spent the 1999 summer and winter at Caltech's Multi-Res group working with Peter Schröder, Mathieu Desbrun, Igor Guskov, and Wim Sweldens. During the summer, I investigated the process of remeshing and implemented an improved version of the MAPS algorithm that uses a more robust simplification method based on Garland's Quadric Error Metric. Over the winter, I contributed to the development of parameterless meshes. The paper in which we report this work is currently under review.

While at Caltech, I read, glanced at, and collected numerous papers that I believe to be pertinent to meshes, construction of parameterizations, and remeshing. As a service to the community, I hereby provide links to both original locations and local copies of the papers. Many of the papers are stored locally due to the high volatility of the Web.

Papers

  • Meshes, Multiresolution Meshes, Subdivision

    • Tony D. DeRose, Michael Lounsbery, Joe Warren. "Multiresolution Analysis for Surfaces of Arbitrary Topological Type." Department of Computer Science and Engineering, University of Washington Technical Report TR 93-10-05, October 29, 1993. (Postscript)

    • M. Eck, T. DeRose, T. Duchamp, H. Hoppe, M. Lounsbery, and W. Stuetzle, "Multiresolution analysis of arbitrary meshes," Computer Graphics (SIGGRAPH 1995 Proceedings), pages 173-182. (PDF)

    • Apostol Natsev, "Multiresolution Wavelet Representations for Arbitrary Meshes," Comp 234 Final Paper, Duke University, Spring 1997. (Postscript)

    • Aaron Lee and David Dobkin and Wim Sweldens and Peter Schroeder, "Multiresolution Mesh Morphing," Proceedings of SIGGRAPH 99, Computer Graphics Proceedings, Annual Conference Series, pp. 343-350 (August 1999, Los Angeles, California). Addison Wesley Longman. Edited by Alyn Rockwood. ISBN 0-20148-560-5. (PDF)

    • Igor Guskov and Wim Sweldens and Peter Schroeder. "Multiresolution Signal Processing for Meshes," Proceedings of SIGGRAPH 99, Computer Graphics Proceedings, Annual Conference Series, pp. 325-334 (August 1999, Los Angeles, California). Addison Wesley Longman. Edited by Alyn Rockwood. ISBN 0-20148-560-5. (PDF)

    • Desbrun, M., Meyer, M., Schroeder, P., and Barr, A. H., "Implicit Fairing of Irregular Meshes Using Diffusion and Curvature Flow." Proceedings of SIGGRAPH 99, 317--324. (PDF)

    • Adi Levin. "Interpolating Nets of Curves by Smooth Subdivision Surfaces," Proceedings of SIGGRAPH 99, Computer Graphics Proceedings, Annual Conference Series, pp. 57-64 (August 1999, Los Angeles, California). Addison Wesley Longman. Edited by Alyn Rockwood. ISBN 0-20148-560-5. (PDF)

    • Denis Zorin and Peter Schroeder and Wim Sweldens. Interactive Multiresolution Mesh Editing, Proceedings of SIGGRAPH 97, Computer Graphics Proceedings, Annual Conference Series, pp. 259-268 (August 1997, Los Angeles, California). Addison Wesley. Edited by Turner Whitted. ISBN 0-89791-896-7. (PDF)

    • Joerg Peters and Ulrich Reif, "The Simplest Subdivision Scheme for Smoothing Polyhedra," ACM Transactions on Graphics, 16(4), pp. 420-431 (October 1997). ISSN 0730-0301. (PDF)

    • M. A. Duchaineau, M. Wolinsky, D. E. Sigeti, M. C. Miller, C. Aldrich, M. Mineev, "ROAMing Terrain: Real-time Optimally Adapting Meshes," Visualization 97. (PDF)

  • Simplification

    • Paul Heckbert and Michael Garland, "Survey of Polygonal Surface Simplification Algorithms." This draft appeared in the SIGGRAPH 97 course notes. The final revision will be published as a CMU-CS Technical Report. (PDF)

    • David Luebke, "A Survey of Polygonal Simplification Algorithms", UNC Department of Computer Science Technical Report #TR97-045, December, 1997. (Postscript)

    • Michael Garland, "Quadric-Based Polygonal Surface Simplification," Ph.D. Thesis, Carnegie Mellon University, May 1999. (PDF)

    • Michael Garland and Paul S. Heckbert, "Simplifying Surfaces with Color and Texture using Quadric Error Metrics," IEEE Visualization '98, pp. 263-270 (October 1998). IEEE. Edited by David Ebert and Hans Hagen and Holly Rushmeier. ISBN 0-8186-9176-X. (PDF)

    • Michael Garland and Paul S. Heckbert, "Surface Simplification Using Quadric Error Metrics, Proceedings of SIGGRAPH 97," Computer Graphics Proceedings, Annual Conference Series, pp. 209-216 (August 1997, Los Angeles, California). Addison Wesley. Edited by Turner Whitted. ISBN 0-89791-896-7. (PDF)

    • H. Hoppe, "New quadric metric for simplifying meshes with appearance attributesa," IEEE Visualization 1999, October 1999, pages 59-66. (PDF)

    • Leif Kobbelt and Swen Campagna and Hans-Peter Seidel. A General Framework for Mesh Decimation, Graphics Interface '98, pp. 43-50 (June 1998). Edited by Kellogg Booth and Alain Fournier. ISBN 0-9695338-6-1. (PDF)

    • Julie C. Xia and Amitabh Varshney. "Dynamic View-Dependent Simplification for Polygonal Models," IEEE Visualization '96, pp. 327-334 (October 1996). IEEE. Edited by Roni Yagel and Gregory M. Nielson. ISBN 0-89791-864-9. (PDF)

    • M. Reddy (1996). "SCROOGE: Perceptually-Driven Polygon Reduction". Computer Graphics Forum, 15(4):191-203. (PDF)

  • Computational Geometry, Data Structures

    • John Keyser, "Robustness Issues in Computational Geometry," Comp 234 Final Paper, Duke University, Spring 1997. (Postscript)

    • Herbert Edelsbrunner and Ernst P. Muecke, "Three-Dimensional Alpha Shapes," ACM Transactions on Graphics, 13 (1), pp. 43-72 (January 1994). ISSN 0730-0301. (Postscript)

    • Herbert Edelsbrunner and Ernst Peter Muecke. "Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms," ACM Transactions on Graphics, 9 (1), pp. 66-104 (January 1990). ISSN 0730-0301. (Postscript)

    • Ernst Muecke, "A Robust Implementation for 3D Delaunay Triangulations," International Journal of Computational Geometry & Applications, 8(2):255-276, 1998. (Postscript)

    • Ernst Muecke, Isaac Saias, Binhai Zhu, "Fast Randomized Point Location Without Preprocessing in 2&3D Delaunay Triangulations." Computational Geometry: Theory & Applications. (Postscript)

    • Jonathan Richard Shewchuk, "Robust Adaptive Floating-Point Geometric Predicates," Proceedings of the Twelfth Annual Symposium on Computational Geometry (Philadelphia, Pennsylvania), pages 141-150, Association for Computing Machinery, May 1996. (Postscript)

    • Jonathan Richard Shewchuk, "Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates," Discrete & Computational Geometry 18(3):305-363, October 1997. (Available here as Technical Report CMU-CS-96-140, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, May 1996.) (Postscript)

  • Parameterizations

    • Chakib Bennis, Jean-Marc Vezien, Gerard Iglesias, "Piecewise Surface Flattening for non Distorted Texture Mapping," ACM Siggraph Conference, Las Vegas (USA), 1989. (Postscript)

    • Swen Campagna and Hans-Peter Seidel, "Parameterizing Meshes with Arbitrary Topology," University of Erlangen, Computer Graphics Group. (Postscript)

    • T. Duchamp, A. Certain, A. DeRose and W. Stuetzle, "Hierarchical Computation of PL harmonic Embeddings," preprint, July, 1997. (PDF)

    • Michael S. Floater, "Parametrization and smooth approximation of surface triangulations," Computer Aided Geometric Design, 14(3), pp. 231-250 (1997). Elsevier Science. ISSN 0167-8396. (Postscript)

    • M. S. Floater, "Parametric tilings and scattered data approximation," International Journal of Shape Modeling 4 (1998), 165-182. (Postscript)

    • K. Hormann, G. Greiner, S. Campagna, "Hierarchical Parametrization of Triangulated Surfaces," Erlangen Workshop '99: Vision, Modeling, and Visualization, 1999. (Postscript)

    • K. Hormann, G. Greiner, "MIPS - an efficient global parametrization method, " Technical Report 27/1998, University of Erlangen. (Postscript)

    • Bruno Levy and Jean-Laurent Mallet. "Non-Distorted Texture Mapping for Sheared Triangulated Meshes," Proceedings of SIGGRAPH 98, Computer Graphics Proceedings, Annual Conference Series, pp. 343-352 (July 1998, Orlando, Florida). Addison Wesley. Edited by Michael Cohen. ISBN 0-89791-999-8. (PDF)

  • Point Location

    • Brown, P. J. C., and Faigle, C. T., "A Robust Efficient Algorithm for Point Location in Triangulations." Tech. rep., Cambridge University, February 1997. (Postscript)

  • Geodesics

    • Mark Lanthier, Anil Maheshwari, Joerg-Ruediger Sack, "Approximating Weighted Shortest Paths on Polyhedral Surfaces," Proceedings of the Thirteenth Annual Symposium on Computational Geometry, June 4-6, 1997, Nice, France, pp. 274-283, ACM Press, 1997, ISBN 0-89791-878-9. (Postscript)

    • Mark Lanthier, Anil Maheshwari, Joerg-Ruediger Sack, "Approximating Weighted Shortest Paths on Polyhedral Surfaces," TR-96-32, Carleton University, 1996. (Postscript)

    • R. Kimmel and J. A. Sethian, "Computing Geodesic Paths on Manifolds," Proc. Natl. Acad. Sci., USA, Vol. 95, pp. 8431-8435, July 1998. (PDF)

  • Remeshing

    • Aaron W. F. Lee and Wim Sweldens and Peter Schrder and Lawrence Cowsar and David Dobkin. "MAPS: Multiresolution Adaptive Parameterization of Surfaces," Proceedings of SIGGRAPH 98, Computer Graphics Proceedings, Annual Conference Series, pp. 95-104 (July 1998, Orlando, Florida). Addison Wesley. Edited by Michael Cohen. ISBN 0-89791-999-8. (PDF)

    • Leif P. Kobbelt and Jens Vorsatz and Ulf Labsik and Hans-Peter Seidel. "A Shrink Wrapping Approach to Remeshing Polygonal Surfaces," Computer Graphics Forum, 18(3), pp. 119-130 (September 1999). Blackwell Publishers. ISSN 1067-7055. (PDF)

    • Venkat Krishnamurthy and Marc Levoy. "Fitting Smooth Surfaces to Dense Polygon Meshes," Proceedings of SIGGRAPH 96, Computer Graphics Proceedings, Annual Conference Series, pp. 313-324 (August 1996, New Orleans, Louisiana). Addison Wesley. Edited by Holly Rushmeier. ISBN 0-201-94800-1. (HTML, PDF)

  • Numerical Methods

    • Jonathan Richard Shewchuk, "An Introduction to the Conjugate Gradient Method Without the Agonizing Pain," August 1994. (Postscript, Figures)

Created by Kiril Vidimce, January 2000