Zobrazit minimální záznam



dc.contributor.authorZhou, Kaichi
dc.contributor.authorZhang, Eugene
dc.contributor.authorBittner, Jiří
dc.contributor.authorWonka, Peter
dc.date.accessioned2013-06-02T15:53:55Z
dc.date.available2013-06-02T15:53:55Z
dc.date.issued2008-11
dc.identifier.citationKaichi Zhou, Eugene Zhang, Jiri Bittner, Peter Wonka. Visibility-driven Mesh Analysis and Visualization through Graph Cuts. IEEE Transactions on Visualization and Computer Graphics (Proceedings of IEEE Visualization 2008), vol. 14, no. 6, p. 1667-1674.cze
dc.identifier.urihttp://hdl.handle.net/10467/15601
dc.description.abstractIn 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.eng
dc.language.isocescze
dc.publisherIEEE Computer Societycze
dc.rights© 2008 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.eng
dc.subjectInterior/Exterior Classificationeng
dc.subjectNormal Orientationeng
dc.subjectLayer Classificationeng
dc.subjectInside Removaleng
dc.subjectGraph Cuteng
dc.titleVisibility-driven Mesh Analysis and Visualization through Graph Cutscze
dc.typečlánek z elektronického periodikacze
dc.identifier.doi10.1109/TVCG.2008.176


Soubory tohoto záznamu



Tento záznam se objevuje v následujících kolekcích

Zobrazit minimální záznam