MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $C$ be a pointed polyhedral cone in $\mathbb{R}^n$ and let $S^{n-1}$ denote the unit sphere in $\mathbb{R}^n$. Given a description of the supporting hyperplanes of $C$ is there an algorithm for computing the spherical measure of $C \cap S^{n-1}$? I suppose you could randomly generate points uniformly distributed on the unit sphere, and test each point to see if it is in $C$. Is there a better way?

share|cite|improve this question
Is the base of the cone at the origin? – Igor Rivin Nov 8 '11 at 14:51
@Igor: I call that bit of a cone the vertex, and I call the other end (when there is one) the base. – Andreas Blass Nov 8 '11 at 14:59
@Andreas: yes, of course, base was a poorly chosen term... – Igor Rivin Nov 8 '11 at 15:06
Yes, the vertex is the origin – Brian Lins Nov 8 '11 at 15:20
Things may depend on how the set of supporting planes is described. Is it given as normal plane to a convex hull of some finite set in $S^{n-1}$? – Anton Petrunin Nov 8 '11 at 17:54

This is in general as hard as computing the volume of an Euclidean polytope, but there are reductions for even dimensional polytopes to volumes of lower-dimensional things (of which there may, of course, be an exponential number). See (he mostly talks about the hyperbolic case, but the spherical case is identical).

share|cite|improve this answer

For very special classes of cones, there are combinatorial formulas related to these questions, e.g.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.