DCG
2006
13 years 4 months ago
2006
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 ...
DCG
2008
13 years 4 months ago
2008
Abstract. We reformulate a known characterization of decomposability of polytopes in a way which may be more computationally convenient, and offer a more transparent proof. We appl...
DM
2010
13 years 4 months ago
2010
When the standard representation of a crystallographic Coxeter group G (with string diagram) is reduced modulo the integer d 2, one obtains a finite group Gd often the automorphi...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
The asynchronous capacity region of memoryless multiple-access channels is the union of certain polytopes. It is well-known that vertices of such polytopes may be approached via a...
SMA
2010
ACM
13 years 4 months ago
2010
ACM
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...