C-F填图法——一种集修剪与填充功能于一体的算法

C-F FILLING ALGORITHM——A NEW-ALGORITHM FOR. FILLING WITH CLIPPING FUNCTION

本文提出了一种新的填图算法,其集修剪与填充功能于一体,当阴影线间隔d≥t-b时(t,b分别为窗口的上、下边线值),则可完成单纯的修剪功能.同传统的AET算法不同,本算法着眼于多边形的顶点,且将多边形的边视为有向线段,分别为某一顶点的入边或出边.本文给出了有关的一些定义,及作出多边形P在窗口V之内部分的定理.

A new filling algorithm is presented which serves the needs of the fillingwith clipping as well as clipping-only functions. Different from the other algorithms, it fo-cuses on the vertices of the polygon. It considers the edges of the polygon as directed lines, and they are in-edges or out-edges of the vertices. A theorem about what is the inner part of a polygon P within a window V is also given.