A clipping algorithm for complex2 D graphs based on the robust intersection points seeking method is presented.
首先对于矩形窗口，介绍了直线裁剪算法，圆和椭圆裁剪算法以及参数曲线的裁剪算法。
Based on the analysis of advantages and disadvantages of the existing algorithms, a new algorithm for line clipping was proposed.
在分析已有线裁剪算法优点和缺点的基础上，提出了一种新的一般多边形窗口线裁剪算法。
Clipping algorithm is an basic algorithm in the Computer Graphics and the base of a lot of important task.
裁剪算法是计算机图形学中的基本算法，也是其它诸多重要问题的基础。
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.
通过对直线段相对圆的各种位置关系作深入的研究，提出了一种简单而迅速的圆形窗口裁剪算法。
Presents an algorithm for polyline clipping based on a multiply connected domain formed by finite loops.
提出了一种有限环域裁剪多义线的算法。
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.
图形的裁剪与覆盖是计算机图形学中较为热点研究的问题，作者对此进行了深入的研究与实践，提出了较为理想的圆形窗口“裁剪与覆盖”的计算机辅助设计新算法。
To overcome the disadvantages of the traditional volume clipping algorithm, this paper proposes a fast volume clipping method based on ray-casting.
针对传统图形绘制算法速度慢，质量不高的缺点，提出了一种快速的基于光线投射法的体切割预处理方法。
A new algorithm for the line clipping against a triangle is proposed and described in detail in this paper.
本文详细描述了一种三角形窗口线裁剪的新算法。
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.
在相关文献提出的基于矩形窗口裁剪的圆形窗口裁剪算法的基础上，通过判断圆形窗口与待裁线段的位置关系，提出一个免解二次方程的圆形窗口裁剪算法。
In this thesis, a method of real-time painting and clipping based on GPU Marching Cubes algorithm, with a surface marking rule, is presented.
本文在GPU的移动立方体算法基础之上，提出面标记策略的实时着色与实时切割技术。
In this thesis, a method of real-time painting and clipping based on GPU Marching Cubes algorithm, with a surface marking rule, is presented.
本文在GPU的移动立方体算法基础之上，提出面标记策略的实时着色与实时切割技术。
应用推荐