動(dòng)態(tài)規(guī)劃 三角劃分

1、minimum-weight triangulationthe 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 cdgc-to-cdgc and vcrtcx-to-vcrtcx, in such a way

2、 as to minimize the sum of the perimeters of the triangles.2. question：suppose a convex polygon has vertexes 坨,.,此 the cost of a triangulation is just the sum of the weights of its component triangles. please design and implement a program to find a triangulation with the minimum cost.2.1 input: the

3、 number of vertexes of a convex polygon and the coordinates of all the vertexes. get the testing data in file fc,2.2 output: the sum of the perimeters of its component triangles and the corresponding point-to-point links. please use the label used in the test data file.3. theoretical analysisy。vnif

4、the convex edge shape of p (n + 1) = vo, v 1,.vn the optimal t contains vovkvn triangle, lv=kv=ni, the right of the t include three parts: the weight of (he triangle vovkvn , sub polygons (vo, vl,.vk) and vk, v(k + l),.vii.we can assert that subdivision which determined by t polygon triangle is opti

5、mal too.because if a vo, vl,.vk or vik, vk + l,.,.vn will lead to the right of the smaller triangle subdivision t isnot optimal triangle subdivision of contradictions.tijoj 刁for t |1| n, can be used by a bottom-up. from the chain length (polygon edges) of 2, each time for t i j, wc choose the minimu

6、m value, and record the minimum value of k, according lo the nature of optimal substructure, we can finally calculate the minimum t 1 n.4. pseudo-codeinitial t nn pnn;for each i=jj=i+r;flag=«min=+ 8 ；*or(k-i： j)(lengths»length( <v(i-l)vkvj); sum-tikkk*l j>lengths; if(sum<min)(min=

7、sum;flag*)pij=«ag；)/outputfind( int i,int j,int p () if(i=j) return ;find(i,pij,p);find(piju,j,p);print(mtriangle : vr(e)+”,5>running resultwhen n=io* pcoblenu ? jdvdjoc et dec i j rationc project migrationterminated> triagl java application) damyeclipsexmyedipscxbinarcom.sun 入rd個(gè)tn10核嘴由i

8、m： v2,v4,v3m.蘭引分3女；fljv4,v2三庠5 v4jv6jv5=色機(jī)分璋/ v1uv4mm知5巾 v6,v8,v7二免主分攻巾v6,v9,v8s+.m v1,v9,v6ve,v9,viwhen n=30融 problem: javadoc 匿 declaration戶(hù) project migration.:：【.，.，： ii，j a33：d:',n' ezlis-':.biry' ,on "ih、w.，.入矛牛金：3。|z角,.分厚.,.v0,v2,v1mm" v0,v4»v2- v4,v6,v5三購(gòu)配分e耳說(shuō)丹刀京.v7.v9,v8m竺生丹jj.v v4,v9,v7v9jv11,v10三免鑰分京/ v11,v13,v12vnvivn v9,v14,v11二角登分理.4 v1sm7m6n角生分厚.*. vm,v17,v15v9,v17,v14w免象分用吱v4,v17,v9三購(gòu)強(qiáng)分jf* y18jv20,v19m«!免分jj京.vls,v2i,v2e.坎外 71721,718m"泌m