Description: The minimum-weight triangulation problem is the problem of finding a triangulation of minimal total edge length. That is, an input polygon or the convex hull of an input point set must be subdivided into triangles that m
Platform: |
Size: 7168 |
Author: 曾 |
Hits: