22 search results - page 1 / 5 » Splitting a Complex of Convex Polytopes In Any Dimension |
COMPGEOM
1996
ACM
14 years 3 months ago
1996
ACM
AAECC
2002
Springer
13 years 11 months ago
2002
Springer
Abstract. For any integral convex polytope in R2 there is an explicit construction of an error-correcting code of length (q - 1)2 over the finite field Fq, obtained by evaluation o...
COMPGEOM
1996
ACM
14 years 3 months ago
1996
ACM
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...
CAGD
2007
13 years 11 months ago
2007
Barycentric coordinates are a fundamental concept in computer graphics and geometric modeling. We extend the geometric construction of Floater’s mean value coordinates [8,11] to...
ORL
2008
13 years 11 months ago
2008
By analogy with the conjecture of Hirsch, we conjecture that the order of the largest total curvature of the central path associated to a polytope is the number of inequalities de...