A randomized algorithm exactly samples weighted partial triangulations of convex polygons in expected O((n sqrt(lambda) + 1) log n) time for large n.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On weighted partial triangulations of convex polygons
A randomized algorithm exactly samples weighted partial triangulations of convex polygons in expected O((n sqrt(lambda) + 1) log n) time for large n.