摘要
针对经典Sutherland-Hodgman裁剪算法存在冗余操作并可能产生重复图元,从而造成不必要扫描处理的问题,尝试通过在两重循环的过程中增加必要的判断和出口,以实现对经典算法的改进。改进算法的合理性可从理论上获得证明。仿真结果表明改进算法能够达到减少操作次数和避免重复图元产生的目的。
The Classic Sutherland-Hodgman clipping algorithm has redundancy and may output repetitive primitives which can cause unnecessary scanning. By adding the necessary judgments and the exports in the round-robins, an advanced algorithm is proposed to improve the classical algorithm. In this paper the correctness and the advantage of the advanced algorithm is proved in theory. Simulation results show that the advanced algorithm can achieve the purpose of reducing the number of operations and avoiding the repetitive primitives.
出处
《西安邮电学院学报》
2013年第3期80-82,共3页
Journal of Xi'an Institute of Posts and Telecommunications
基金
国家自然科学基金资助项目(90607008)
