Assertion: simple polygon | /r/CapableOf | use dynamic programming
Facets:
Source sentences:
text: It is possible to compute the number of distinct triangulations of a simple polygon in polynomial time using dynamic programming, and (based on this counting algorithm) to generate uniformly random triangulations in polynomial time.