文件名称:sanjiao
介绍说明－－下载内容均来自于网络，请自行研究使用
最小权重三角划分。输入一个多边形顶点坐标，输出具有最小权重的三角划分。(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 meet edge-to-edge and vertex-to-vertex, in such a way as to minimize the sum of the perimeters of the triangles. )
(系统自动生成,下载前可以参看下载内容)
下载文件列表
sanjiao
sanjiao\.classpath
sanjiao\.project
sanjiao\.settings
sanjiao\.settings\org.eclipse.jdt.core.prefs
sanjiao\bin
sanjiao\bin\sanjiao
sanjiao\bin\sanjiao\Main.class
sanjiao\bin\sanjiao\PolygonTri.class
sanjiao\bin\sanjiao\first.class
sanjiao\src
sanjiao\src\sanjiao
sanjiao\src\sanjiao\Main.java
sanjiao\src\sanjiao\first.java
sanjiao\test_10.txt
sanjiao\test_30.txt
sanjiao\.classpath
sanjiao\.project
sanjiao\.settings
sanjiao\.settings\org.eclipse.jdt.core.prefs
sanjiao\bin
sanjiao\bin\sanjiao
sanjiao\bin\sanjiao\Main.class
sanjiao\bin\sanjiao\PolygonTri.class
sanjiao\bin\sanjiao\first.class
sanjiao\src
sanjiao\src\sanjiao
sanjiao\src\sanjiao\Main.java
sanjiao\src\sanjiao\first.java
sanjiao\test_10.txt
sanjiao\test_30.txt