通过对直线段相对圆的各种位置关系作深入的研究，提出了一种简单而迅速的圆形窗口裁剪算法。
Based on profound study of various position relations between a line segment and a circle, a simple and rapid clipping algorithm for circular window is presented in this paper.
当窗口被其它窗口覆盖或被父窗口裁剪时，在具有WS _ VISIBLE风格位的窗口内的绘图将不会显示。
Any drawing to a window that has the WS_VISIBLE style will not be displayed if the window is covered by other Windows or is clipped by its parent window.
在相关文献提出的基于矩形窗口裁剪的圆形窗口裁剪算法的基础上，通过判断圆形窗口与待裁线段的位置关系，提出一个免解二次方程的圆形窗口裁剪算法。
Through judging the relation of the position between the circle clip window and the line to be clipped, a new line-clipping algorithm is given based on the correlative literatures.
经过视角除法和视口变换两步，顶点的位置就从裁剪空间变换到了窗口空间。
The vertex positions are transformed from clip-space to window space via the Perspective Divide and the Viewport Transform.
在分析已有线裁剪算法优点和缺点的基础上，提出了一种新的一般多边形窗口线裁剪算法。
Based on the analysis of advantages and disadvantages of the existing algorithms, a new algorithm for line clipping was proposed.
现有的圆形窗口对线段的裁剪算法由于包含复杂的计算而难于提高速度。
It is hard to speed up the line clipping for circular Windows due to the complex calculation adopted in the current algorithms.
最后，介绍了圆形和椭圆形窗口的直线裁剪算法。
Finally line clipping algorithms against circles and ellipses are given.
空间数据处理内容广泛，本文选择空间数据处理领域的数据格式转换、椭圆窗口线段裁剪、拓扑关系局部更新方法作为研究的内容。
Three parts have been researched which are the switchover of data format, elliptic window line segment-clipping and the method for updating local topological relation.
已有的多边形裁剪算法都是针对矩形窗口或凸多边形窗口进行的。
Existing polygon clipping algorithms are all offered for a rectangular window or a convex polygonal window.
首先对于矩形窗口，介绍了直线裁剪算法，圆和椭圆裁剪算法以及参数曲线的裁剪算法。
Firstly, to the rectangle window, algorithms for clipping lines, circles and ellipses, as well as parametric curves are introduced.
已有的线裁剪算法都是针对矩形窗口或凸多边形窗口的。
Existing line clipping algorithms are all offered based on a rectangular window or a convex polygonal window.
从多边形窗口线裁剪的本质特征出发，首次提出窗口顶点编码的新概念。
A new concept of the window's vertex encoding is proposed for the first time based on the essential characteristic of the line clipping against polygonal window.
本文首先研究了以窗口变换为基础的编码技术以及球面窗口线裁剪的快速求交技术。
First, encoding technology based on window transformation and a new quick calculating of the intersections between the lines and the spherical surface are discussed.
首先介绍了六角网格坐标系及圆形窗口与待裁剪线段的关系。
Hexagonal grid coordinate and the relation of the circle window and the line to be clipped are demonstrated.
图形的裁剪与覆盖是计算机图形学中较为热点研究的问题，作者对此进行了深入的研究与实践，提出了较为理想的圆形窗口“裁剪与覆盖”的计算机辅助设计新算法。
Graphics clipping and covering is one of the key points in computer graphics field. After more study and practice, a new algorithm is give, which is for clipping and covering in circular window.
在计算机图形学及CAD中，到目前为止所研究的裁剪窗口都是矩形或多边形的，而在实际应用中经常要用到圆形或椭圆形裁剪窗口。
In computer graphics and CAD, the clipping Windows researched up to now are all rectangular or polygonal. But in practice circular or elliptic clipping Windows are often used.
本文详细描述了一种三角形窗口线裁剪的新算法。
A new algorithm for the line clipping against a triangle is proposed and described in detail in this paper.
图形的裁剪与覆盖是计算机图形学中较为热点研究的问题，作者对此进行了深入的研究与实践，提出了较为理想的圆形窗口“裁剪与覆盖”的计算机辅助设计新算法。
Graphics clipping and covering is one of the key points in computer graphics field. Alter more study and practice. a new algorithm is give. which is for clipping and covering in circular window.
首先对于矩形窗口，介绍了直线裁剪算法，圆和椭圆裁剪算法以及参数曲线的裁剪算法。
A clipping algorithm for complex2 D graphs based on the robust intersection points seeking method is presented.
首先对于矩形窗口，介绍了直线裁剪算法，圆和椭圆裁剪算法以及参数曲线的裁剪算法。
A clipping algorithm for complex2 D graphs based on the robust intersection points seeking method is presented.
应用推荐