Visibility-driven mesh analysis and visualization through graph cuts.
IEEE Trans Vis Comput Graph
; 14(6): 1667-74, 2008.
Article
em En
| MEDLINE
| ID: mdl-18989024
ABSTRACT
In this paper we present an algorithm that operates on a triangular mesh and classifies each face of a triangle as either inside or outside. We present three example applications of this core algorithm normal orientation, inside removal, and layer-based visualization. The distinguishing feature of our algorithm is its robustness even if a difficult input model that includes holes, coplanar triangles, intersecting triangles, and lost connectivity is given. Our algorithm works with the original triangles of the input model and uses sampling to construct a visibility graph that is then segmented using graph cut.
Texto completo:
1
Coleções:
01-internacional
Base de dados:
MEDLINE
Idioma:
En
Revista:
IEEE Trans Vis Comput Graph
Ano de publicação:
2008
Tipo de documento:
Article