dc.creatorDietrich, Carlos Augusto
dc.creatorScheidegger, Carlos Eduardo
dc.creatorComba, Joao Luiz Dihl
dc.creatorNedel, Luciana Porcher
dc.creatorSilva, Cláudio Teixeira
dc.date2011-01-29T06:00:42Z
dc.date2008
dc.identifier1077-2626
dc.identifierhttp://hdl.handle.net/10183/27618
dc.identifier000681704
dc.descriptionMarching Cubes is the most popular isosurface extraction algorithm due to its simplicity, efficiency and robustness. It has been widely studied, improved, and extended. While much early work was concerned with efficiency and correctness issues, lately there has been a push to improve the quality of Marching Cubes meshes so that they can be used in computational codes. In this work we present a new classification of MC cases that we call Edge Groups, which helps elucidate the issues that impact the triangle quality of the meshes that the method generates. This formulation allows a more systematic way to bound the triangle quality, and is general enough to extend to other polyhedral cell shapes used in other polygonization algorithms. Using this analysis, we also discuss ways to improve the quality of the resulting triangle mesh, including some that require only minor modifications of the original algorithm.
dc.formatapplication/pdf
dc.languageeng
dc.relationIEEE transactions on visualization and computer graphics. Los Alamitos. Vol. 14, no 6 (Nov./Dec. 2008), p. 1651-1658
dc.rightsOpen Access
dc.subjectComputação gráfica
dc.subjectIsosurface extraction
dc.subjectMarching cubes
dc.titleEdge Groups : an approach to understanding the Mesh quality of Marching Methods
dc.typeArtigo de periódico
dc.typeEstrangeiro


Este ítem pertenece a la siguiente institución