CoBarS: Fast reweighted sampling for polygon spaces in any dimension
Abstract
We present the first algorithm for sampling random configurations of closed n-gons with any fixed edgelengths r1, …, rn in any dimension d which is proved to sample correctly from standard probability measures on these spaces. We generate open n-gons as weighted sets of edge vectors on the unit sphere and close them by taking a M\"obius transformation of the sphere which moves the center of mass of the edges to the origin. Using previous results of the authors, such a M\"obius transformation can be found in O(n) time. The resulting closed polygons are distributed according to a pushforward measure. The main contribution of the present paper is the explicit calculation of reweighting factors which transform this pushforward measure to any one of a family of standard measures on closed polygon space, including the symplectic volume for polygons in R3. For fixed dimension, these reweighting factors may be computed in O(n) time. Experimental results show that our algorithm is efficient and accurate in practice, and an open-source reference implementation is provided.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.