10 search results - page 2 / 2 » Fiber Polytopes for the Projections between Cyclic Polytopes |
158
click to vote
JCT
2011
15 years 1 months ago
2011
The celebrated upper bound theorem of McMullen determines the maximal number of extreme points of a polyhedron in terms of its dimension and the number of constraints which define...
172
click to vote
COMPGEOM
2009
ACM
16 years 16 days ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
179
Voted
DCG
2006
15 years 6 months ago
2006
Abstract. Hyperbolic area is characterized as the unique continuous isometry invariant simple valuation on convex polygons in H2 . We then show that continuous isometry invariant s...
173
click to vote
COMPGEOM
2000
ACM
15 years 10 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
155
click to vote
FOCS
2007
IEEE
16 years 11 days ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...