Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
10
click to vote
CCCG
2004
favorite
Email
discuss
report
74
views
Computational Geometry
»
more
CCCG 2004
»
When can a graph form an orthogonal polyhedron?
13 years 6 months ago
Download
www.cccg.ca
Therese C. Biedl, Burkay Genc
Real-time Traffic
CCCG 2004
|
CCCG 2007
|
claim paper
Related Content
»
ClosedForm BER Analysis for Antenna Selection Using Orthogonal SpaceTime Block Codes
»
Local polyhedra and geometric graphs
»
Distributive lattices polyhedra and generalized flows
»
Quadratic forms in normal RVs theory and applications to OSTBC over hoyt fading channels
»
ShortCuts on Star Source and Planar Unfoldings
»
Faster ASV Decomposition for Orthogonal Polyhedra Using the Extreme Vertices Model EVM
»
Forming the COUNCIL Based Clusters in Securing Wireless Ad Hoc Networks
»
Translating Out of Static Single Assignment Form
»
Graph Layout Adjustment Strategies
more »
Post Info
More Details (n/a)
Added
30 Oct 2010
Updated
30 Oct 2010
Type
Conference
Year
2004
Where
CCCG
Authors
Therese C. Biedl, Burkay Genc
Comments
(0)
Researcher Info
Computational Geometry Study Group
Computer Vision