基于圆形窗口的简单多边形裁剪算法
摘 要
提出了一种新颖而实用的圆形窗口V对多边形P的裁剪算法。它将多边形P的边视为有向线段,通过引入多边形顶点的入边和出边交点的概念,深入研究了P被V裁剪后的区域确定问题,给出了作出P在V内部分的定理
关键词
Polygon Clipping Against A Circular Window
() Abstract
A simple and practical clipping algorithms for a polygon P is offered based on a circular window V. It considers the edges of the polygon as directed lines, and studies the problem of deciding the area edge of P clipping by V, based on the intersection point concept of in edges and out edges of the polygon vertices. The theorems about what is the inner part of the polygon P within a circular window V are presented.
Keywords
|