Sciweavers

27 search results - page 3 / 6
» dcg 2006
Sort
View
DCG
2006
69views more  DCG 2006»
13 years 11 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
90views more  DCG 2006»
13 years 11 months ago
Combinatorial Complexity of Convex Sequences
We show that the equation si1 + si2 +
Alex Iosevich, S. Konyagin, Michael Rudnev, V. Ten
ACMACE
2006
ACM
14 years 4 months ago
3DCG authoring system using turtle metaphor
A new type of Authoring System for 3DCG animation is developed in which a user can easily manipulate three dimensional objects in three dimensional simulated space on the computer...
Katsuhide Tsushima, Masayuki Ueno, Takeshi Nishiki...
DCG
2006
96views more  DCG 2006»
13 years 11 months ago
Elementary Moves on Triangulations
It is proved that a triangulation of a polyhedron can always be transformed into any other triangulation of the polyhedron using only elementary moves. One consequence is that an ...
Monika Ludwig, Matthias Reitzner
DCG
2006
97views more  DCG 2006»
13 years 11 months ago
k-Sets in Four Dimensions
We show, with an elementary proof, that the number of halving simplices in a set of n points in R4 in general position is O(n4-2/45). This improves the previous bound of O(n4-1/13...
Jirí Matousek, Micha Sharir, Shakhar Smorod...