/title> <o:SmartTagType namespaceuri="urn:schemas-microsoft-com:office:smarttags" name="PlaceType"/> <o:SmartTagType namespaceuri="urn:schemas-microsoft-com:office:smarttags" name="PlaceName"/> <o:SmartTagType namespaceuri="urn:schemas-microsoft-com:office:smarttags" name="City"/> <o:SmartTagType namespaceuri="urn:schemas-microsoft-com:office:smarttags" name="place"/>  <style>  </style>  </head> <body lang=ZH-CN style='tab-interval:21.0pt;text-justify-trim:punctuation'> <div class=Section1 style='layout-grid:15.6pt'> <p class=MsoNormal><b style='mso-bidi-font-weight:normal'><span lang=EN-US style='font-size:16.0pt'>Mesh Simplification Based on Shading Characteristic<o:p></o:p></span></b></p> <p class=MsoNormal><span lang=EN-US><o:p> </o:p></span></p> <p class=MsoNormal><span lang=EN-US>Zhang H., <span class=SpellE>Shu</span> H.Z., Luo L.M.<span lang=EN-US style='mso-bidi-font-size:10.5pt'><o:p></o:p></span></p> <p class=MsoNormal><st1:place><st1:PlaceName><span lang=EN-US style='mso-bidi-font-size: 10.5pt'>Southeast</span></st1:PlaceName><span lang=EN-US style='mso-bidi-font-size: 10.5pt'> </span><st1:PlaceType><span lang=EN-US style='mso-bidi-font-size: 10.5pt'>University</span></st1:PlaceType></st1:place><span lang=EN-US style='mso-bidi-font-size:10.5pt'>,<o:p></o:p></span></p> <p class=MsoNormal><span class=GramE><span lang=EN-US style='mso-bidi-font-size: 10.5pt'>Dept.</span></span><span lang=EN-US style='mso-bidi-font-size:10.5pt'> Of Biomedical Engineering,<o:p></o:p></span></p> <p class=MsoNormal><span lang=EN-US style='mso-bidi-font-size:10.5pt'>210096, </span><st1:City><st1:place><span lang=EN-US style='mso-bidi-font-size:10.5pt'>Nanjing</span></st1:place></st1:City><span lang=EN-US style='mso-bidi-font-size:10.5pt'>, <o:p></o:p></span></p> <p class=MsoNormal><span lang=EN-US style='mso-bidi-font-size:10.5pt'>P.R. China</span><span lang=EN-US><o:p></o:p></span></p> <p class=MsoNormal><span lang=EN-US><o:p> </o:p></span></p> <p class=MsoNormal><span class=SpellE><span lang=EN-US>zh@seu.edu.cn</span></span></p> <p class=MsoNormal><span lang=EN-US><o:p> </o:p></span></p> <p class=MsoNormal><span lang=EN-US>Keyword:</span></p> <p class=MsoNormal style='text-indent:18.0pt'><span lang=EN-US>Mesh Simplification <span style='mso-spacerun:yes'> </span>Vision Characteristic<span style='mso-spacerun:yes'> </span><span style='mso-spacerun:yes'> </span>Edge Collapse<span style='mso-spacerun:yes'> </span><span style='mso-spacerun:yes'> </span>Triangle Decimation</span></p> <p class=MsoNormal><span lang=EN-US><o:p> </o:p></span></p> <p class=MsoNormal><span lang=EN-US>Abstract:</span></p> <p class=MsoNormal><span lang=EN-US><span style='mso-tab-count:1'> </span>Mesh simplification is a key research area in scientific visualization and virtual reality. The paper presents a new method of polyhedral model simplification based on vision characteristic and edge collapse. This method determines model’s vision characteristic by computing the maximum product of angle between normal of vertex and adjacent triangles with area of these triangles. It can achieve a high decimation rate, while keeping the details of vision. This algorithm can also be extended to triangle decimation criterion easily.</span></p> <p class=MsoNormal style='text-indent:18.0pt'><span lang=EN-US style='mso-bidi-font-size:10.5pt'>Our algorithm uses the mechanism of vertex merging, and it is described as below: At first compute the normal <span class=GramE>Nor(</span>T<sub>i</sub>) of each triangle, then use some methods to calculate the influence value of each vertex. The two methods we used are to calculate the vision characteristic CA (</span><span lang=EN-US>V</span><sub><span lang=EN-US style='mso-bidi-font-size:10.5pt'>i</span></sub><span lang=EN-US style='mso-bidi-font-size:10.5pt'>) or super height <span class=GramE>SH(</span></span><span lang=EN-US>V</span><sub><span lang=EN-US style='mso-bidi-font-size:10.5pt'>i</span></sub><span lang=EN-US style='mso-bidi-font-size:10.5pt'>), which represent the influence of curvature to result image. Sort these vertexes, according to its influence in vision characteristic; Pick out the first vertex in the queue, as the first candidate point to collapse. Select another one <span class=SpellE><span class=GramE>V<sub>j</sub></span></span> from adjacent vertex set NV (</span><span lang=EN-US>V</span><sub><span lang=EN-US style='mso-bidi-font-size:10.5pt'>i</span></sub><span lang=EN-US style='mso-bidi-font-size:10.5pt'>). The policy is to select one which can generate the least characteristic vision value of changed vertex; <span class=GramE>Finally</span> interpolate the related properties of </span><span lang=EN-US>V</span><sub><span lang=EN-US style='mso-bidi-font-size:10.5pt'>i</span></sub><span lang=EN-US style='mso-bidi-font-size:10.5pt'> and <span class=SpellE>V<sub>j</sub></span>, such as vertex position, normal, texture. Then use the new vertex </span><span class=SpellE><span lang=EN-US>V</span><sub><span lang=EN-US style='mso-bidi-font-size: 10.5pt'>k</span></sub></span><span lang=EN-US style='mso-bidi-font-size:10.5pt'> to replace </span><span class=GramE><span lang=EN-US>V</span><sub><span lang=EN-US style='mso-bidi-font-size:10.5pt'>i</span></sub></span><span lang=EN-US style='mso-bidi-font-size:10.5pt'> and <span class=SpellE>V<sub>j</sub></span>, delete the regressive triangle. Calculate the value of new point </span><span class=SpellE><span lang=EN-US>V</span><sub><span lang=EN-US style='mso-bidi-font-size: 10.5pt'>k</span></sub></span><span lang=EN-US style='mso-bidi-font-size:10.5pt'> and its adjacent vertex set, and arrange their new position in the vertex queue, repeat last two processed, until reach the required triangle number.<o:p></o:p></span></p> <p class=MsoNormal style='text-indent:18.0pt'><span lang=EN-US style='mso-bidi-font-size:10.5pt'>The effect is obvious when vision characteristic value is introduced into edge collapse algorithm. It produces high quality decimation result, while easy to code. This algorithm can also automatically recognize and simplify the nearby co-planar triangle, while keeping the key vertex. Our algorithm can be used to automatic generation of virtual reality and interactive visualization.</span></p> </div> </body> </html>