OREGON STATE UNIVERSITY

You are here

Visibility-driven mesh analysis and visualization through graph cuts.

TitleVisibility-driven mesh analysis and visualization through graph cuts.
Publication TypeJournal Article
Year of Publication2008
AuthorsZhou, K., E. Zhang, J. Bittner, and P. Wonka
JournalIEEE transactions on visualization and computer graphics
Volume14
Issue6
Pagination1667-74
Date Published2008 Nov-Dec
ISSN1077-2626
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.

Alternate JournalIEEE Trans Vis Comput Graph
PubMed ID18989024