Sciweavers

29 search results - page 1 / 6
» How Neighborly Can a Centrally Symmetric Polytope Be
Sort
View
DCG
2006
69views more  DCG 2006»
13 years 4 months ago
How Neighborly Can a Centrally Symmetric Polytope Be?
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
DCG
2006
110views more  DCG 2006»
13 years 4 months ago
High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension
Let A be a d by n matrix, d < n. Let C be the regular cross polytope (octahedron) in Rn . It has recently been shown that properties of the centrosymmetric polytope P = AC are ...
David L. Donoho
SODA
2003
ACM
131views Algorithms» more  SODA 2003»
13 years 6 months ago
Zonotopes as bounding volumes
Zonotopes are centrally symmetric polytopes with a very special structure: they are the Minkowski sum of line segments. In this paper we propose to use zonotopes as bounding volum...
Leonidas J. Guibas, An Nguyen, Li Zhang
COMPGEOM
1995
ACM
13 years 8 months ago
How Good are Convex Hull Algorithms?
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
David Avis, David Bremner
SIROCCO
2008
13 years 6 months ago
Centralized Communication in Radio Networks with Strong Interference
We study communication in known topology radio networks with the presence of interference constraints. We consider a real-world situation, when a transmission of a node produces an...
Frantisek Galcík