A linear-time algorithm samples confined equilateral polygons via combinatorial sampling of a symplectic moment polytope, yielding explicit distance formulas and a curvature conjecture.
Optimal generation of strictly increasing binary trees and beyond
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GT 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Direct Sampling of Confined Polygons in Linear Time
A linear-time algorithm samples confined equilateral polygons via combinatorial sampling of a symplectic moment polytope, yielding explicit distance formulas and a curvature conjecture.