Editing User:Plussai/GSoC 2012 log
From BRL-CAD
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
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 | ||
− | + | 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 237: | Line 236: | ||
=== 10 July 2012 === | === 10 July 2012 === | ||
− | *find a algorithm for 'TrimLoop' triangulation, | + | *find a algorithm for 'TrimLoop' triangulation,it has some steps below: |
a) make the node in 'TrimLoop' to form a linked list. | 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. | 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 | 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 | d)come to (a) until there only exists three points in the linked list | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− |