{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T02:08:54Z","timestamp":1773799734016,"version":"3.50.1"},"reference-count":24,"publisher":"ASME International","issue":"4","content-domain":{"domain":["asmedigitalcollection.asme.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2002,12,1]]},"abstract":"<jats:p>A new method for improving polygonizations of implicit surfaces with sharp features is proposed. The method is based on the observation that, given an implicit surface with sharp features, a triangle mesh whose triangles are tangent to the implicit surface at certain inner triangle points gives a better approximation of the implicit surface than the standard Marching Cubes mesh [Lorensen, W.E., and Cline, H.E., 1987, Computer Graphics (Proceedings of SIGGRAPH \u201987), 21(3), pp. 163\u2013169] (in our experiments we use VTK Marching Cubes [Schroeder, W., Martin, K., and Lorensen, W., 1998, The Visualization Toolkit: An Object-Oriented Approach to 3-D Graphics, Prentice Hall]). First, given an initial triangle mesh, its dual mesh composed of the triangle centroids is considered. Then the dual mesh is modified such that its vertices are placed on the implicit surface and the mesh dual to the modified dual mesh is considered. Finally the vertex positions of that \u201cdouble dual\u201d mesh are optimized by minimizing a quadratic energy measuring a deviation of the mesh normals from the implicit surface normals computed at the vertices of the modified dual mesh. In order to achieve an accurate approximation of fine surface features, these basic steps are combined with adaptive mesh subdivision and curvature-weighted vertex resampling. The proposed method outperforms approaches based on the mesh evolution paradigm in speed and accuracy.<\/jats:p>","DOI":"10.1115\/1.1559153","type":"journal-article","created":{"date-parts":[[2003,3,27]],"date-time":"2003-03-27T23:09:12Z","timestamp":1048806552000},"page":"277-284","update-policy":"https:\/\/doi.org\/10.1115\/crossmarkpolicy-asme","source":"Crossref","is-referenced-by-count":11,"title":["Dual-Primal Mesh Optimization for Polygonized Implicit Surfaces With Sharp Features"],"prefix":"10.1115","volume":"2","author":[{"given":"Yutaka","family":"Ohtake","sequence":"first","affiliation":[{"name":"Computer Graphics Group, Max-Planck-Institut fu\u00a8r Informatik, 66123\u2009Saarbru\u00a8cken, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander G.","family":"Belyaev","sequence":"additional","affiliation":[{"name":"Computer Graphics Group, Max\u2013Planck\u2013Institut fu\u00a8r Informatik, 66123 Saabru\u00a8cken, Germany"},{"name":"University of Aizu, Aizu-Wakamatsu\u2009965-8580, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"33","published-online":{"date-parts":[[2003,3,26]]},"reference":[{"key":"2019100601261079800_r1","doi-asserted-by":"crossref","unstructured":"Lorensen, W. E., and Cline, H. E., 1987, \u201cMarching Cubes: A High Resolution 3D Surface Construction Algorithm,\u201d Computer Graphics (Proceedings of SIGGRAPH \u201987), 21(3), pp. 163\u2013169.","DOI":"10.1145\/37402.37422"},{"key":"2019100601261079800_r2","unstructured":"Schroeder, W., Martin, K., and Lorensen W., 1998, The Visualization Toolkit: An Object-Oriented Approach to 3D Graphics, Prentice Hall."},{"key":"2019100601261079800_r3","unstructured":"Bloomenthal, J., 1997, Introduction to Implicit Surfaces, J. Bloomenthal, editor, Morgan Kaufmann."},{"key":"2019100601261079800_r4","doi-asserted-by":"crossref","unstructured":"Velho, L. , 1996, \u201cSimple and Efficient Polygonization of Implicit Surfaces,\u201d Journal of Graphics Tools, 1(2), pp. 5\u201324.","DOI":"10.1080\/10867651.1996.10487456"},{"key":"2019100601261079800_r5","doi-asserted-by":"crossref","unstructured":"Karkanis, T., and Stewart, A. J., 2001, \u201cCurvature-Dependent Triangulation of implicit surfaces,\u201d IEEE Comput. Graphics Appl., 21(2), pp. 60\u201369.","DOI":"10.1109\/38.909016"},{"key":"2019100601261079800_r6","doi-asserted-by":"crossref","unstructured":"Ohtake, Yu, Belyaev, A. G., and Pasko, A., 2001, \u201cDynamic Meshes for Accurate Polygonization of Implicit Surfaces with Sharp Features,\u201d in Shape Modeling International 2001, pp. 74\u201381.","DOI":"10.1109\/SMA.2001.923377"},{"key":"2019100601261079800_r7","doi-asserted-by":"crossref","unstructured":"Kobbelt, L. P., Botsch, M., Schwanecke, U., and H.-P., Seidel, 2001, \u201cFeature Sensitive Surface Extraction From Volume Data,\u201d in Computer Graphics (Proceedings of SIGGRAPH 2001), pages 57\u201366.","DOI":"10.1145\/383259.383265"},{"key":"2019100601261079800_r8","unstructured":"Ohtake, Yu, 2002, \u201cMesh Optimization and Feature Extraction,\u201d Ph.D. thesis, University of Aizu."},{"key":"2019100601261079800_r9","doi-asserted-by":"crossref","unstructured":"Ohtake, Yu, and Belyaev, A. G., 2002, \u201cDual\/Primal Mesh Optimization for Polygonized Implicit Surfaces,\u201d K. Lee and N. Patrikalakis, editors, 7th ACM Symposium on Solid Modeling and Applications, pp. 171\u2013178.","DOI":"10.1145\/566282.566308"},{"key":"2019100601261079800_r10","unstructured":"Garland, M., 1999, Quadric-Based Polygonal Surface Simplification, Ph.D. thesis, Carnegie Mellon University."},{"key":"2019100601261079800_r11","doi-asserted-by":"crossref","unstructured":"Garland, M., and Heckbert, P. S., 1997, \u201cSurface Simplification Using Quadric Error Metrics,\u201d in Computer Graphics (Proceedings of SIGGRAPH \u201997), pp. 209\u2013216.","DOI":"10.1145\/258734.258849"},{"key":"2019100601261079800_r12","doi-asserted-by":"crossref","unstructured":"Ohtake, Yu, and Belyaev, A. G., 2001, \u201cMesh Optimization for Polygonized Isosurfaces,\u201d Computer Graphics Forum (Eurographics 2001 issue), 20(3), pp. 368\u2013376.","DOI":"10.1111\/1467-8659.00529"},{"key":"2019100601261079800_r13","doi-asserted-by":"crossref","unstructured":"Wyvill, B., and van Overveld, K., 1996, \u201cPolygonization of Implicit Surfaces With Constructive Solid Geometry,\u201d International Journal of Shape Modeling, 2(4), pp. 257\u2013274.","DOI":"10.1142\/S0218654396000142"},{"key":"2019100601261079800_r14","unstructured":"Koenderink, J. J., 1990, Solid Shape, MIT Press."},{"key":"2019100601261079800_r15","doi-asserted-by":"crossref","unstructured":"Zorin, D., and Peter Schro\u00a8der, P., 2001, \u201cA Unified Framework for Primal\/Dual Quadrilateral Subdivision Schemes,\u201d Computer Aided Geometric Design, 18(5), pp. 429\u2013454.","DOI":"10.1016\/S0167-8396(01)00040-1"},{"key":"2019100601261079800_r16","doi-asserted-by":"crossref","unstructured":"Taubin, G., 2001, \u201cDual Mesh Resampling,\u201d in Proceedings of Pacific Graphics \u201901, pp. 180\u2013188.","DOI":"10.1109\/PCCGA.2001.962871"},{"key":"2019100601261079800_r17","doi-asserted-by":"crossref","unstructured":"Ju, T., Losasso, F., Schaefer, S., and Warren, J., 2002, \u201cDual Contouring of Hermite Data,\u201d ACM Trans. Graphics, 21(3), pp. 339\u2013346.","DOI":"10.1145\/566654.566586"},{"key":"2019100601261079800_r18","doi-asserted-by":"crossref","unstructured":"Taubin, G. , 1991, \u201cEstimation of Planar Curves, Surfaces and Non-Planar Space Curves Defined by Implicit Equations, With Applications to Edge and Range Image Segmentation,\u201d IEEE Trans. Pattern Anal. Mach. Intell., 13(11), pp. 115\u20131138.","DOI":"10.1109\/34.103273"},{"key":"2019100601261079800_r19","unstructured":"Press, W. H., Teukolsky, S. A., Vetterling, W. T., and Flannery, B. P., 1993, Numerical Recipes in C: The Art of Scientific Computing, Cambridge University Press."},{"key":"2019100601261079800_r20","doi-asserted-by":"crossref","unstructured":"Vorsatz, J., Ro\u00a8ssl, C., Kobbelt, L. P., and Seidel, H.-P., 2001, \u201cFeature Sensitive Remeshing,\u201d Computer Graphics Forum (Eurographics 2001 issue), 20(3), pp. 393\u2013401.","DOI":"10.1111\/1467-8659.00532"},{"key":"2019100601261079800_r21","doi-asserted-by":"crossref","unstructured":"Alliez, P., Meyer, M., and Desbrun, M., 2002, \u201cInteractive Geometry Remeshing,\u201d ACM Transactions on Graphics, 21(3), pp. 347\u2013354.","DOI":"10.1145\/566654.566588"},{"key":"2019100601261079800_r22","doi-asserted-by":"crossref","unstructured":"Kobbel, L., 2000, \u201c3-Subdivision,\u201d in Computer Graphics (Proceedings of SIGGRAPH 2000), pp. 103\u2013112.","DOI":"10.1145\/344779.344835"},{"key":"2019100601261079800_r23","unstructured":"Adzhiev, V., Cartwright, R., Fausett, E., Ossipov, A., Pasko, A., and Savchenko, V., 1999, \u201cHyperFun Project: A Framework for Collaborative Multidimensional F-rep Modeling,\u201d J. Hughes and C. Schlick, editors, Implicit Surfaces \u201999, Eurographics\/ACM SIGGRAPH Workshop, pp. 59\u201369."},{"key":"2019100601261079800_r24","doi-asserted-by":"crossref","unstructured":"Kobbelt, L., Bareuther, T., and Seidel, H.-P., 2000, \u201cMulti-Resolution Shape Deformations for Meshes With Dynamic Vertex Connectivity,\u201d Computer Graphics Forum (Eurographics 2000 issue), 19(3), pp. C249\u2013C260.","DOI":"10.1111\/1467-8659.00417"}],"container-title":["Journal of Computing and Information Science in Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/asmedigitalcollection.asme.org\/computingengineering\/article-pdf\/2\/4\/277\/5536871\/277_1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/asmedigitalcollection.asme.org\/computingengineering\/article-pdf\/2\/4\/277\/5536871\/277_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T03:25:09Z","timestamp":1733973909000},"score":1,"resource":{"primary":{"URL":"https:\/\/asmedigitalcollection.asme.org\/computingengineering\/article\/2\/4\/277\/460089\/DualPrimal-Mesh-Optimization-for-Polygonized"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12,1]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,12,1]]}},"URL":"https:\/\/doi.org\/10.1115\/1.1559153","relation":{},"ISSN":["1530-9827","1944-7078"],"issn-type":[{"value":"1530-9827","type":"print"},{"value":"1944-7078","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,12,1]]}}}