Visibility-driven mesh analysis and visualization through graph cuts

Visibility-driven mesh analysis and visualization through graph cuts

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

Description complète

Détails bibliographiques
Publié dans:IEEE transactions on visualization and computer graphics. - 1996. - 14(2008), 6 vom: Nov., Seite 1667-74
Auteur principal: Zhou, Kaichi (Auteur)
Autres auteurs: Zhang, Eugene, Bittner, Jirí, Wonka, Peter
Format: Article en ligne
Langue:English
Publié: 2008
Accès à la collection:IEEE transactions on visualization and computer graphics
Sujets:Journal Article
LEADER 01000caa a22002652c 4500
001 NLM184328667
003 DE-627
005 20250209220532.0
007 cr uuu---uuuuu
008 231223s2008 xx |||||o 00| ||eng c
024 7 |a 10.1109/TVCG.2008.176  |2 doi 
028 5 2 |a pubmed25n0615.xml 
035 |a (DE-627)NLM184328667 
035 |a (NLM)18989024 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Zhou, Kaichi  |e verfasserin  |4 aut 
245 1 0 |a Visibility-driven mesh analysis and visualization through graph cuts 
264 1 |c 2008 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 30.12.2008 
500 |a Date Revised 07.11.2008 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a 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 
650 4 |a Journal Article 
700 1 |a Zhang, Eugene  |e verfasserin  |4 aut 
700 1 |a Bittner, Jirí  |e verfasserin  |4 aut 
700 1 |a Wonka, Peter  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on visualization and computer graphics  |d 1996  |g 14(2008), 6 vom: Nov., Seite 1667-74  |w (DE-627)NLM098269445  |x 1941-0506  |7 nnas 
773 1 8 |g volume:14  |g year:2008  |g number:6  |g month:11  |g pages:1667-74 
856 4 0 |u http://dx.doi.org/10.1109/TVCG.2008.176  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 14  |j 2008  |e 6  |c 11  |h 1667-74