Drawing And Clipping Of Lines And Curves

Computer Graphics is one of the most activitiest subjects on the Computer Science, and make the rapid development along with. the development of the Computer Technology. In fact, Computer Graphics indicate the developmental level of the Computer software and hardware, This is because Graphics have become the most important medium to transfer all kinds of information. Computer Graphics?research object is graphics, and the point , line and surface make up of the graphics ,In addition, During the real application, every graphics is made up of millions of the lines and curves, the speed and quality of the line and curve affected the implement of the whole graphics. The research algorithm to the line and curve is the most important on the whole Computer Graphics. This thesis researches the basis algorithm of the Computer Graphics. It includes the algorithm of the line and curve, clipping algorithm and graphics transformation.The first chapter summarizes the development of the Computer Graphics basis algorithm.The second chapter present some efficient algorithm: ellipse ,hyperbola and parallel line.The third chapter is the clipping . At first, present a curve clipping algorithm. Next, put forward a line clipping algorithm against a general polygon. At last, present a rapid and valid algorithm for decomposing concave polygon.The last chapter elaborate a simple method for graphids transformation.