Visibility-driven mesh analysis and visualization through graph cuts

Kaichi Zhou*, Eugene Zhang, Jiří Bittner, Peter Wonka

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


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.

Original languageEnglish (US)
Article number4658189
Pages (from-to)1667-1673
Number of pages7
JournalIEEE Transactions on Visualization and Computer Graphics
Issue number6
StatePublished - Nov 2008

Bibliographical note

Funding Information:
The authors acknowledge the contribution of all the reviewers and financial support from NSF IIS-0612269, NSF CCF-0643822, NSF CCF-0546881, and grant LC-06008 from the Czech Ministry of Education, Youth and Sports. We thank Will Schroeder, Ken Martin, Bill Lorensen, Bruce Teeter, Terry Yoo, Mark Levoy and the Stanford Graphics Group for the 3D models in this paper.


  • Graph cut
  • Inside removal
  • Interior/exterior classification
  • Layer classification
  • Normal orientation

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Computer Graphics and Computer-Aided Design


Dive into the research topics of 'Visibility-driven mesh analysis and visualization through graph cuts'. Together they form a unique fingerprint.

Cite this