Join Our Newsletter

SODA

2012

ACM

11 years 15 hour ago
2012

ACM

The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...

IPL

2008

12 years 9 months ago
2008

Let P be a convex polytope in Rd , d = 3 or 2, with n vertices. We present linear time algorithms for approximating P by simpler polytopes. For instance, one such algorithm select...

FLAIRS

2004

12 years 11 months ago
2004

A blind classification algorithm is presented that uses hyperdimensional geometric algorithms to locate a hypothesis, in the form of a convex polytope or hyper-sphere. The convex ...

CONCUR

1993

Springer

13 years 1 months ago
1993

Springer

During the course of the last decade, a mathematical model for the parallelization of FOR-loops has become increasingly popular. In this model, a (perfect) nest of r FOR-loops is r...

ICCAD

1993

IEEE

13 years 1 months ago
1993

IEEE

A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...

COMPGEOM

2006

ACM

13 years 3 months ago
2006

ACM

We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a ﬁxed source s on the surface of a convex polytope P in three dime...

FOCS

2006

IEEE

13 years 3 months ago
2006

IEEE

We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...

COMPGEOM

2009

ACM

13 years 4 months ago
2009

ACM

Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...