Teaching meshes, subdivision and multiresolution techniques

CAD Computer Aided Design

Volumn 36, Issue 14, 2004, Pages 1483-1500

  Bischoff, Stephan ^a   Kobbelt, Leif ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Geometry processing; Teaching curriculum

Indexed keywords

GEOMETRY PROCESSING; MULTIRESOLUTION TECHNIQUES; TEACHING CURRICULUM; TEACHING MESHES;

ALGORITHMS; COMPUTER AIDED MANUFACTURING; COMPUTER GRAPHICS; COMPUTER SIMULATION; GEOMETRY; MEDICAL IMAGING; TEACHING; TECHNICAL PRESENTATIONS;

COMPUTER AIDED DESIGN;

EID: 4444350421     PISSN: 00104485     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cad.2003.11.007     Document Type: Article

References (107)

1. Baumgart BG. A polyhedron representation for computer vision. In: National Computer Conference; 1975. p. 589-96.
2. Campagna S., Kobbelt L., Seidel H.-P. Directed edges - s scalable representation for triangle meshes. J Graph Tools. 3:(4):1998;1-12.
3. Kettner L. Designing a data structure for polyhedral surfaces. In: Proceedings of the 14th ACM Symposium on Computational Geometry; 1998. p. 146-54.
4. Mantila M. An introduction to solid modeling. 1988;Computer Science Press, Maryland.
5. Weiler K. The radial edge structure: a topological representation fornon-manifold geometric boundary modeling. In: Geometric Modeling for CAD Applications; 1998.
6. Zorin D., et al. Subdivision for modeling and animation. SIGGRAPH 00 Course Notes; 2000.
7. Amenta N, Bern M, Kamvysselis M. A new voronoi-based surface reconstruction algorithm. In: SIGGRPAH 1998 Proceedings; 1998. p. 415-22.
8. de Berg M., van Krefeld M., Overmars M., Schwarzkopf O. Computational geometry. 2000;Springer, Berlin.
9. Edelsbrunner H., Mucke E.P. Three-dimensional alpha shapes. ACM Trans Graph. 13:1994;43-72.
10. Fortune S. A sweepline algorithm for voronoi diagrams. Algorithmica. 2:1987;153-174.
11. Guibas L., Stolfi J. Primitives for the manipulation of general subdivisions and the computation of voronoi diagrams. ACM Trans Graph. 4:1985;74-123.
12. Shewchuk J.R. Delaunay refinement algorithms for triangular mesh generation. Comput Geom: Theory Appl. 22:(1-3):2002;21-74.
13. Qhull, http://www.thesa.com/software/qhull/.
14. Gibson SFF. Using distance maps for accurate surface reconstruction in sampled volumes. In: IEEE Volume Visualization Symposium; 1998. p. 23-30.
15. Ju T, Losasso F, Schaefer S, Warren J. Dual contouring of hermite data. In: Siggraph 02 Proceedings; 2002. p. 339-46.
16. Kobbelt L, Botsch M, Schwanecke U, Seidel H.-P. Feature sensitive surface extraction from volume data. In: SIGGRAPH 01 Proceedings; 2001. p. 57-66.
17. Lorensen WE, Cline HE. Marching cubes: a high resolution 3d surface reconstruction algorithm. In: SIGGRAPH 87 Proceedings; 1987. p. 163-69.
18. Amenta N, Choi S, Kolluri R. The power crust. In: Sixth ACM Symposium on Solid Modeling and Applications; 2001. p. 249-60.
19. Curless B, Levoy M. A volumetric method for building complex models from range images. In: SIGGRAPH 96 Proceedings; 1996. p. 303-12.
20. Hoppe H, DeRose T, Duchamp T, McDonald J, Stuetzle J. Surface reconstruction from unorganized points. In: SIGGRAPH 92 Proceedings; 1992. p. 71-8.
21. Adamy U, Giesen J, John M. New techniques for topologically correct surface reconstruction. In: Proceedings of the 11th IEEE Visualization Conference (VIS); 2000. p. 373-80.
22. Amenta N., Bern M. Surface reconstruction by voronoi filtering. Discrete Comput Geom. 22:1999;481-504.
23. Garland M, Heckbert P. Surface simplification using quadric error metrics. In: SIGGRAPH 96 Proceedings; 1996. p. 209-16.
24. Gotsman C., Gumhold S., Kobbelt L. Simplification and compression of 3d-meshes. Iske A., Quak E., Floater M. Tutorials on multiresolution in geometric modeling. 2002;319-362 Springer, Berlin.
25. Hoppe H. Progressive meshes. In: SIGGRAPH 96 Proceedings; 1996. p. 99-108.
26. Kobbelt L, Campagna S, Seidel H.-P. A general framework for mesh decimation. In: Graphics Interface '98 Proceedings; 1998. p. 43-50.
27. Lindstrom P. Out-of-core simplification of large polygonal models. In: SIGGRAPH 00 Proceedings; 2000. p. 259-62.
28. Schroeder W, Zarge J, Lorensen W. Decimation of triangle meshes. In: SIGGRAPH 92 Proceedings; 1992. p. 65-70.
29. Hoppe H. View-dependent refinement of progressive meshes. In: SIGGRAPH 97 Proceedings; 1997. p. 189-98.
30. Kim J, Lee S. Truly selective refinement of progressive meshes. In: Graphics Interface Proceedings; 2001. p. 101-10.
31. Desbrun M, Meyer M, Schröder P, Barr AH. Implicit fairing of irregular meshes using diffusion and curvature flow. In: SIGGRAPH 99 Proceedings; 1999. p. 317-24.
32. Kobbelt L. Discrete fairing and variational subdivision for freeform surface design. The Visual Computer Journal 2000.
33. Taubin G. A signal processing approach to fair surface design. In: SIGGRAPH 95 Proceedings; 1995. p. 351-8.
34. Kobbelt L. Discrete fairing. In: Proceedings of the Seventh IMA Conference on the Mathematics of Surfaces; 1997. p. 101-31.
35. Carmo M.P.D. Differential geometry of curves and surfaces. 1976;Prentice Hall.
36. Cohen-Steiner D, Morvan J-M. Restricted delaunay triangulations and normal cycle. In: ACM Symposium on Computational Geometry; 2003. p. 237-46.
37. Dyn N, Hormann K, Kim S-J, Levin D. Optimizing 3d triangulations using discrete curvature analysis. In: Mathematical Methods for Curves and Surfaces: Oslo 2000; 2001. p. 135-46.
38. Hamann B. Curvature approximation for triangulated surfaces. In: Geometric modeling, computing supplement 8. 1993;Springer, Berlin. p. 139-53.
39. Polthier K., Schmies M. Straightest geodesics on polyhedral surfaces. In: Mathematical visualization. 1998;. p. 391.
40. Polthier K, Schmies M. Geodesic flow on polyhedral surfaces. In: Proceedings Joint EG-IEEE TCVG Symposium; 1999. p. 179-88.
41. Pinkall U., Polthier K. Computing discrete minimal surfaces and their conjugates. Exp Math. 2:(1):1993;15-36.
42. Desbrun M, Meyer M, Alliez P. Intrinsic parameterizations of surface meshes. In: Eurographics 02 Proceedings; 2002. p. 209-18.
43. Floater M.S. Parametrization and smooth approximation of surface triangulations. Comput Aid Geom Des. 14:1997;231-250.
44. Gu X, Gortler S, Hoppe H. Geometry images. In: SIGGRAPH 02 Proceedings; 2002. p. 355-61.
45. Lee AWF, Sweldens W, Schröder P, Cowsar L, Dobkin D. Maps: multiresolution adaptive parameterization of surfaces. In: SIGGRAPH 98 Proceedings; 1998. p. 95-104.
46. Levy B, Petitjean S, Ray N, Maillot J. Least squares conformal maps for automatic texture atlas generation. In: Siggraph 2002 Proceedings; 2002. p. 362-71.
47. Ray N, Levy B. Hierarchical least squares conformal maps, in: Pacific Graphics 03 Proceedings; 2003. p. 263-70.
48. Sander P, Snyder J, Gortler S, Hoppe H. Texture mapping progressive meshes. In: SIGGRAPH 01 Proceedings; 2001. p. 409-16.
49. Sander PV, Gortler SJ, Snyder J, Hoppe H. Signal-specialized parameterization; In: Eurographics Workshop on Rendering 2002 Proceedings; 2002. p. 87-100.
50. Sheffer A, de Sturler E. Surface parameterization for meshing by triangulation flattening. In: Proceedings of the Ninth International Meshing Roundtable; 2000. p. 161-72.
51. Sheffer A, Hart J. Seamster: inconspicuous low-distortion texture seam layout. In: IEEE Visualization Proceedings; 2002. p. 291-8.
52. Tutte W.T. How to draw a graph. Proc Lond Math Soc. 13:1963;743-768.
53. Garland M, Willmott A, Heckbert P. Hierarchical face clustering on polygonal surfaces. In: Proceedings of ACM Symposium on Interactive 3D Graphics; 2001. p. 49-58.
54. Floater M.S. Mean value coordinates. Comput Aid Geom Des. 20:2003;19-27.
55. Alliez P, Desbrun M. Progressive compression for lossless transmission of triangle meshes. In: SIGGRAPH 01 Proceedings; 2001. p. 195-202.
56. Gumhold S, Straßer W. Real time compression of triangle mesh connectivity. In: SIGGRAPH 98 Proceedings; 1998. p. 133-40.
57. Isenburg M, Snoeyink M. Face fixer: compressing polygon meshes with properties. In: SIGGRAPH 02 Proceedings; 2002. p. 263-70.
58. Rossignac J. Edgebreaker: connectivity compression for triangle meshes. IEEE Trans Vis Comput Graph. 5:(1):1999;47-61.
59. Touma C, Gotsman C. Triangle mesh compression. In: Graphics Interface; 1998. p. 26-34.
60. Taubin G, Gueziec A, Horn W, Lazarus F. Progressive forest split compression. In: SIGGRAPH 98 Proceedings; 1998. p. 123-32.
61. Guskov I, Vidimce K, Sweldens W, Schröder P. Normal meshes. In: SIGGRAPH 00 Proceedings; 2000. p. 95-102.
62. Khodakovsky A., Guskov I. Compression of normal meshes. In: Geometric modeling for scientific visualization. 2002;. p. 189-206.
63. Alliez P, Desbrun M. Valence-driven connectivity encoding of 3d meshes. In: Eurographics 2001 Conference Proceedings; 2001. p. 480-9.
64. Alliez P, Meyer M, Desbrun M. Interactive geometry remeshing. In: SIGGRAPH02 Proceedings; 2002. p. 347-54.
65. Eck M, DeRose T, Duchamp T, Hoppe H, Lounsbery M, Stuetzle W. Multiresolution analysis of arbitrary meshes. In: SIGGRAPH 95 Proceedings; 1995. p. 173-82.
66. Turk G. Re-tiling polygonal surfaces. In: SIGGRAPH 92 Proceedings; 1992. p. 55-64.
67. Surazhsky V, Gotsman C. Explicit surface remeshing. In: Symposium on Geometry Processing Proceedings; 2003. p. 20-30.
68. Kobbelt L, Vorsatz J, Labsik U, Seidel H-P. A shrink wrapping approach toremeshing polygonal surfaces. In: Eurographics 99 Proceedings; 1999. p. 119-30.
69. Alliez P, Cohen-Steiner D, Devillers O, Levy B, Desbrun M. Anisotropic polygonal remeshing. In: SIGGRAPH 03 Proceedings; 2003. p. 485-93.
70. Farin G. Curves land surfaces for CAGD. 2002;Morgan Kaufmann, Los Altos, CA.
71. Prautzsch H., Boehm W., Paluszny M. Bézier and B-spline techniques. 2002;Springer, Berlin.
72. Warren J.D., Weimer H. Subdivision methods for geometric design. 2001;Morgan Kaufman, Los Altos, CA.
73. Lane J.M., Riesenfeld R.F. A theoretical development for the computer generation and display of piecewise polynomial surfaces. IEEE Trans Pattern Anal Machine Intell. 2:(1):1980;35-46.
74. Dyn N., Levin D., Gregory J.A. A 4-point interpolatory subdivision scheme for curve design. Comput Aid Geom Des. 4:1987;257-268.
75. Doo D., Sabin M. Behaviour of recursive division surfaces near extraordinary points. Comput Aid Des. 10:1978;356-360.
76. Catmull E., Clark J. Recursively generated B-spline surfaces on arbitrary topological meshes. Comput Aid Des. 10:1978;350-355.
77. Kobbelt L. Interpolatory subdivision on open quadrilateral nets with arbitrary topology. Comput Graph Forum. 15:(3):1996;409-420.
78. Dyn N., Levin D., Gregory J.A. A butterfly subdivision scheme for surface interpolation with tension control. ACM Trans Graph. 9:(2):1990;160-169.
79. Zorin D, Schröder P, Sweldens W. Interpolating subdivision for meshes with arbitrary topology. In: SIGGRAPH 96 Proceedings; 1996. p. 189-92.
80. Loop CT. Smooth subdivision surfaces based on triangles. Master's Thesis, University of Utah, Department of Mathematics; 1987.
81. Kobbelt L. √3 subdivision. In: SIGGRAPH 00 Proceedings; 2000. p. 103-12.
82. Levin A. Combined subdivision schemes for the design of surfaces satisfying boundary conditions. Comput Aid Geom Des. 16:(5):1999;345-354.
83. Levin A. Interpolating nets of curves by smooth subdivision surfaces. In: SIGGRAPH 99 Proceedings; 1999. p. 57-64.
84. Zorin D, Biermann H, Levin A. Piecewise smooth subdivision surfaces with normal control. In: SIGGRAPH 00 Proceedings; 2000. p. 113-20.
85. de Boor C., Hoellig K., Riemenschneider S. Box splines. 1993;Springer, Berlin.
86. Prautzsch H., Boehm W. Box splines. Farin G., Hoschek J., Kim M.S. The handbook of computer aided geometric design. 2002;Elsevier, Amsterdam.
87. Cavaretta A., Dahmen W., Micchelli C. Stationary subdivision. Memoirs AMS 453. 1991.
88. Dyn N. Subdivision schemes in computer aided geometric design. In: Advances in numerical analysis II, wavelets, subdivision and radial functions. 1991;. p. 36-104.
89. Dyn N., Gregory J.A., Levin D. Analysis of uniform binary subdivision schemes for curve design. Constructive Approximation. 7:1991;127-147.
90. Taylor A. Advanced calculus. 1955;Ginn and Company.
91. Ball A.A., Storry D.T. Conditions for tangent plane continuity over recursively generated. ACM Trans Graph. 7:(2):1988;83-102.
92. Prautzsch H. Smoothness of subdivision surfaces at extraordinary points. Adv Comp Math. 9:1998;377-390.
93. Reif U. A unified approach to subdivision algorithms near extraordinary vertices. Comput Aid Geom Des. 12:(2):1995;153-174.
94. k continuity of subdivision surfaces. PhD Thesis, California Institute of Technology, Department of Computer Sciences; 1996.
95. Velho L., Zorin D. 4-8 subdivision. Comput Aid Geom Des, Special Issue Subdivision Techniques. 18:(5):2001;397-427.
96. Chui C.K. An introduction to wavelets (wavelet analysis and its applications). vol. 1:1992;Academic Press, New York.
97. Daubechies I. Ten lectures on wavelets. 1992;SIAM.
98. Strang G., Nguyen T. Wavelets and filter banks. 1996;Wellesley Cambridge.
99. Kobbelt L. Multiresolution techniques. Farin G., Hoschek J., Kim M.S. The handbook of computer aided geometric design. 2002;Elsevier, Amsterdam.
100. Schröder P, Sweldens W, Cohen M, DeRose T, Salesin D. Wavelets in computer graphics. Siggraph 96 Course Notes; 1996.
101. Sweldens W. The lifting scheme: a new philosophy in biorthogonal wavelet constructions. Laine A.F., Unser M. Wavelet applications in signal and image processing III. Proceedings SPIE 2569. 1995;68-79.
102. Sweldens W. The lifting scheme: a construction of second generation wavelets. SIAM J Math Anal. 29:(2):1997;511-546.
103. Guskov I, Sweldens W, Schröder P. Multiresolution signal processing formeshes. In: SIGGRAPH 99 Proceedings; 1999. p. 325-34.
104. Kobbelt L, Campagna S, Vorsatz J, Seidel H.-P. Interactive multi-resolution modeling on arbitrary meshes. In: SIGGRAPH 98 Proceedings; 1998. p. 105-14.
105. Zorin D, Schröder P, Sweldens W. Interactive multiresolution mesh editing. In: SIGGRAPH 97 Proceedings; 1997. p. 259-68.
106. CGAL - computational geometry algorithms library. http://www.cgal.org.
107. OpenMesh, http://www.openmesh.org.