Visibility-driven mesh analysis and visualization through graph cuts

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

Research output: Contribution to journalArticle

4 Citations (Scopus)

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.

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

Fingerprint

Visibility
Visualization
Sampling

Keywords

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

ASJC Scopus subject areas

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

Cite this

Visibility-driven mesh analysis and visualization through graph cuts. / Zhou, Kaichi; Zhang, Eugene; Bittner, Jiří; Wonka, Peter.

In: IEEE Transactions on Visualization and Computer Graphics, Vol. 14, No. 6, 4658189, 11.2008, p. 1667-1673.

Research output: Contribution to journalArticle

Zhou, Kaichi ; Zhang, Eugene ; Bittner, Jiří ; Wonka, Peter. / Visibility-driven mesh analysis and visualization through graph cuts. In: IEEE Transactions on Visualization and Computer Graphics. 2008 ; Vol. 14, No. 6. pp. 1667-1673.
@article{bc0df99a69a64db884e579a4808650e9,
title = "Visibility-driven mesh analysis and visualization through graph cuts",
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.",
keywords = "Graph cut, Inside removal, Interior/exterior classification, Layer classification, Normal orientation",
author = "Kaichi Zhou and Eugene Zhang and Jiř{\'i} Bittner and Peter Wonka",
year = "2008",
month = "11",
doi = "10.1109/TVCG.2008.176",
language = "English (US)",
volume = "14",
pages = "1667--1673",
journal = "IEEE Transactions on Visualization and Computer Graphics",
issn = "1077-2626",
publisher = "IEEE Computer Society",
number = "6",

}

TY - JOUR

T1 - Visibility-driven mesh analysis and visualization through graph cuts

AU - Zhou, Kaichi

AU - Zhang, Eugene

AU - Bittner, Jiří

AU - Wonka, Peter

PY - 2008/11

Y1 - 2008/11

N2 - 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.

AB - 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.

KW - Graph cut

KW - Inside removal

KW - Interior/exterior classification

KW - Layer classification

KW - Normal orientation

UR - http://www.scopus.com/inward/record.url?scp=54949084205&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=54949084205&partnerID=8YFLogxK

U2 - 10.1109/TVCG.2008.176

DO - 10.1109/TVCG.2008.176

M3 - Article

VL - 14

SP - 1667

EP - 1673

JO - IEEE Transactions on Visualization and Computer Graphics

JF - IEEE Transactions on Visualization and Computer Graphics

SN - 1077-2626

IS - 6

M1 - 4658189

ER -