Sampling Hypersurfaces through Diffusion

DOI10.1007/978-3-540-85363-3_42zbMath1159.68647OpenAlexW1577226338MaRDI QIDQ3541818

Partha Niyogi, Hariharan Narayanan

Publication date: 27 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85363-3_42

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20)

Related Items (4)

Rapid mixing of geodesic walks on manifolds with positive curvature ⋮ Stochastic Billiards for Sampling from the Boundary of a Convex Set ⋮ Patch area and uniform sampling on the surface of any ellipsoid ⋮ Randomized interior point methods for sampling and optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Covering problems for Brownian motion on spheres
• The Brunn-Minkowski inequality in Gauss space
• Random vectors in the isotropic position
• Computational homology
• Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
• Diffusion maps
• Heat flow and a faster algorithm to compute the surface area of a convex body
• Mixing rates for Brownian motion in a convex polyhedron
• Hit-and-run from a corner
• A random polynomial-time algorithm for approximating the volume of convex bodies
• Computing persistent homology
• Solving convex programs by random walks

This page was built for publication: Sampling Hypersurfaces through Diffusion