DIETZ%sdr.slb.com@RELAY.CS.NET (Paul F. Dietz) (10/05/87)
[ This was on theory-net. I thought there might be some interest or results usable. - Steve ] I'd like to know if there is a fast algorithm for calculating the volume of a convex region in n dimensions defined by the intersection of m half-spaces. A related problem I'd also like solved is to generate a random point, uniformly distributed, from inside such a convex region. Paul F. Dietz dietz@sdr.slb.com