Polygon Mesh Processing Library
Loading...
Searching...
No Matches
Bibliography
[1]

Marc Alexa and Max Wardetzky. Discrete laplacians on general polygonal meshes. ACM Transactions on Graphics, 30(4), 2011.

[2]

Mario Botsch and Leif Kobbelt. A remeshing approach to multiresolution modeling. In Proceedings of Eurographics Symposium on Geometry Processing, pages 189–96, 2004.

[3]

Mario Botsch, Leif Kobbelt, Mark Pauly, Pierre Alliez, and Bruno Lévy. Polygon Mesh Processing. AK Peters, 2010.

[4]

Astrid Bunge, Philipp Herholz, Misha Kazhdan, and Mario Botsch. Polygon laplacian made simple. Computer Graphics Forum, 39(2), 2020.

[5]

Edwin Catmull and James Clark. Recursively generated b-spline surfaces on arbitrary topological meshes. Computer-Aided Design, 10(6):350–355, 1978.

[6]

David Cohen-Steiner and Jean-Marie Morvan. Restricted delaunay triangulations and normal cycle. In Proceedings of the Nineteenth Annual Symposium on Computational Geometry, pages 312–321, 2003.

[7]

Keenan Crane, Clarisse Weischedel, and Max Wardetzky. Geodesics in heat: A new approach to computing distance based on heat flow. ACM Transactions on Graphics, 32(5), 2013.

[8]

Mathieu Desbrun, Mark Meyer, , Peter Schröder, and Alan H. Barr. Implicit fairing of irregular meshes using diffusion and curvature flow. In Proceedings of SIGGRAPH, pages 317–324, 1999.

[9]

Mathieu Desbrun, Mark Meyer, and Pierre Alliez. Intrinsic parameterizations of surface meshes. Computer Graphics Forum, 21(3):209–218, 2002.

[10]

Marion Dunyach, David Vanderhaeghe, Loïc Barthe, and Mario Botsch. Adaptive remeshing for real-time mesh deformation. In Eurographics 2013 - Short Papers, pages 29–32, 2013.

[11]

Michael Garland and Paul Seagrave Heckbert. Surface simplification using quadric error metrics. In Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH '97, pages 209–216, 1997.

[12]

Misha Kazhdan, Justin Solomon, and Mirela Ben-Chen. Can mean-curvature flow be modified to be non-singular? Computer Graphics Forum, 31(5), 2012.

[13]

Ron Kimmel and James Albert Sethian. Computing geodesic paths on manifolds. Proceedings of the National Academy of Sciences, 95(15):8431–8435, 1998.

[14]

Leif Kobbelt, Swen Campagna, and Hans-Peter Seidel. A general framework for mesh decimation. In Proceedings of Graphics Interface, pages 43–50, 1998.

[15]

Peter Liepa. Filling holes in meshes. In Proceedings of Eurographics Symposium on Geometry Processing, pages 200–205, 2003.

[16]

Charles Teorell Loop. Smooth subdivision surfaces based on triangles. Master's thesis, University of Utah, Department of Mathematics, 1987.

[17]

Bruno Lévy, Sylvain Petitjean, Nicolas Ray, and Jérome Maillot. Least squares conformal maps for automatic texture atlas generation. ACM Transaction on Graphics, 21(3):362–371, 2002.

[18]

Mark Meyer, Mathieu Desbrun, Peter Schröder, and Alan H. Barr. Discrete differential-geometry operators for triangulated 2-manifolds. In Visualization and Mathematics III, pages 35–57. 2003.

[19]

Scott Meyers. Effective C++. Addison-Wesley Professional, 2005.

[20]

Scott Meyers. Effective Modern C++. O'Reilly, 2014.

[21]

Daniel Sieger and Mario Botsch. Design, implementation, and evaluation of the surface_mesh data structure. In William Roshan Quadros, editor, Proceedings of the 20th International Meshing Roundtable, pages 533–550, Berlin, 2011. Springer-Verlag.

[22]

Jos Stam and Charles Loop. Quad/triangle subdivision. Computer Graphics Forum, 22(1), 2003.

[23]

Herb Sutter and Andrei Alexandrescu. C++ Coding Standards: 101 Rules, Guidelines, and Best Practices. Addison-Wesley Professional, 2004.

[24]

Cha Zhang and Tsuhan Chen. Efficient feature extraction for 2d/3d objects in mesh representation. In Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205), 2002.