Characterization of Trimmed NURBS Surface Boundaries Using Topological Criteria

被引:0
作者
Mohammed Khachan
François Guibault
Hafsa Deddi
机构
[1] Computer Engineering,
[2] École Polytechnique de Montréal,undefined
[3] LACIM,undefined
[4] Université du Québec à Montréal,undefined
来源
Numerical Algorithms | 2003年 / 34卷
关键词
NURBS; trimmed surface; Jordan curve theorem; boundary characterization;
D O I
暂无
中图分类号
学科分类号
摘要
This paper presents an approach based on topology for the determination of characteristics and properties of curves used in the trimming of NURBS surfaces. Through discrete subdivision and topological criteria, a method is presented to determine characteristics of the boundary; such as whether the set of trimming curves forms a set of closed loops, whether trimming curves contain singularities or self intersections, and whether the boundary is simply connected. A surface mesh partitionning the parameter space is used, formed of isoparametric lines in both parametric directions. Topological properties of the cells of this mesh and their intersections with the trimming curves allow to localize the boundary. Topological treatment of this localization allows to define the interior and exterior of the face, and to refine the boundary localization. Singularities and self intersections of the boundary as well as voids in the face are investigated through the study of topological properties of neighbors. As an application, an algorithm for point localization is presented that very rapidly allows to determine whether a given point in parameter space lies inside, on the boundary or outside of the trimmed surface.
引用
收藏
页码:355 / 366
页数:11
相关论文
共 26 条
  • [1] Agrawal R.C.(1997)Preservation of topological properties of a simple closed curve under digitalization Comput. Vision Image Understanding 67 99-111
  • [2] Sahasrabudhe S.C.(1998)Approximate development of trimmed patches for surface tessellation Comput.-Aided Design 30 1077-1087
  • [3] Shevgaonkar R.K.(1986)Surface algorithms using bounds on derivatives Comput.-Aided Geom. Design 3 295-311
  • [4] Cho W.(1979)Operations on images using quadtrees IEEE Trans. Pattern Anal.Mach. Intelligence 1 145-153
  • [5] Patrikalakis N.M.(2000)Polyhedral representation and adjacency graph in Comput. Vision Image Understanding 79 428-441
  • [6] Peraire J.(1985)-dimensional digital images Comput. Vision Graph. Image Process 32 221-243
  • [7] Filip D.(2001)A theory of binary digital pictures Comput.-Aided Design 33 463-481
  • [8] Magedson R.(1998)Trimming for subdivision surfaces Comput.-Aided Design 30 11-18
  • [9] Markot R.(2001)Geometry-based triangulation of trimmed NURBS surfaces Comput.-Aided Design 33 439-454
  • [10] Hunter G.M.(1975)Geometry based triangulation of multiple trimmed NURBS surfaces Inform. Control 29 292-293