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 meet edge-to-edge and vertex-to-vertex, in such a way as to minimize the sum of the perimeters of the triangles.
To Search:
File list (Check if you may need any files):
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
Download