## Part 12: Hidden Surface Removal and 3D model projection

Hidden Surface Removal One of the most challenging problems in computer graphics is the removal of hidden parts from images of solid objects. In real life, the opaque material of these objects obstructs the light rays from hidden parts and prevents us from seeing...

## Part 11: Three Dimensional Graphics on Computer Graphics

Three Dimensional Graphics The 2D can show two-dimensional objects. Like the Bar chart, pie chart, graphs. But some more natural objects can be represented using 3D. Using 3D, we can see different shapes of the object in different sections. In 3D when a translation is...

## Part 10: Pointing Positioning and Animation Techniques

Pointing and Positioning Techniques Pointing technique refers to look at the items already on the screen whereas the positioning technique refers to position the item on the screen to a new position, i.e., the old current position. The user indicates a position on the...

## Part 9: Clipping and Polygon various Technique algorithm

Clipping: When we have to display a large portion of the picture, then not only scaling & translation is necessary, the visible part of picture is also identified. This process is not easy. Certain parts of the image are inside, while others are partially inside....

## Part 8: 2D Viewing with types in Computer Graphics

Computer Graphics Window: The method of selecting and enlarging a portion of a drawing is called windowing. The area chosen for this display is called a window. The window is selected by world-coordinate. Sometimes we are interested in some portion of the object and...

## Part 7: 2D Transformations with types in Computer Graphics

Introduction of Transformations Computer Graphics provide the facility of viewing object from different angles. The architect can study building from different angles i.e. Front Evaluation Side elevation Top plan A Cartographer can change the size of charts and...

## Part 6: Filled Area Primitives different algorithm on Computer Graphics.

Filled Area Primitives: Region filling is the process of filling image or region. Filling can be of boundary or interior region as shown in fig. Boundary Fill algorithms are used to fill the boundary and flood-fill algorithm are used to fill the interior. Boundary...

## Part 5: Scan conversion an Ellipse using different Methods and Algorithm

Scan Converting a Ellipse: The ellipse is also a symmetric figure like a circle but is four-way symmetry rather than eight-way. Program to Implement Ellipse Drawing Algorithm: #include<stdio.h> #include<conio.h> #include<graphics.h>...

## Part 4: Bresenham’s and Midpoint Circle Algorithm

Bresenham's Circle Algorithm: Scan-Converting a circle using Bresenham's algorithm works as follows: Points are generated from 90° to 45°, moves will be made only in the +x & -y directions as shown in fig: The best approximation of the true circle will be...

## Part 3: Scan conversion on Circle using different Methods

Defining a Circle: Circle is an eight-way symmetric figure. The shape of circle is the same in all quadrants. In each quadrant, there are two octants. If the calculation of the point of one octant is done, then the other seven points can be calculated easily by using...

## Part 2: Scan Conversion on Line Generation Algorithm.

Scan Conversion on Line Generation Algorithm Scan Conversion defer  is a process of representing graphics objects a collection of pixels that is 1(on set) or 0 (offset). In general, a line consist of connecting two points. It is a basic  in computer graphics. In order...

## Part 1: Introduction to Computer Graphics

Introduction of Computer Graphics Generally, it is difficult to display an image of any size on the computer screen. This method is simplified by using Computer graphics. Graphics on the computer are produced by using various algorithms and techniques. This tutorial...

## Frequency Word for IELTS Listening

Frequency Word for IELTS Listening School a. Library  WordSentence1. Shelf 2. Librarian 3. The stacks 4. Return 5. Fine 6. Magazine 7. Copier  8. Overdue  9. Reading room  10. Reference...

## Chapter 8: Gantt chart Project Development in SDLC

Gantt chart Project DevelopmentSchedule (project management) The project scheduleis the tool that communicates what work needs to be performed, which resources of the organization will perform the work and the timeframes in which that work needs to be performed....

## Chapter 6: Data Flow Diagram in Software Development Life Cycle.

Data Flow Diagram What is DFD? A data flow diagram (DFD) is a graphical representation of the "flow" of data through an information system, modelling its process aspects.A DFD is often used as a preliminary step to create an overview of the system, which can later be...

## Chapter 5: System request on SDLC

System Request In most organizations, project initiation begins by preparing a  system request. A  system request is a document that describes the business reasons for building a system and the value that the system is expected to provide.The project sponsor...