{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T06:03:15Z","timestamp":1750831395224,"version":"3.30.2"},"reference-count":31,"publisher":"ASME International","issue":"4","content-domain":{"domain":["asmedigitalcollection.asme.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2003,12,1]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1115\/1.1631021","type":"journal-article","created":{"date-parts":[[2003,12,24]],"date-time":"2003-12-24T23:00:38Z","timestamp":1072306838000},"page":"338-344","update-policy":"https:\/\/doi.org\/10.1115\/crossmarkpolicy-asme","source":"Crossref","is-referenced-by-count":7,"title":["Dynamic Remeshing and Applications"],"prefix":"10.1115","volume":"3","author":[{"given":"J.","family":"Vorsatz ,","sequence":"first","affiliation":[{"name":"Max-Planck-Institut fu\u00a8r Informatik, Saarbru\u00a8cken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ch.","family":"Ro\u00a8ssl , and","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut fu\u00a8r Informatik, Saarbru\u00a8cken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.-P.","family":"Seidel","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut fu\u00a8r Informatik, Saarbru\u00a8cken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"33","published-online":{"date-parts":[[2003,12,24]]},"reference":[{"key":"2019100523181378200_r1","doi-asserted-by":"crossref","unstructured":"Ju, T., Losasso, F., Schaefer, S., and Warren, J., 2002, \u201cDual Contouring of Hermite Data,\u201d In SIGGRAPH 2002, pp. 339\u2013346.","DOI":"10.1145\/566654.566586"},{"key":"2019100523181378200_r2","doi-asserted-by":"crossref","unstructured":"Kobbelt, L., Botsch, M., Schwanecke, U., and H.-P. Seidel, 2001, \u201cFeature-Sensitive Surface Extraction from Volume Data,\u201d In SIGGRAPH 2001, pp. 57\u201366.","DOI":"10.1145\/383259.383265"},{"key":"2019100523181378200_r3","doi-asserted-by":"crossref","unstructured":"Gotsman, C., Gumhold, S., and Kobbelt, L., 2002, \u201cSimplification and Compression of 3D Meshes,\u201d In Iske, A., Quak, E., and Floater, M. S. (eds), Tutorials on Multiresolution in Geometric Modelling, Springer, pp. 319\u2013361.","DOI":"10.1007\/978-3-662-04388-2_12"},{"key":"2019100523181378200_r4","doi-asserted-by":"crossref","unstructured":"Eck, M., DeRose, T., Duchamp, T., Hoppe, H., Lounsbery, M., and Stuetzle, W., 1995, \u201cMultiresolution Analysis of Arbitrary Meshes,\u201d In SIGGRAPH 1995, pp. 173\u2013182.","DOI":"10.1145\/218380.218440"},{"key":"2019100523181378200_r5","doi-asserted-by":"crossref","unstructured":"Lee, A. W. F., Sweldens, W., Schro\u00a8der, P., Cowsar, L., and Dobkin, D., 1998, \u201cMAPS: Multiresolution Adaptive Parametrization of Surfaces,\u201d In SIGGRAPH 1998, pp. 95\u2013104.","DOI":"10.1145\/280814.280828"},{"key":"2019100523181378200_r6","doi-asserted-by":"crossref","unstructured":"Guskov, I., Vidimce, K., Sweldens, W., and Schro\u00a8der, P., 2000, \u201cNormal Meshes,\u201d In SIGGRAPH 2000, pp. 95\u2013102.","DOI":"10.1145\/344779.344831"},{"key":"2019100523181378200_r7","doi-asserted-by":"crossref","unstructured":"Kobbelt, L., Vorsatz, J., Labsik, U., and Seidel, H.-P., 1999, \u201cA Shrink Wrapping Approach to Remeshing Polygonal Surfaces,\u201d Eurographics 1999, pp. 119\u2013130.","DOI":"10.1111\/1467-8659.00333"},{"key":"2019100523181378200_r8","doi-asserted-by":"crossref","unstructured":"Alliez, P., Meyer, M., and Desbrun, M., 2002, \u201cInteractive Geometry Remeshing,\u201d In SIGGRAPH 2002, pp. 347\u2013354.","DOI":"10.1145\/566570.566588"},{"key":"2019100523181378200_r9","unstructured":"Alliez, P., Verdie`re, E. C., Devillers, O., and Isenburg, M., 2003, \u201cIsotropic Surface Remeshing,\u201d In SMI Shape Modeling International."},{"key":"2019100523181378200_r10","doi-asserted-by":"crossref","unstructured":"Alliez, P., Cohen-Steiner, D., Devillers, O., Le\u00b4vy, B., and Desbrun, M., 2003, \u201cAnisotropic Polygonal Remeshing,\u201d In SIGGRAPH 2003, pp. 485\u2013493.","DOI":"10.1145\/1201775.882296"},{"key":"2019100523181378200_r11","unstructured":"Surazhsky, V., and Gotsman, C., 2003, \u201cExplicit Surface Remeshing,\u201d In EG Symposium on Geometry Processing, pp. 17\u201328."},{"key":"2019100523181378200_r12","unstructured":"Surazhsky, V., Alliez, P., and Gotsman, C., 2003, \u201cIsotropic Remeshing of Surfaces: A Local Parametrization Approach,\u201d In 12th International Meshing Roundtable."},{"key":"2019100523181378200_r13","doi-asserted-by":"crossref","unstructured":"Vorsatz, J., Ro\u00a8ssl, C., Kobbelt, L., and Seidel, H.-P., 2001, \u201cFeature Sensitive Remeshing,\u201d In Eurographics 2001, pp. 393\u2013401.","DOI":"10.1111\/1467-8659.00532"},{"key":"2019100523181378200_r14","doi-asserted-by":"crossref","unstructured":"Turk, G., 1992, \u201cRe-Tiling Polygonal Surfaces,\u201d In SIGGRAPH 1992, pp. 55\u201364.","DOI":"10.1145\/142920.134008"},{"key":"2019100523181378200_r15","doi-asserted-by":"crossref","unstructured":"Welch, W., and Witkin, A., 1994, \u201cFree-Form Shape Design using Triangulated Surfaces,\u201d In SIGGRAPH 1994, pp. 247\u2013256.","DOI":"10.1145\/192161.192216"},{"key":"2019100523181378200_r16","doi-asserted-by":"crossref","unstructured":"Frey, P. J., and Borouchaki, H., 1998, \u201cGeometric Surface Mesh Optimization,\u201d Computing and Visualization in Science, 1, pp. 113\u2013121.","DOI":"10.1007\/s007910050011"},{"key":"2019100523181378200_r17","doi-asserted-by":"crossref","unstructured":"Kobbelt, L., Bareuther, T., and Seidel, H.-P., 2000, \u201cMultiresolution Shape Deformations for Meshes with Dynamic Vertex Connectivity,\u201d In Eurographics 2000, pp. 249\u2013260.","DOI":"10.1111\/1467-8659.00417"},{"key":"2019100523181378200_r18","doi-asserted-by":"crossref","unstructured":"Floater, M. S., 1997, \u201cParametrization and Smooth Approximation of Surface Triangulations,\u201d CAGD, 14(3), pp. 231\u2013250.","DOI":"10.1016\/S0167-8396(96)00031-3"},{"key":"2019100523181378200_r19","doi-asserted-by":"crossref","unstructured":"Floater, M. S., 2003, \u201cMean Value Coordinates,\u201d CAGD, 20, pp. 19\u201327.","DOI":"10.1016\/S0167-8396(03)00002-5"},{"key":"2019100523181378200_r20","doi-asserted-by":"crossref","unstructured":"Desbrun, M., Meyer, M., and Alliez, P., 2002, \u201cIntrinsic Parametrizations of Surface Meshes,\u201d In Eurographics 2002, pp. 209\u2013218.","DOI":"10.1111\/1467-8659.00580"},{"key":"2019100523181378200_r21","unstructured":"Hormann, K., and Greiner, G., 2000, \u201cMIPS: An Efficient Global Parametrization Method,\u201d In Curve and Surface Design: Saint-Malo 1999, pp. 153\u2013162."},{"key":"2019100523181378200_r22","doi-asserted-by":"crossref","unstructured":"Sorkine, O., Cohen-Or, D., Goldenthal, R., and Lischinski, D., 2002, \u201cBounded-Distortion Piecewise Mesh Parametrization,\u201d In IEEE Visualization 2002, pp. 355\u2013362.","DOI":"10.1109\/VISUAL.2002.1183795"},{"key":"2019100523181378200_r23","unstructured":"Brown, P. J. C., and Faigle, C. T., 1996, \u201cA Robust Efficient Algorithm for Point Location in Triangulations,\u201d Technical report, Cambridge University."},{"key":"2019100523181378200_r24","unstructured":"Ro\u00a8ssl, C., Kobbelt, L., and Seidel, H.-P., 2001, \u201cRecovering Structural Information from Triangulated Surfaces,\u201d In Mathematical Methods for Curves and Surfaces: Oslo 2000, pp. 423\u2013432."},{"key":"2019100523181378200_r25","doi-asserted-by":"crossref","unstructured":"Le\u00b4vy, B., Petitjean, S., Ray, N., and Maillot, J., 2002, \u201cLeast Squares Conformal Maps for Automatic Texture Atlas Generation,\u201d In SIGGRAPH 2002, pp. 362\u2013371.","DOI":"10.1145\/566570.566590"},{"key":"2019100523181378200_r26","doi-asserted-by":"crossref","unstructured":"Kobbelt, L., Campagna, S., Vorsatz, J., and Seidel, H.-P., 1998, \u201cInteractive Multi\u2013Resolution Modeling on Arbitrary Meshes,\u201d In SIGGRAPH 1998, pp. 105\u2013114.","DOI":"10.1145\/280814.280831"},{"key":"2019100523181378200_r27","doi-asserted-by":"crossref","unstructured":"Kobbelt, L., and J. Vorsatz, 1999, \u201cMultiresolution Hierarchies on Unstructured Triangle Meshes,\u201d Computational Geometry, 14(1-3), pp. 5\u201324.","DOI":"10.1016\/S0925-7721(99)00032-2"},{"key":"2019100523181378200_r28","doi-asserted-by":"crossref","unstructured":"Turk, G., and Levoy, M., 1994, \u201cZippered Polygon Meshes from Range Images,\u201d In SIGGRAPH 1994, pp. 311\u2013318.","DOI":"10.1145\/192161.192241"},{"key":"2019100523181378200_r29","unstructured":"Zorin, D., and Schro\u00a8der, P., 2000, \u201cSubdivision for Modeling and Animation,\u201d In SIGGRAPH 2000 Course Notes."},{"key":"2019100523181378200_r30","doi-asserted-by":"crossref","unstructured":"Alliez, P., and Desbrun, M., 2001, \u201cProgressive Compression for Lossless Transmission of Triangle Meshes,\u201d In SIGGRAPH 2001, pp. 198\u2013205.","DOI":"10.1145\/383259.383281"},{"key":"2019100523181378200_r31","doi-asserted-by":"crossref","unstructured":"Kobbelt, L., 2000, \u201cSqrt(3) Subdivision,\u201d In SIGGRAPH 2000, pp. 103\u2013112.","DOI":"10.1145\/344779.344835"}],"container-title":["Journal of Computing and Information Science in Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/asmedigitalcollection.asme.org\/computingengineering\/article-pdf\/3\/4\/338\/5525392\/334_1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/asmedigitalcollection.asme.org\/computingengineering\/article-pdf\/3\/4\/338\/5525392\/334_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T18:43:28Z","timestamp":1734201808000},"score":1,"resource":{"primary":{"URL":"https:\/\/asmedigitalcollection.asme.org\/computingengineering\/article\/3\/4\/338\/445317\/Dynamic-Remeshing-and-Applications"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12,1]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,12,1]]}},"URL":"https:\/\/doi.org\/10.1115\/1.1631021","relation":{},"ISSN":["1530-9827","1944-7078"],"issn-type":[{"type":"print","value":"1530-9827"},{"type":"electronic","value":"1944-7078"}],"subject":[],"published":{"date-parts":[[2003,12,1]]}}}