Triangle meshes are a flexible and generally accepted boundary representation for complex geometric shapes. In addition to their geometric qualities or topological simplicity, intrinsic qualities such as the shape of the triangles, their distribution on the surface and the connectivity are essential for many algorithms working on them. In this paper we present a flexible and efficient remeshing framework that improves these intrinsic properties while keeping the mesh geometrically close to the original surface. We use a particle system approach and combine it with an incremental connectivity optimization process to trim the mesh towards the requirements imposed by the user. The particle system uniformly distributes the vertices on the mesh, whereas the connectivity optimization is done by means of Dynamic Connectivity Meshes, a combination of local topological operators that lead to a fairly regular connectivity. A dynamic skeleton ensures that our approach is able to preserve surface features, which are particularly important for the visual quality of the mesh. None of the algorithms requires a global parameterization or patch layouting in a preprocessing step but uses local parameterizations only. In particular we will sketch several application scenarios of our general framework and we will show how the users can adapt the involved algorithms in a way that the resulting remesh meets their personal requirements.

Issue Section:
Application Briefs
Keywords:
mesh generation, computational geometry, optimisation, Remeshing, Dynamic Meshes, Multiresolution Modeling
Topics:
Algorithms, Modeling, Optimization, Particulate matter, Relaxation (Physics)
1.
Ju, T., Losasso, F., Schaefer, S., and Warren, J., 2002, “Dual Contouring of Hermite Data,” In SIGGRAPH 2002, pp. 339–346.
2.
Kobbelt, L., Botsch, M., Schwanecke, U., and H.-P. Seidel, 2001, “Feature-Sensitive Surface Extraction from Volume Data,” In SIGGRAPH 2001, pp. 57–66.
3.
Gotsman, C., Gumhold, S., and Kobbelt, L., 2002, “Simplification and Compression of 3D Meshes,” In Iske, A., Quak, E., and Floater, M. S. (eds), Tutorials on Multiresolution in Geometric Modelling, Springer, pp. 319–361.
4.
Eck, M., DeRose, T., Duchamp, T., Hoppe, H., Lounsbery, M., and Stuetzle, W., 1995, “Multiresolution Analysis of Arbitrary Meshes,” In SIGGRAPH 1995, pp. 173–182.
5.
Lee, A. W. F., Sweldens, W., Schro¨der, P., Cowsar, L., and Dobkin, D., 1998, “MAPS: Multiresolution Adaptive Parametrization of Surfaces,” In SIGGRAPH 1998, pp. 95–104.
6.
Guskov, I., Vidimce, K., Sweldens, W., and Schro¨der, P., 2000, “Normal Meshes,” In SIGGRAPH 2000, pp. 95–102.
7.
Kobbelt, L., Vorsatz, J., Labsik, U., and Seidel, H.-P., 1999, “A Shrink Wrapping Approach to Remeshing Polygonal Surfaces,” Eurographics 1999, pp. 119–130.
8.
Alliez, P., Meyer, M., and Desbrun, M., 2002, “Interactive Geometry Remeshing,” In SIGGRAPH 2002, pp. 347–354.
9.
Alliez, P., Verdie`re, E. C., Devillers, O., and Isenburg, M., 2003, “Isotropic Surface Remeshing,” In SMI Shape Modeling International.
10.
Alliez, P., Cohen-Steiner, D., Devillers, O., Le´vy, B., and Desbrun, M., 2003, “Anisotropic Polygonal Remeshing,” In SIGGRAPH 2003, pp. 485–493.
11.
Surazhsky, V., and Gotsman, C., 2003, “Explicit Surface Remeshing,” In EG Symposium on Geometry Processing, pp. 17–28.
12.
Surazhsky, V., Alliez, P., and Gotsman, C., 2003, “Isotropic Remeshing of Surfaces: A Local Parametrization Approach,” In 12th International Meshing Roundtable.
13.
Vorsatz, J., Ro¨ssl, C., Kobbelt, L., and Seidel, H.-P., 2001, “Feature Sensitive Remeshing,” In Eurographics 2001, pp. 393–401.
14.
Turk, G., 1992, “Re-Tiling Polygonal Surfaces,” In SIGGRAPH 1992, pp. 55–64.
15.
Welch, W., and Witkin, A., 1994, “Free-Form Shape Design using Triangulated Surfaces,” In SIGGRAPH 1994, pp. 247–256.
16.
Frey, P. J., and Borouchaki, H., 1998, “Geometric Surface Mesh Optimization,” Computing and Visualization in Science, 1, pp. 113–121.
17.
Kobbelt, L., Bareuther, T., and Seidel, H.-P., 2000, “Multiresolution Shape Deformations for Meshes with Dynamic Vertex Connectivity,” In Eurographics 2000, pp. 249–260.
18.
Floater, M. S., 1997, “Parametrization and Smooth Approximation of Surface Triangulations,” CAGD, 14(3), pp. 231–250.
19.
Floater, M. S., 2003, “Mean Value Coordinates,” CAGD, 20, pp. 19–27.
20.
Desbrun, M., Meyer, M., and Alliez, P., 2002, “Intrinsic Parametrizations of Surface Meshes,” In Eurographics 2002, pp. 209–218.
21.
Hormann, K., and Greiner, G., 2000, “MIPS: An Efficient Global Parametrization Method,” In Curve and Surface Design: Saint-Malo 1999, pp. 153–162.
22.
Sorkine, O., Cohen-Or, D., Goldenthal, R., and Lischinski, D., 2002, “Bounded-Distortion Piecewise Mesh Parametrization,” In IEEE Visualization 2002, pp. 355–362.
23.
Brown, P. J. C., and Faigle, C. T., 1996, “A Robust Efficient Algorithm for Point Location in Triangulations,” Technical report, Cambridge University.
24.
Ro¨ssl, C., Kobbelt, L., and Seidel, H.-P., 2001, “Recovering Structural Information from Triangulated Surfaces,” In Mathematical Methods for Curves and Surfaces: Oslo 2000, pp. 423–432.
25.
Le´vy, B., Petitjean, S., Ray, N., and Maillot, J., 2002, “Least Squares Conformal Maps for Automatic Texture Atlas Generation,” In SIGGRAPH 2002, pp. 362–371.
26.
Kobbelt, L., Campagna, S., Vorsatz, J., and Seidel, H.-P., 1998, “Interactive Multi–Resolution Modeling on Arbitrary Meshes,” In SIGGRAPH 1998, pp. 105–114.
27.
Kobbelt, L., and J. Vorsatz, 1999, “Multiresolution Hierarchies on Unstructured Triangle Meshes,” Computational Geometry, 14(1-3), pp. 5–24.
28.
Turk, G., and Levoy, M., 1994, “Zippered Polygon Meshes from Range Images,” In SIGGRAPH 1994, pp. 311–318.
29.
Zorin, D., and Schro¨der, P., 2000, “Subdivision for Modeling and Animation,” In SIGGRAPH 2000 Course Notes.
30.
Alliez, P., and Desbrun, M., 2001, “Progressive Compression for Lossless Transmission of Triangle Meshes,” In SIGGRAPH 2001, pp. 198–205.
31.
Kobbelt, L., 2000, “Sqrt(3) Subdivision,” In SIGGRAPH 2000, pp. 103–112.
Copyright © 2003
 by ASME
You do not currently have access to this content.