期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
DIRECT AND ADAPTIVE SLICING ON CAD MODEL OF IDEAL FUNCTIONAL MATERIAL COMPONENTS (IFMC) 被引量:3
1
作者 XuDaoming JiaZhenyuan GuoDongming 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2005年第1期139-144,共6页
A brand new direct and adaptive slicing approach is proposed, which canapparently improve the part accuracy and reduce the building time. At least two stages are includedin this operation: getting the crossing contour... A brand new direct and adaptive slicing approach is proposed, which canapparently improve the part accuracy and reduce the building time. At least two stages are includedin this operation: getting the crossing contour of the cutting plane with the solid part anddetermining the layer thickness. Apart from usual SPI algorithm, slicing of the solid model has itsspecial requirements. Enabling the contour line segments of the cross-section as long as possible isone of them, which is for improving manufacturing efficiency and is reached by adaptively adjustingthe step direction and the step size at every crossing point to obtain optimized secant height. Thelayer thickness determination can be divided into two phases: the geometry-based thicknessestimation and the material-based thickness verifying. During the former phase, the geometrytolerance is divided into two parts: a variety of curves are approximated by a circular arc, whichintroduces the first part, and the deviation error between the contour line in LM process and thecircular arc generates the second part. The latter phase is mainly verifying the layer thicknessestimated in the former stage and determining a new one if necessary. In addition, an example usingthis slicing algorithm is also illustrated. 展开更多
关键词 Rapid prototyping Ideal functional material components Direct and adaptiveslicing Surface/plane intersection MARCHING
下载PDF
THE INTERSECTION OF A TRIANGULAR BEZIER PATCHAND A PLANE
2
作者 Jernej Kozak 《Journal of Computational Mathematics》 SCIE CSCD 1994年第2期138-146,共9页
In this paper, the problem of finding the intersection of a triangular Bezier patch and a plane is studied. For the degree that one frequently encounters in practice, i.e. n = 2,3, an efficient and reliable algorithm ... In this paper, the problem of finding the intersection of a triangular Bezier patch and a plane is studied. For the degree that one frequently encounters in practice, i.e. n = 2,3, an efficient and reliable algorithm is obtained, and computational steps are presented. 展开更多
关键词 THE INTERSECTION OF A TRIANGULAR BEZIER PATCHAND A plane
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部