Edge Groups : an approach to understanding the Mesh quality of Marching Methods
Marching 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...
| Autores: | , , , , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2008 |
| País: | Brasil |
| Recursos: | Universidade Federal do Rio Grande do Sul (UFRGS) |
| Repositorio: | Repositório Institucional da UFRGS |
| Idioma: | inglés |
| OAI Identifier: | oai:www.lume.ufrgs.br:10183/27618 |
| Acesso em linha: | http://hdl.handle.net/10183/27618 |
| Access Level: | acceso abierto |
| Palavra-chave: | Computação gráfica Isosurface extraction Marching cubes |
| Resumo: | Marching 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. |
|---|