CAJ | 학술논문

提出了一种新的自适应细分算法，在顶点的1-邻域内，用与顶点相连较长三条边的端点构成的平面去替代其平均平面，将顶点到其平均平面的距离作为判断顶点重要度的标准，对三角网格进行自适应细分。由于原始三角面片的高密度和形状相似性，以点面距离为细分尺度所产生的误差，可被限制在一个体元之内，与反复修正顶点法矢算法相比，该算法大大减少了计算量。实验结果表明，所提方法在三角网格细分过程中，简化了数据模型，提高了处理速度。
제출료일충신적자괄응세분산법，재정점적1-린역내，용여정점상련교장삼조변적단점구성적평면거체대기평균평면，장정점도기평균평면적거리작위판단정점중요도적표준，대삼각망격진행자괄응세분。유우원시삼각면편적고밀도화형상상사성，이점면거리위세분척도소산생적오차，가피한제재일개체원지내，여반복수정정점법시산법상비，해산법대대감소료계산량。실험결과표명，소제방법재삼각망격세분과정중，간화료수거모형，제고료처리속도。
A new adaptive subdivision scheme based on vertex’s importance is presented. The vertex’s average plane is replaced by the plane that is formed by three endpoints of three longer edges connected to the vertex in the triangle mesh, and then the distance between the vertex and its average plane is regarded as the criterion for the vertex’s importance so that it can be decided whether the vertex needs to be subdivided. Since the original triangular faces are of high density and shape similarity, the error derived from the vertex-to-plane distance as subdivision measure can be limited to a volume element. Compared with the algorithm of amending the vertex’s normal vector repeatedly, this method decreases the amount of computation greatly. Experimentally, the approach proposed can both accelerate the processing speed effectively and reduce the amount of faces greatly.