On Computing the Vertex Centroid of a Polyhedron

Details On Computing the Vertex Centroid of a Polyhedron On Computing the Vertex Centroid of a Polyhedron

2008-06-20

arxiv.org/abs/0806.3456v1

Computer Science

Computational Geometry

Scientific paper

Let $\mathcal{P}$ be an $\mathcal{H}$-polytope in $\mathbb{R}^d$ with vertex set $V$. The vertex centroid is defined as the average of the vertices in $V$. We prove that computing the vertex centroid of an $\mathcal{H}$-polytope is #P-hard. Moreover, we show that even just checking whether the vertex centroid lies in a given halfspace is already #P-hard for $\mathcal{H}$-polytopes. We also consider the problem of approximating the vertex centroid by finding a point within an $\epsilon$ distance from it and prove this problem to be #P-easy by showing that given an oracle for counting the number of vertices of an $\mathcal{H}$-polytope, one can approximate the vertex centroid in polynomial time. We also show that any algorithm approximating the vertex centroid to \emph{any} ``sufficiently'' non-trivial (for example constant) distance, can be used to construct a fully polynomial approximation scheme for approximating the centroid and also an output-sensitive polynomial algorithm for the Vertex Enumeration problem. Finally, we show that for unbounded polyhedra the vertex centroid can not be approximated to a distance of $d^{{1/2}-\delta}$ for any fixed constant $\delta>0$.

Affiliated with

Also associated with

No associations

Rating

On Computing the Vertex Centroid of a Polyhedron does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Computing the Vertex Centroid of a Polyhedron, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Computing the Vertex Centroid of a Polyhedron will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-277217