2019年7月9日
Minimum Score Triangulation of Polygon
摘要： Given N, consider a convex N-sided polygon with vertices labelled A[0], A[i], ..., A[N-1] in clockwise order. Suppose you triangulate the polygon into 阅读全文
posted @ 2019-07-09 09:33 北叶青藤 阅读(618) 评论(0) 推荐(0) 编辑