Sciweavers

141 search results - page 9 / 29
» dcg 2008
Sort
View
DCG
2006
96views more  DCG 2006»
13 years 7 months ago
k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn
We use circular sequences to give an improved lower bound on the minimum number of ( k)
József Balogh, Gelasio Salazar
DCG
2006
90views more  DCG 2006»
13 years 7 months ago
Combinatorial Complexity of Convex Sequences
We show that the equation si1 + si2 +
Alex Iosevich, S. Konyagin, Michael Rudnev, V. Ten
DCG
2006
69views more  DCG 2006»
13 years 7 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
2000
57views more  DCG 2000»
13 years 7 months ago
On the Generation of Oriented Matroids
We provide a multiple purpose algorithm for generating oriented matroids. An application disproves a conjecture of Gr
Jürgen Bokowski, A. Guedes de Oliveira
DCG
2000
55views more  DCG 2000»
13 years 7 months ago
Minimal Simplicial Dissections and Triangulations of Convex 3-Polytopes
This paper addresses three questions related to minimal triangulations of a 3-dimensional convex polytope P.
Alexander Below, Jesús A. De Loera, Jü...