An efficient approximation of arbitrary curves and surfaces using intersecting polylines and meshes

被引:1
作者
Liu, Yong Kui [2 ]
Yun, Jian [2 ]
Li, Xiao Niu [2 ]
Zalik, Borut [1 ]
机构
[1] Univ Maribor, Fac Elect Engn & Comp Sci, SI-2000 Maribor, Slovenia
[2] Dalian Univ Natl Minor, Dept Comp Sci, Dalian Dev Zone 116600, Peoples R China
基金
中国国家自然科学基金;
关键词
curve; surface; approximation; engineering software;
D O I
10.1016/j.advengsoft.2007.05.012
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper presents ail efficient method for approximating curves and surfaces. Ail idea is introduced using a circle, where ail arc-intersecting polyline is used instead of the traditional inner-arc polyline. The approach is then generalized to arbitrary 2D curves. The method is extended into 3D, where the approximation of spherical surface is developed based oil surface-intersecting facets. Finally, a method is described for approximating the general curved surface. Theoretical analysis and the experimental results showed that the new algorithm requires considerably less geometric data at the same approximation error than the traditional one. (c) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码:535 / 539
页数:5
相关论文
共 7 条
  • [1] Anisotropic polygonal remeshing
    Alliez, P
    Cohen-Steiner, D
    Devillers, O
    Lévy, B
    Desbrun, M
    [J]. ACM TRANSACTIONS ON GRAPHICS, 2003, 22 (03): : 485 - 493
  • [2] Fundamentals of spherical parameterization for 3D meshes
    Gotsman, C
    Gu, XF
    Sheffer, A
    [J]. ACM TRANSACTIONS ON GRAPHICS, 2003, 22 (03): : 358 - 363
  • [3] LIU YK, 1993, COMPUT AIDED DESIGN, V25, P169
  • [4] Liu Yongkui, 1992, Chinese Journal of Computers, V15, P636
  • [5] On the meshing of trimmed 3D surfaces
    Marur, SR
    [J]. ADVANCES IN ENGINEERING SOFTWARE, 2005, 36 (05) : 338 - 345
  • [6] OPTIMAL POLYGONAL-APPROXIMATION OF DIGITAL CURVES
    PIKAZ, A
    DINSTEIN, I
    [J]. PATTERN RECOGNITION, 1995, 28 (03) : 373 - 379
  • [7] Spherical parametrization and remeshing
    Praun, E
    Hoppe, H
    [J]. ACM TRANSACTIONS ON GRAPHICS, 2003, 22 (03): : 340 - 349