
This is an introductory session giving you brief overview of the course contents to understand the concepts and terminologies of polygons.
The definition of polygon and how to identify polygon is discussed in this lecture. Types of polygons such as Convex Polygons, Concave Polygons and Complex Polygons are shown with examples.
To fill any type of polygon at pixel level, we must ensure that the pixels are lying inside the polygon boundary so that the methods to perform inside test are discussed in this lecture.
Here I am discussing method to fill a polygon. The polygon can be filled at pixel level or scan line level. The pixel level polygon filling techniques are discussed.
Two seed fill methods Boundary Fill and Flood Fill are explained with its pseudocode and example.
The Scan- Line Fill Algorithm is explained with example to fill any type of polygon.
In this lecture one example of Scan-Line Algorithm is solved by following the stepwise process. A triangle with coordinates is taken as an example and intersection points are calculated for each edge on the triangle.
Computer graphics deals with generating images with the aid of computers. Today, computer graphics is a core technology in digital photography, film, video games, cell phone and computer displays, and many specialized applications. A great deal of specialized hardware and software has been developed, with the displays of most devices being driven in Computer Graphics. It is a vast and recently developed area of computer science. Computer graphics is responsible for displaying art and image data effectively and meaningfully to the consumer. It is also used for processing image data received from the physical world, such as photo and video content. Computer Graphics is one of the course in Computer Engineering and giving basics to Image Processing domain. It is generally offered to second year of engineering students. In this course the basic concepts of Polygons along with its definition, types of polygons such as Convex, Concave and Complex Polygons and their example are explained. An Inside test methods such as Even-Odd Test and Winding Number Methods are explained with simple examples. Followed with polygon filling methods such as seed fill algorithms such as Boundary Fill algorithm and flood fill algorithm are explained with example and pseudocode. Finally the Scan-Line Fill algorithm is explained with example and stepwise algorithm.