.png){kind=icon}
.png){kind=icon}
Return
T-Splines Local Refinement Based on Half-Edge Data Structure
.png){kind=icon}
PRE
AI
DOI：10.1007/978-981-95-4821-7_11.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Compared with other geometric modeling methods, T-spline have had a profound impact on multiple aspects of intelligent manufacturing through flexible local refinement ability and efficient data representation. For the convenience of programming, the Half-edge data structure is usually used to calculate T-spline. Based on this, this paper presents T-splines local refinement based on Half-edge data structure. We have defined the blending function object and based on this, we determine the legitimacy of the T-mesh. This paper also presents the information update situation of T mesh based on Half-edge data structure during local refinement, and avoids the generation of L-junction, thereby avoiding the overly complex topology structure of the T-mesh.
Keywords:
T-splines
Local refinement
Half-edge data structure
Journal
A
IF:
0
Papers:
26
Citations:
0