Basics of Computer Graphics

This ultimate free unique application is for all students of Computer Science Engineering studying Computer Graphics across the world. It covers 232 topics of Computer Graphics in detail. These 232 topics are divided in 5 units. Each topic is around 600 words and is complete with diagrams, equations and other forms of graphical representations along with simple text explaining the concept in detail Basically, each topic is like a detailed flash card and will make the lives of students simpler and easier. Some of topics Covered in this application are: 1) Introduction to Computer Graphics 2) Video Controller 3) Cathode-Ray Tubes (CRT) 4) The Shadow - Mask CRT 5) Color CRT Monitors 6) Raster Scan display 7) Randam Scan Systems 8) Random Scan display Processor 9) Comparison between raster and vector graphics 10) Color CRT Monitors 11) Direct-View Storage Tubes 12) Flat-Panel Displays 13) Three-Dimensional Viewing Devices 14) Three Dimensional Devices 15) Input Devices 16) Hard Copy Devices 17) Graphics software 18) Coordinate Representations 19) Graphics Functions 20) Plasma displays 21) Video Display Devices 22) Software Standards 23) Coordinate System 24) LCD(Liquid Crystal Display) Monitors 25) LED(light-emitting diode) 26) SVGA (Super Video Graphics Array) 27) Distance between a Point, Line and Vectors 28) Video Graphics Array (VGA) 29) Polar Coordinates 30) Normalized Device Coordinates 31) Points and Lines 32) Line Drawing Algorithm 33) Line Segments 34) Lines 35) Digital Differential Analyzer (DDA) 36) Line Drawing Algorithm for DDA 37) Symmetrical DDA(Digital Differential Analyzers) 38) The incremental DDA Algorithm 39) Ellipse 40) Bresenham\'s Line Drawing Algorithm 41) Parallel line Algorithms 42) Frame Buffer 43) Line Function 44) Circle Drawing 45) Properties of Circles 46) midpoint circle algorithm for drawing circle 47) ELLIPSE-GENERATING ALGORITHMS 48) MIDPOINT ELLIPSE ALGORITHM (Bresenham\'s Circle Algorithm) 49) Other curves 50) Various ways to represent a curve 51) Curve functions 52) PARALLEL CURVE ALGORITHMS 53) DDA ALGORITHM FOR CIRCLE 54) A straightforward line drawing algorithm 55) continuity condition on curve 56) Convex hull property of circle 57) Scan line polygon fill algorithm 58) Pixel addressing and object geometry 59) Pixel addressing and object geometry 60) Filled-area primitives 61) Primitives 62) Primitive Operations 63) Graphics Pipeline 64) Graphics Primitives 65) Plasma Panels 66) Visible-Surface Detection Algorithms 67) line attribute 68) Line Width 69) Pen and Brush Options for lines 70) Curve attribute 71) Area-fill Attribute 72) Character attribute of fonts 73) BUNDLED ATTRIBUTES FOR CHARACTERS 74) Inquiry functions 75) Color and gray scale levels 76) Pixels and Frame Buffers and Lines Segments 77) Point plotting 78) ANTIALIASING 79) Rotation 80) Rotation transformation operation on an image 81) Scaling 82) Translations 83) Transformations 84) Scaling Transformation operation on an image 85) Various transformation operations that can be performed on an image 86) Transformation functions 87) Other transformations 88) Transformations between co-ordinate system 89) Affine transformations 90) Raster method of transformations 91) Homogeneous Coordinates System 92) Perpendicular lines 93) Matrix reresentation and homogenious coordinates 94) Composite transformations 95) The viewing pipeline 96) Viewing coordinate reference frame 97) window to viewport coordinate transformation 98) Two dimension viewing function 99) Clipping operations 100) Point clipping and line clipping 101) Cohen Sutherland line clipping algorithm 102) Cohen-Sutherland Line Clipping 103) Liang-Barsky Line Clipping 104) Nicholl-Lee-Nicholl Line Clipping 105) Line clipping Using Nonrectangular Clip Window