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)|
|Number of pages||7|
|Journal||IEEE Transactions on Visualization and Computer Graphics|
|State||Published - Nov 2008|
Bibliographical noteFunding 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
- Signal Processing
- Computer Vision and Pattern Recognition
- Computer Graphics and Computer-Aided Design