Visibility-driven mesh analysis and visualization through graph cuts

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

doi:10.1109/TVCG.2008.176

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 journal › Article › peer-review

5 Scopus citations

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 language	English (US)
Article number	4658189
Pages (from-to)	1667-1673
Number of pages	7
Journal	IEEE Transactions on Visualization and Computer Graphics
Volume	14
Issue number	6
DOIs	https://doi.org/10.1109/TVCG.2008.176
State	Published - Nov 2008
Externally published	Yes

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.

Keywords

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

Access to Document

10.1109/TVCG.2008.176

Cite this

@article{9e3f0ab544394cc7a6facadec35fc706,

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{\v r}{\'i} Bittner and Peter Wonka",

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.",

year = "2008",

month = nov,

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 = "Institute of Electrical and Electronics Engineers",

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

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

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

U2 - 10.1109/TVCG.2008.176

DO - 10.1109/TVCG.2008.176

M3 - Article

C2 - 18989024

AN - SCOPUS:54949084205

SN - 1077-2626

VL - 14

SP - 1667

EP - 1673

JO - IEEE Transactions on Visualization and Computer Graphics

JF - IEEE Transactions on Visualization and Computer Graphics

IS - 6

M1 - 4658189

ER -

Visibility-driven mesh analysis and visualization through graph cuts

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this