<--- Back to Details
First PageDocument Content
Planar graphs / Topological graph theory / Computer graphics / Archimedean solids / Platonic solids / Dual graph / Tessellation / Photo-consistency / Graph embedding / Truncated tetrahedron / Cuboctahedron / Visual hull
Date: 2007-08-23 17:43:10
Planar graphs
Topological graph theory
Computer graphics
Archimedean solids
Platonic solids
Dual graph
Tessellation
Photo-consistency
Graph embedding
Truncated tetrahedron
Cuboctahedron
Visual hull

Multi-View Stereo via Graph Cuts on the Dual of an Adaptive Tetrahedral Mesh Sudipta N. Sinha Philippos Mordohai Marc Pollefeys Department of Computer Science, UNC Chapel Hill, USA

Add to Reading List

Source URL: www.cs.stevens.edu

Download Document from Source Website

File Size: 1,18 MB

Share Document on Facebook

Similar Documents

6.006 Intro to Algorithms  QUIZ 2 REVIEW NOTES - Part 2 April 12, 2011

6.006 Intro to Algorithms QUIZ 2 REVIEW NOTES - Part 2 April 12, 2011

DocID: 1rsoU - View Document

Note to other teachers and users of these slides: We would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them to fit your own needs.

Note to other teachers and users of these slides: We would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them to fit your own needs.

DocID: 1rmf4 - View Document

UNIVERSITÄT DORTMUND  FACHBEREICH INFORMATIK Diplomarbeit

UNIVERSITÄT DORTMUND FACHBEREICH INFORMATIK Diplomarbeit

DocID: 1rkPg - View Document

The planar slope-number of planar partial 3-trees of bounded degree Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesaˇr and Tomáš Vyskoˇcil Charles University in Prague University of Illin

The planar slope-number of planar partial 3-trees of bounded degree Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesaˇr and Tomáš Vyskoˇcil Charles University in Prague University of Illin

DocID: 1rfkH - View Document

Simple realizability of complete abstract topological graphs simplified Jan Kynˇcl Charles University, Prague  Graph: G = (V , E ), V finite, E ⊆

Simple realizability of complete abstract topological graphs simplified Jan Kynˇcl Charles University, Prague Graph: G = (V , E ), V finite, E ⊆

DocID: 1rec7 - View Document