Sampling Hypersurfaces through Diffusion

Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the problem of generating random samples from smooth hypersurfaces that may be represented as the boundary A of a domain A Rd of Euclidean space. A is specified through a membership oracle and we assume access to a blackbox that can generate uniform random samples from A. By simulating a diffusion process with a suitably chosen time constant t, we are able to construct algorithms that can generate points (approximately) on A according to a (approximately) uniform distribution. We have two classes of related but distinct results. First, we consider A to be a convex body whose boundary is the union of finitely many smooth pieces, and provide an algorithm (Csample) that generates (almost) uniformly random points from the surface of this body, and prove that its complexity is O (d4 ) per sample, where is the variati...

• Type: Conference
• Year: 2008
• Where: APPROX
• Authors: Hariharan Narayanan, Partha Niyogi
• Keywords: Algorithm, Algorithms, APPROX 2008, Random Samples, Uniform Random Samples