All Questions
1 question
3
votes
1
answer
136
views
Surfaces generated by minimum-weight triangulations
The minimum-weight triangulation of simple polygons can be efficiently calculated in $O(n^3)$ time by dynamic programming, while it is $\text{NP-hard}$ for pointsets in general.
Looking at the ...
- 151k