INTERACTIVE COMPUTER GRAPHICS

Slides:



Advertisements
Similar presentations
Graphics Primitives Part II: Bresenhams line and circle.
Advertisements

Graphics Primitives: line
CS 4731: Computer Graphics Lecture 20: Raster Graphics Part 1 Emmanuel Agu.
Computer Graphics 4: Bresenham Line Drawing Algorithm, Circle Drawing & Polygon Filling By:Kanwarjeet Singh.
+ CPCS 391 Computer Graphics 1 Instructor: Dr. Sahar Shabanah Lecture 3.
Scan conversion of Line , circle & ellipse
Line Drawing Algorithms. Rasterization-Process of determining which pixels give the best approximation to a desired line on the screen. Scan Conversion-Digitizing.
30/9/2008Lecture 21 Computer Graphics Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD3107 University of Palestine.
Advanced Manufacturing Laboratory Department of Industrial Engineering Sharif University of Technology Session # 6.
The lines of this object appear continuous However, they are made of pixels 2April 13, 2015.
Computer Graphics Tz-Huan Huang National Taiwan University (Slides are based on Prof. Chen’s)
OUTPUT PRIMITIVES Screen vs. World coordinate systems ● Objects positions are specified in a Cartesian coordinate system called World Coordinate.
Overview of Graphic Systems
Raster conversion algorithms for line and circle
Output Primitives Computer Graphics.
Java ThreadsGraphics Programming Graphics Programming: Graphics Devices.
Graphics Device Principles B.Sc. (Hons) Multimedia ComputingMedia Technologies.
Course Website: Computer Graphics 5: Line Drawing Algorithms.
Graphics Device Principles B.Sc. (Hons) Multimedia ComputingMedia Technologies.
Line Drawing by Algorithm. Line Drawing Algorithms Line drawn as pixels Graphics system –Projects the endpoints to their pixel locations in the frame.
Circle Drawing algo..
1/1/20001 Topic >>>> Scan Conversion CSE Computer Graphics.
Dr. S.M. Malaek Assistant: M. Younesi
WHERE TO DRAW A LINE?? Line drawing is accomplished by calculating intermediate positions along the line path between specified end points. Precise definition.
Scan Conversion Line and Circle
Raster-scan system In addition to the central processing unit a special purpose processor called the video controller or display controller is used to.
Computer Graphics Hardware
Objectives Differentiate between raster scan display and random scan display.
Introduction Computer Graphics & Its application Types of computer graphics Graphic display : random Scan & Raster Scan display Frame buffer and video.
CGMB214: Introduction to Computer Graphics
Computer Graphics Chapter 6 Andreas Savva. 2 Interactive Graphics Graphics provides one of the most natural means of communicating with a computer. Interactive.
Image Synthesis Rabie A. Ramadan, PhD 7. 2 Image Rasterization.
GEOMETRY AND LINE GENERATION Geometry and Line Generation Chapter 2.
Computer Graphics & Multimedia
Lecture 13: Raster Graphics and Scan Conversion
1 Teaching Innovation - Entrepreneurial - Global The Centre for Technology enabled Teaching & Learning, N Y S S, India DTEL DTEL (Department for Technology.
Bresenham’s Line Algorithm
OUTPUT PRIMITIVES A.Aruna/Faculty of Information technology/SNSCE13/19/2016.
Lecture 2: 19/4/1435 Graphical algorithms Lecturer/ Kawther Abas CS- 375 Graphics and Human Computer Interaction.
1.  The primary output device in a graphics system is a video monitor. These monitors are based on Cathode Ray Tube (CRT) design.  CRT is a vacuum tube/electron.
Graphic Systems. Basic Graphics System Input devices Output device Image formed in FB [Edward Angel, Interactive computer Graphics, 2009]
Scan Conversion of Line Segments. What is Scan conversion? Final step of rasterization (the process of taking geometric shapes and converting them into.
Line Drawing Algorithms 1. A line in Computer graphics is a portion of straight line that extends indefinitely in opposite direction. 2. It is defined.
Objectives Understand Bresenhams line drawing algorithm. Apply the algorithm to plot a line with the end points specified.
Primitive graphic objects
Line Drawing Algorithms
CSCE 441 Lecture 2: Scan Conversion of Lines
Raster Graphics.
MID-POINT CIRCLE ALGORITHM
Computer Graphics Lecture 3 Computer Graphics Hardware
Lecture 9 Line Drawing Algorithms (Bresenham’s Line Algorithm)
Overview of Graphics Systems
CS 4731: Computer Graphics Lecture 20: Raster Graphics Part 1
Lecture 8 Shear and Line Drawing Algorithms
Lecture 05: Mid-point Ellipse algorithm Dr. Manal Helal – Fall 2014
Chapter Three Part I Output Primitives CS 380.
Methods Anti-Aliasing Super Sampling
Computer Graphics 5: Line Drawing Algorithms
Computer Graphics 5: Line Drawing Algorithms
Introduction to Computer Graphics
Graphics Systems SUBJECT: COMPUTER GRAPHICS LECTURE NO: 02 BATCH: 16BS(INFORMATION TECHNOLOGY) 1/4/
Computer Graphics 5: Line Drawing Algorithms
Graphics Systems Lecture-2
Chapter 2 Overview of Graphics Systems
Overview of Graphics Systems
Chapter 3 Graphics Output Primitives
Primitive Drawing Algorithm
Primitive Drawing Algorithm
Line Drawing Algorithms
OUTPUT PRIMITIVES / DISPLAY TECHNIQUES
Presentation transcript:

INTERACTIVE COMPUTER GRAPHICS Presented by PUDI SATYANARAYANA MURTHY M.Tech, Assistant Professor DEPARTMENT OF MECHANICAL ENGINEERING VISAKHA INSTITUTE OF ENGINEERING & TECHNOLOGY

CHAPTER 2.2: INTERACTIVE COMPUTER GRAPHICS Prof. RATNADEEPSINH M. JADEJA Assistant Professor Mechanical Department 1

RANDOM SCAN SYSTEM In Random Scan System, an electron beam is directed to only those parts of the screen where a picture is to be drawn. The picture is drawn one line at a time, so also called vector displays or stroke writing displays. After drawing the picture the system cycles back to the first line and design all the lines of the picture 30 to 60 time each second. Mechanical Engineering Department – School Of Engineering

RASTER SCAN SYSTEM It is the most common type of graphics monitor based on television technology. In a raster scan system, the electron beam is swept across the screen, one row at a time from top to bottom. When electron beam moves across each row the beam intensity is turned ON and OFF to create a pattern of illuminated spots. Picture definition is stored in a memory called frame buffer which holds the set of intensity values, which are then retrieved from the frame buffer and pointed on the screen one row at a time as shown in figure below: Mechanical Engineering Department – School Of Engineering

REPRESENTATION OF LINE AND CIRCLE Mechanical Engineering Department – School Of Engineering

DDA ALGORITHM dF = n = ΔY = Fn –F1 = CONSTANT ΔX Xn –s1 ΔX = ΔY ΔY = dX Y = MX + C (Xn, Yn) Fn –F1 Xn –X1 ΔX = ΔY ΔY = ΔX YK+1 Xn –s1 Fn –F1 ΔY YK ΔX YK+1 = YK + ΔY (X1, Y1) Similarly XK XK+1 X XK+1 = XK + ΔX Mechanical Engineering Department – School Of Engineering

DDA ALGORITHM ΔY = ΔX ΔX = ΔY YK+1 = YK + ΔY YK+1 = YK + ΔY CASE 1 = Xn − X1 ΔX = +1 if Xn > X1 ΔX = -1 if Xn < X1 Yn − Y1 CASE 2 = Yn − Y1 ΔY = +1 if Yn > Y1 ΔY = -1 if Yn < Y1 Xn − X1 Cal cul at ∶e Cal cul at ∶e Fn –F1 ΔY = ΔX Xn –X1 ΔX = Fn –F1 ΔY Xn –s1 YK+1 = YK + ΔY YK+1 = YK + ΔY XK+1 = XK + ΔX XK+1 = XK + ΔX Mechanical Engineering Department – School Of Engineering

EXAMPLE EXAMPLE 1: Generate a straight line connecting two points (1, 2) and (8, 6) using DDA algorithm. Estimation of increments Xn – X1 = 8 – 1 = 7 Yn – Y1 = 6 – 2 = 4 X1 = 1 Xn = 8 Y1 = 2 Yn = 6 Xn − X1 > and Xn > X1 So, ΔX = 1 Yn − Y1 and 4 7 Fn –F1 ΔY = ΔX = = 0.571 Xn –s1 Mechanical Engineering Department – School Of Engineering

EXAMPLE cont.. POINT 1 X1 = X1+ 0.5 = 1 + 0.5 = 1.5 Y1 = Y1+ 0.5 = 2 + 0.5 = 2.5 POINT 2 X2 = X1+ ΔX = 1.5 + 1 = 2.5 Y2 = Y1+ ΔY = 2.5 + 0.571 = 3.071 POINT 3 X3 = X2+ ΔX = 2.5 + 1 = 3.5 Y3 = Y2+ ΔY = 3.071 + 0.571 = 3.642 POINT 4 X4 = X3+ ΔX = 3.5 + 1 = 4.5 Y4 = Y3+ ΔY = 3.642 + 0.571 = 4.213 POINT 5 X5 = X4+ ΔX = 4.5 + 1 = 5.5 Y5 = Y4+ ΔY = 4.213 + 0.571 = 4.784 POINT 6 X6 = X5+ ΔX = 5.5 + 1 = 6.5 Y6 = Y5+ ΔY = 4.784 + 0.571 = 5.355 POINT 7 X7 = X6+ ΔX = 6.5 + 1 = 7.5 Y7 = Y6+ ΔY = 5.355 + 0.571 = 5.926 POINT 8 X8 = X7+ ΔX = 7.5 + 1 = 8.5 Y8 = Y7+ ΔY = 5.926 + 0.571 = 6.497 (X8, Y8) = (8, 6) (X1, Y1) = (1, 2) (X2, Y2) = (2, 3) (X3, Y3) = (3, 3) (X4, Y4) = (4, 4) (X5, Y5) = (5, 4) (X6, Y6) = (6, 5) (X7, Y7) = (7, 5) Mechanical Engineering Department – School Of Engineering

BRESENHAM’S ALGORITHM Input the two end points (X1, Y1) and (Xn, Yn). Calculate : Xc = Xn – X1 and Yc = Yn – Y1 If Xc > Yc then slop is less then 1 so, ΔX = 1 Calculate the starting value of decision parameter P1 as P1 = 2Yc – Xc If Pk < 0 The next point is (Xk+1, Yk) and Pk+1 = Pk + 2Yc If Pk > 0 The next point is (Xk+1, Yk+1) and Pk+1 = Pk + 2Yc – 2Xc Mechanical Engineering Department – School Of Engineering

EXAMPLE Example 2: Generate a straight line connecting two end points (21, 11) and (26, 15) using Bresenham’s algorithm. Solution: X1 = 21 X2 = 26 Y1 = 11 Y2 = 15 Xc = Xn – X1 = 26 – 21 = 5 Yc = Yn – Y1 = 15 – 11 = 4 (Xc > Yc, so slop is less then 1 so, ΔX = 1) Point 1: (x1, y1) = (21, 11) P1 = 2Yc – Xc = 8 – 5 = 3 Point 2: X2 = x1 + Δx = 21 + 1 = 22 Y2 = Y1 + Δy = 11 + 1 = 12 (P > 0) (x2, y2) = (22, 12) (P > 0) P2 = P1 + 2Yc – 2Xc = 3 + 8 – 10 = 1 Mechanical Engineering Department – School Of Engineering 11

EXAMPLE cont.. Point 3: X3 = x2 + Δx = 22 + 1 = 23 Y3 = Y2 + Δy = 12 + 1 = 13 (x3, y3) = (23, 13) P3 = P2 + 2Yc – 2Xc = 1 + 8 – 10 = -1 (P < 0) Point 4: X4 = x3 + Δx = 23 + 1 = 24 Y4 = Y3 = 13 P4 = P3 + 2Yc = -1 + 8 = 7 Point 5: X5 = x4 + Δx = 24 + 1 = 25 Y5 = Y4 + Δy = 13 + 1 = 14 (x4, y4) = (24, 13) (P > 0) (x4, y4) = (25, 14) P5 = P4 + 2Yc – 2Xc = 7 + 8 – 10 = 5 (P > 0) Point 6: X6 = x5 + Δx = 25 + 1 = 26 Y6 = Y5 + Δy = 14 + 1 = 15 (x4, y4) = (26, 15) P6 = P5 + 2Yc – 2Xc = 5 + 8 – 10 = 3 (P > 0) Mechanical Engineering Department – School Of Engineering 12