Latest revision |
Your text |
Line 15: |
Line 15: |
| ON_BrepTrimArray m_T;//trims | | ON_BrepTrimArray m_T;//trims |
| ON_BrepVertexArray m_V;//vertexs | | ON_BrepVertexArray m_V;//vertexs |
− | [[Image:brep.jpg]]
| + | figure:[http://brlcad.org/w/images/5/5e/Brep.jpg] |
− | figure:[http://brlcad.org/w/images/5/5e/Brep.jpg] | |
| | | |
| == 9 May 2012 == | | == 9 May 2012 == |
Line 221: |
Line 220: |
| | | |
| === 6 July 2012 === | | === 6 July 2012 === |
− | *add a trimcurve for ell.brep and hyp.brep manually to test trimming | + | *add a trimcurve for ell.brep and hyp.brep manually to test |
− | *ell:left:top view,right:left view
| + | left:top view right:left view |
− | [[Image:Ell1.png]] [[Image:Ell2.png]] | + | [[Image:Ell1.png]] [[Image:Ell2.png]] |
− | *ell:left:local view,right:uv region
| + | left:local view |
− | [[Image:Ell3.png]] [[Image:Ell4.png]] | + | [[Image:Ell3.png]] |
− | | |
− | *hyp:
| |
− | [[Image:HYP1.png]] [[Image:HYP2.png]]
| |
− | [[Image:HYP3.png]] [[Image:HYP4.png]]
| |
− | | |
− | === 8 July 2012 ===
| |
− | *continue to debug 'doTrimming'.There exists a situation that some trim leafs' bboxings overlap and it is difficult to find the nearest trim leaf above a surface leaf's bboxing in uv. Function 'prepTrim' mark the surface leaf in such situation as 'm_checkTrim = true'.But in some cases, the surface leaf is trimmed out.I changed the subdivision depth to 10 manually and tested the rhino0.s in mged.Some surface leaves which should be trimmed out are still remain.So, need a more accuracy method to check it.
| |
− | *image: some BBoxing in uv which should be trimmed are still remain(right bottom conner).
| |
− | [[Image:rhino.png]] [[Image:rhino1.png]]
| |
− | | |
− | === 10 July 2012 ===
| |
− | *find a algorithm for 'TrimLoop' triangulation,algorithm has the steps below:
| |
− | a) make the node in 'TrimLoop' to form a linked list.
| |
− | | |
− | b)for each triangle form by p0,p1,p2 successive in linked list,calculate the minimum inside angle.
| |
− | | |
− | c)find the triangle which has the max minimum inside angle, then record the triangle and remove the point p1 in the triangle
| |
− | | |
− | d)come to (a) until there only exists three points in the linked list
| |
− | | |
− | === 12 July 2012 ===
| |
− | *Update my patches.
| |
− | | |
− | ==''Week 10''==
| |
− | | |
− | === 1 Augest 2012 ===
| |
− | *because of pressure of my paper schedule, I need to leave for a long time.I must
| |
− | say sorry that I will not complete the final-evaluation for gsoc.
| |
− | | |
− | ==''Week 11''==
| |
− | | |
− | === 6 Augest 2012 ===
| |
− | *I'v package my patch into three part after cleaning up and adding some comments.
| |
− | I think the subdividion is OK some more test must be done to ensure my trimming algorithm is accurate enough.
| |
− | *because of large amount of code need to be cleaned up and test but time is up, I decide to handle my paper firstly.
| |
− | *But I will come back and complete my work finally.
| |