Fundamental Algorithms of Computer Graphics and the Needs for New Display Materials

Abstract

Three fundamental algorithms of computer graphics are presented first. The first one is an algorithm for approximating the curve with a curve-intersecting poly-line. The idea can also be used for surface approximating. The second one is an efficient algorithm for line clipping against convex windows. It sets a basis for polygon clipping. The third one is an algorithm for recognition of the chain code of curves with the method of computer graphics. The testing results show that the new algorithms not only can recognize both the perfect chain code and the chain code with noise, but also with a high speed. Then the advantages of the hexagonal grid over the traditional square grid for graphics display and our research works on the attempt for implementing the hexagonal grid display are introduced. Moreover a demand for a new optical material for a physical 3-D display that we imagine is given. Finally, an application of graphical technique on processing and recognizing of NaXi Pictographs used by Chinese national minority NaXi are introduced.