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
26
click to vote
DCG
2006
favorite
Email
discuss
report
69
views
more
DCG 2006
»
How Neighborly Can a Centrally Symmetric Polytope Be?
13 years 8 months ago
Download
www.math.washington.edu
Abstract. We show that there exist k-neighborly centrally symmetric ddimensional polytopes with 2(n + d) vertices, where k(d, n) = ,, d 1 + log((d + n)/d)
Nathan Linial, Isabella Novik
Real-time Traffic
DCG 2006
|
Symmetric Ddimensional Polytopes
|
claim paper
Related Content
»
Zonotopes as bounding volumes
»
Tracking and Activity Recognition Through Consensus in Distributed Camera Networks
»
Integrating software distributed shared memory and message passing programming
more »
Post Info
More Details (n/a)
Added
11 Dec 2010
Updated
11 Dec 2010
Type
Journal
Year
2006
Where
DCG
Authors
Nathan Linial, Isabella Novik
Comments
(0)
Researcher Info
DCG 1998 Study Group
Computer Vision