Geometry-based triangulation of trimmed NURBS surfaces

被引:60
作者
Piegl, LA
Tiller, W
机构
[1] Univ S Florida, Dept Comp Sci & Engn, Tampa, FL 33620 USA
[2] Geomware Inc, Tyler, TX 75703 USA
基金
美国国家科学基金会;
关键词
trimmed surfaces; NURBS; triangulation;
D O I
10.1016/S0010-4485(97)00047-X
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
An algorithm for obtaining a piecewise triangular approximation of a trimmed NURBS surface is presented. The algorithm is geometry based, i.e. the surface is subdivided into triangular facets based on its geometric characteristics and not on its parametrization. No assumption is made about the surface's parametrical representation; it does not have to be continuously differentiable, only C-0 continuity is assumed. The surface subdivision is performed in model space, however, the triangulation is carried out in parameter space using the parametric vertices of subdivision rectangles, Along with computing the triangulation, the method produces a compact database for browsing in the triangular irregular network, e.g. finding all neighbors of a given triangle. (C) 1998 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:11 / 18
页数:8
相关论文
共 29 条
[11]  
Filip D., 1986, Computer-Aided Geometric Design, V3, P295, DOI 10.1016/0167-8396(86)90005-1
[12]   A tessellation algorithm for the representation of trimmed NURBS surfaces with arbitrary trimming curves [J].
Hamann, B ;
Tsai, PY .
COMPUTER-AIDED DESIGN, 1996, 28 (6-7) :461-472
[13]  
HU YP, IN PRESS COMPUTER AI
[14]   EFFICIENT RENDERING OF TRIMMED NURBS SURFACES [J].
KUMAR, S ;
MANOCHA, D .
COMPUTER-AIDED DESIGN, 1995, 27 (07) :509-521
[15]   THEORETICAL DEVELOPMENT FOR THE COMPUTER-GENERATION AND DISPLAY OF PIECEWISE POLYNOMIAL SURFACES [J].
LANE, JM ;
RIESENFELD, RF .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1980, 2 (01) :35-46
[16]  
LASSER D, 1995, COMP SUPPL, V10, P227
[17]  
LUKEN WL, 1993, 1866981711 IBM RES C
[18]  
LUKEN WL, 1993, 1932284059 IBM RES C
[19]  
MICHEL D, 1996, P ADV COMPUTER AIDED, P100
[20]  
MILLER JR, 1986, IEEE COMPUT GRAPH, V6, P33