Graphics (Output) Primitives. Chapters 3 & 4

Size: px
Start display at page:

Download "Graphics (Output) Primitives. Chapters 3 & 4"

Transcription

1 Graphics (Output) Primitives Chapters 3 & 4

2 Graphic Output and Input Pipeline Scan conversion converts primitives such as lines, circles, etc. into pixel values geometric description a finite scene area Clipping the process of determining the portion of a primitive lying within a region called clip region

3 Graphic Output Pipeline application model : descriptions of objects application program : generates a sequence of functions to display a model graphics package : clipping, scan conversion, shading, etc. display H/W

4 Graphic Input Pipeline user interaction (e.g., mouse click) graphic package (by sampling or event-driven input functions) application program modify the model or the image on the screen

5 Output Pipeline in Software When scan conversion and clipping happen? Clipping before scan conversion for lines, rectangles, and polygons clipping before scan converting each primitive (scissoring) Clipping after scan converting the entire collection of primitives into a temporary canvas for text

6 Scan Converting Lines A line from (x 1,y 1 ) to (x 2,y 2 ) a series of pixels [Criteria] Straight lines should appear straight Line end-points should be constrained Uniform density and intensity Line algorithms should be fast

7 Why Study Scan Conversion Algorithms? Every high-end graphics card support this. You will never have to write these routines yourself, unless you become a graphics hardware designer. So why learn this stuff? Maybe you will become a graphics hardware designer. But seriously, the same basic tricks underlie lots of algorithms: 3-D shaded polygons Texture mapping etc.

8 Simple Scan Converting Lines Based on slope-intercept algorithm from algebra: y = mx + b Simple approach: increment x, solve for y Floating point arithmetic required

9 Digital Differential Analyzer(DDA) Idea 1. Go to starting end point 2. Increment x and y values by constants proportional to x and y such that one of them is 1. - If 0<m 1, y k+1 = y k + m - If m>1, x k+1 = x k + 1/m 3. Round to the closest raster position ( i x i, y ) ( x 1, Round ( y m)) ( i i i x, Round ( y )) ( x 1, y m) i i i

10 Digital Differential Analyzer(DDA) Drawbacks rounding to an integer takes time floating-point operations Is there a simpler way? Can we use only integer arithmetic? Easier to implement in hardware

11 Midpoint Line Algorithm (Bresenham's Line Algorithm) Assume a line from (x 1, y 1 ) to (x 2, y 2 ) with 0<m < 1 and x 1 <x 2. Use symmetry

12 Midpoint Line Algorithm (Bresenham's Line Algorithm) Suppose that we have just finished drawing a pixel P = (x k, y k ) and we are interested in figuring out which pixel to draw next. If distance(ne,m) > distance(e,m) then select E = (x k +1, y k ) y k +1 y NE d upper else d lower select NE = (x k +1, y k +1) y k P E x k x k +1

13 Midpoint Line Algorithm (Bresenham's Line Algorithm) y = m(x k +1)+b d lower = y y k = m(x k +1)+b y k d upper = (y k +1) y = y k +1 m(x k +1) b d lower d upper =2m(x k +1) 2y k +2b 1 Decision parameter, p k (by substituting m=δy/δx) p k = Δx(d lower d upper ) = 2Δy x k 2Δx y k +c, where c= 2Δy+ Δx(2b 1) The sign of p k is the same as the sign of (d lower d upper )

14 Midpoint Line Algorithm (Bresenham's Line Algorithm) p k = Δx(d lower d upper ) If y k is closer to the line path, d lower d upper p k 0 plot the lower pixel (x k +1, y k ) Otherwise, plot the lower pixel (x k +1, y k +1 )

15 Midpoint Line Algorithm (Bresenham's Line Algorithm) p k+1 = 2Δy x k+1 2Δx y k+1 +c p k = 2Δy x k 2Δx y k +c (subtraction) p k+1 p k = 2Δy(x k+1 x k ) 2Δx(y k+1 y k ) (x k+1 = x k +1) p k+1 = p k +2Δy 2Δx(y k+1 y k ) ( y k+1 y k is either 0 or 1, depending on the sign of p k ) p k+1 = p k +2Δy y k+1 y k = 0 p k 0 p k+1 = p k +2Δy 2Δx y k+1 y k = 1 p k 0

16 Midpoint Line Algorithm (Bresenham's Line Algorithm) p 0 = 2Δy Δx If p k 0, plot (x k +1, y k ) and p k+1 = p k +2Δy Otherwise, plot (x k +1, y k +1 ) and p k+1 = p k +2Δy 2Δx Advantages Only need add integers and multiply by 2 (which can be done by shift operations) Incremental algorithm

17 Midpoint Line Algorithm- Example Line end points: (x 0,y 0 ) = (5,8); (x 1,y 1 ) = (9,11) Δx = 4; Δy = 3 p 0 = 2Δy Δx = 2 > 0 select (5+1, 8+1) p 1 = p 0 + 2(Δy - Δx) = 0 Select (6+1,9+1) p 2 = p 1 + 2(Δy Δx)=0-2=-2 Select (7+1, 10)

18 Scan Converting Lines (issues) Endpoint order S 01 is a set of pixels that lie on the line from P 0 to P 1 S 10 is a set of pixels that lie on the line from P 1 to P 0 S 01 should be the same as S 10 Varying intensity of a line as a function of slope For the diagonal line, it is longer than the horizontal line but has the same number of pixels as the latter needs antialiasing Outline primitives composed of lines Care must be taken to draw shared vertices of polylines only once

19 Scan Converting Lines (issues) Starting at the edge of a clip rectangle Starting point is not the intersection point of the line with clipping edge Clipped line may have a different slope

20 Scan Converting Circles Eight-way symmetry We only consider 45 of a circle

21 Midpoint Circle Algorithm Suppose that we have just finished drawing a pixel (x p,y p ) and we are interested in figuring out which pixel to draw next.

22 Midpoint Circle Algorithm f(x,y) = x 2 + y 2 r 2 < 0 inside the circle = 0 on the circle > 0 outside the circle If f (x p +1, y p ½ ) < 0 then select E(x p +1, y p ); else select SE(x p +1, y p 1)

23 Midpoint Circle Algorithm p k = f (x k +1, y k ½ ) = (x k +1) 2 + (y k ½) 2 r 2 p k 0 the midpoint is inside the circle and y k is closer to the circle boundary plot the lower pixel (x k +1, y k ) Otherwise, the midpoint is outside or on the circle and y k 1 is closer to the circle boundary plot the lower pixel (x k +1, y k 1 )

24 Midpoint Circle Algorithm p k = (x k +1) 2 + (y k ½ ) 2 r 2 p k+1 = f (x k+1 +1, y k+1 ½) = [(x k +1)+1] 2 + (y k+1 ½ ) 2 r 2 p k+1 = p k +2(x k +1)+ (y k+1 2 y k2 ) (y k+1 y k ) +1 ( y k+1 is either y k or y k 1, depending on the sign of p k ) p k+1 = p k +2x k+1 +1 y k+1 = y k p k 0 p k+1 = p k + 2x k y k+1 y k+1 = y k 1 p k 0, where 2x k+1 =2x k +2 2y k+1 =2y k 2

25 Midpoint Circle Algorithm (x 0, y o ) = (0, r) p 0 = f (1, r ½) = 5/4 r = 1 r (for r an integer) If p k 0, plot (x k +1, y k ) and p k+1 = p k +2x k+1 +1 Otherwise, plot (x k +1, y k 1 ) and p k+1 = p k + 2x k y k+1, where 2x k+1 =2x k +2 2y k+1 =2y k 2 Advantages Only using integer additions and subtractions Incremental algorithm

26 Midpoint Ellipse Algorithm Use symmetry of ellipse Divide the quadrant into two regions the boundary of two regions is the point at which the curve has a slope of -1. Process by taking unit steps in the x direction to the point P, then taking unit steps in the y direction Apply midpoint algorithm. Slope = -1 r y P r x

27 Midpoint Ellipse Algorithm x x rx c 2 y y ry 1 f ellipse (x,y) = r y2 x 2 + r x2 y 2 r x2 r y 2 c < 0 inside the ellipse boundary = 0 on the ellipse boundary > 0 outside the ellipse boundary 2 r y r x p1 k = f ellipse (x k +1, y k ½) p2 k = f ellipse (x k +½, y k 1)

28 Maintaining Geometric Properties When line drawing, exclude the last point When drawing an enclosed area, display the area using only those pixels that are interior to the object boundaries

29 Inside-Outside Tests Odd-even Rule (Odd-parity Rule) For each pixel, determine if it is inside or outside of a given polygon. Approach From any point P being tested, cast a ray to a distant point in an arbitrary direction If the number of crossings is odd, then P is an interior point. If the number of crossings is even, then P is an exterior point.

30 Odd-Even Rule Be sure that the line path does not intersect any line-segment endpoints.

31 Odd-Even Rule P Edge Crossing Rules an upward edge includes its starting endpoint, and excludes its final endpoint; a downward edge excludes its starting endpoint, and include its final endpoint; horizontal edges are excluded;

32 Odd-Even Rule Very fragile algorithm Ray crosses a vertex Ray is coincident with an edge Commonly used in ECAD Suitable for H/W

33 Inside-Outside Tests Nonzero Winding Number Rule A winding number the # of times the boundary of an object winds around a particular point P in the counterclockwise direction Non-zero values: interior points Zero values : exterior points

34 Nonzero Winding Number Rule Winding num: initialized to 0 From any point P being tested, cast a ray to a distant point in an arbitrary direction +1: edge crossing the line from right to left -1: left to right Use the sign of the cross product of the line and edge vectors Non-zero: interior Zero: exterior Be sure that the line path does not pass through any line-segment endpoints.

35 How to decide interior Vertices are numbered:

36 Polygon Tables An object described as a set of polygon surface facets Geometric data vertex table edge table surface-fact table Other parameters Color, transparency, lightreflection properties

37 Area Filling How to generate a solid color/patterned polygon area Scan-line fill algorithm Which pixels? What value?

38 Scan-Line Fill Algorithm For each scan line (1) Find intersections (the extrema of spans) Use Bresenham's line-scan algorithm Note that in a line drawing algorithm there is no difference between interior and exterior pixels (2) Sort intersections (increasing x order) (3) Fill in between pair of intersections

39 Scan-Line Fill Algorithm Find intersections x k+1 = x k + Δx / Δy example (left edge) m = 5/2 x min = 3 the sequence of x values 3, 3+2/5, 3+4/5, 3+5/6=4+1/5 y x pixel /5 3+4/5 4+1/5 (3,1) (3,2) (4,3) (4,4)

40 Span Rules intersection at integer coordinate leftmost : interior rightmost: exterior shared vertices count parity at y min vertices only shorten edges horizontal edges do not count vertices A standard convention is to say that a point on a left or bottom edge is inside, and a point on a right or top edge is outside.

41 Scan-Line Fill Algorithm Not quite simple A scan line passed through a vertex, it intersects two polygon edges at that point.

42 Scan-Line Fill Algorithm Scan line y intersects an even number of edges Two pairs of intersection points correctly identify the interior span Scan line y intersects an odd number (5) of edges Must count the vertex intersections as only one point

43 Scan-Line Fill Algorithm How to distinguish these cases (scan lines y & y ) Scan line y Two intersecting edges are on opposite sides of scan line Counted as just one boundary intersection point Scan line y Two intersecting edges are both above the scan line By tracing around the boundary, If three endpoint y values of two consecutive edges monotonically increase or decrease count the shared vertex as a single intersection Otherwise, (a local minimum or maximum) add the two edge intersections with the scan line

44 Scan-Line Fill Algorithm Implementation To shorten some polygon edges to split those vertices that should be counted as one intersection While processing non-horizontal edges in (counter)clockwise Check each edge whether the edge & next edges have either monotonically increasing or decreasing endpoints If so, shorten the lower edge

45 Scan-Line Fill Algorithm Coherence properties span coherence - all pixels on a span are set to the same value scan-line coherence - consecutive scan lines are identical edge coherence - edges intersected by scan line i are also intersected by scan line i+1

46 Scan-Line Fill Algorithm Use edge coherence and the scan-line algorithm Sorted Edge Table Contains all the non-horizontal edges. Edges are sorted by their smaller y coordinates. Table entry : y max, x-intercept value, inverse slope For each scan line, edges are sorted from left to right Active Edge List While processing scan lines from bottom to top, produce an active edge list for each scan line. Contains edges which intersect the current scan line. Edges are sorted on their x intersection values.

47 Scan-Line Fill Algorithm Sorted Edge Table BC C D DE EA AB

48 Scan-Line Fill Algorithm Scan line 9 Scan line 10

49 Area Filling (Filling Methods) Pixel Adjacency 4-connected 8-connected Boundary-Fill Algorithm If the boundary is specified in a single color, fill the interior, pixel by pixel, until the boundary color is encountered starts from an interior point and paints the interior in a specified color or intensity.

50 Boundary-Fill Algorithm procedure boundaryfill4( x,y : integer // starting point in region bordercolor: color // color that defines boundary fillcolor : color); // filling color var c : color begin c := readpixel(x,y); if ( c bordercolor and c fillcolor ) then begin writepixel(x,y,fillcolor); boundaryfill4(x, y-1, bordercolor, fillcolor ); boundaryfill4(x, y+1, bordercolor, fillcolor ); boundaryfill4(x-1, y, bordercolor, fillcolor ); boundaryfill4(x+1, y, bordercolor, fillcolor ); end end;

51 Boundary-Fill Algorithm There is the following problem with boundary_fill4: Solve with 8- connected Involve heavy duty recursion which may consume memory and time

52 Boundary-Fill Algo. Efficiency in space! Starting from the initial interior point, first fill in the span on the starting scan line Locate and stack starting positions for spans on the adjacent scan lines in down to up order in left to right order All upper scan lines processed All lower scan lines processed

53 Flood-Fill Algorithm Flood-Fill Algorithm When filling an area that is not defined within a single color boundary start from an interior point and reassign all pixel values that are currently set to a given interior color with the desired fill color.

54 Flood-Fill Algorithm procedure flood_fill4( x,y: integer //starting point in region oldvalue: color // value that defines interior newvalue: color); replacement value begin if readpixel(x,y) = oldvalue then begin writepixel(x,y,newvalue); flood_fill4(x,y-1,oldvalue,newvalue); flood_fill4(x,y+1,oldvalue,newvalue); flood_fill4(x-1,y,oldvalue,newvalue); flood_fill4(x+1,y,oldvalue,newvalue); end end;

55 Patterned Lines Patterned line from P to Q is not same as patterned line from Q to P. P Q P Q Patterns can be geometric or cosmetic Cosmetic: Texture applied after transformations Geometric: Pattern subject to transformations Cosmetic Geometric

56 Character, Symbols Bitmap font (Raster font) Set up a pattern of binary values on a rectangular grid The simplest to define and display But, more storage : each variation (size and format) must be saved

57 Character, Symbols Outline font Use straight-line and curve sections More flexible method Can be increased in size without distorting the character shapes By manipulating curve definitions for the character outlines. More time, since they must be scan converted into the frame buffer Less storage

58 Character, Symbols Comparison of Methods Outline font Bitmap font easy to rotate rotate by multiples of 90 easy to scale scale by powers of 2 variable length storage scan convert lines (curves) fill if polygons may be anti-aliased or smoothed via curve fitting fixed length storage scan convert points draw as filled or outline may be pre-anti-aliased

59 Line Attributes Butt cap Round cap Projecting square cap Miter join Round Join Bevel join

60 Aliasing in CG Which is better?

61 Aliasing in CG Digital technology can only approximate analog signals through a process known as sampling. Aliasing : the distortion of information due to lowfrequency sampling (undersampling). Choosing an appropriate sampling rate depends on data size restraints, need for accuracy, the cost per sample Errors caused by aliasing are called artifacts. Common aliasing artifacts in computer graphics include jagged profiles, disappearing or improperly rendered fine detail, and disintegrating textures.

Chapter 3. Sukhwinder Singh

Chapter 3. Sukhwinder Singh Chapter 3 Sukhwinder Singh PIXEL ADDRESSING AND OBJECT GEOMETRY Object descriptions are given in a world reference frame, chosen to suit a particular application, and input world coordinates are ultimately

More information

Unit 2 Output Primitives and their Attributes

Unit 2 Output Primitives and their Attributes Unit 2 Output Primitives and their Attributes Shapes and colors of the objects can be described internally with pixel arrays or with sets of basic geometric structures, such as straight line segments and

More information

Einführung in Visual Computing

Einführung in Visual Computing Einführung in Visual Computing 186.822 Rasterization Werner Purgathofer Rasterization in the Rendering Pipeline scene objects in object space transformed vertices in clip space scene in normalized device

More information

(Refer Slide Time: 00:02:00)

(Refer Slide Time: 00:02:00) Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 18 Polyfill - Scan Conversion of a Polygon Today we will discuss the concepts

More information

CS 543: Computer Graphics. Rasterization

CS 543: Computer Graphics. Rasterization CS 543: Computer Graphics Rasterization Robert W. Lindeman Associate Professor Interactive Media & Game Development Department of Computer Science Worcester Polytechnic Institute gogo@wpi.edu (with lots

More information

Computer Graphics. Chapter 4 Attributes of Graphics Primitives. Somsak Walairacht, Computer Engineering, KMITL 1

Computer Graphics. Chapter 4 Attributes of Graphics Primitives. Somsak Walairacht, Computer Engineering, KMITL 1 Computer Graphics Chapter 4 Attributes of Graphics Primitives Somsak Walairacht, Computer Engineering, KMITL 1 Outline OpenGL State Variables Point Attributes Line Attributes Fill-Area Attributes Scan-Line

More information

From Vertices to Fragments: Rasterization. Reading Assignment: Chapter 7. Special memory where pixel colors are stored.

From Vertices to Fragments: Rasterization. Reading Assignment: Chapter 7. Special memory where pixel colors are stored. From Vertices to Fragments: Rasterization Reading Assignment: Chapter 7 Frame Buffer Special memory where pixel colors are stored. System Bus CPU Main Memory Graphics Card -- Graphics Processing Unit (GPU)

More information

Computer Graphics. Attributes of Graphics Primitives. Somsak Walairacht, Computer Engineering, KMITL 1

Computer Graphics. Attributes of Graphics Primitives. Somsak Walairacht, Computer Engineering, KMITL 1 Computer Graphics Chapter 4 Attributes of Graphics Primitives Somsak Walairacht, Computer Engineering, KMITL 1 Outline OpenGL State Variables Point Attributes t Line Attributes Fill-Area Attributes Scan-Line

More information

COMP30019 Graphics and Interaction Scan Converting Polygons and Lines

COMP30019 Graphics and Interaction Scan Converting Polygons and Lines COMP30019 Graphics and Interaction Scan Converting Polygons and Lines Department of Computer Science and Software Engineering The Lecture outline Introduction Scan conversion Scan-line algorithm Edge coherence

More information

Renderer Implementation: Basics and Clipping. Overview. Preliminaries. David Carr Virtual Environments, Fundamentals Spring 2005

Renderer Implementation: Basics and Clipping. Overview. Preliminaries. David Carr Virtual Environments, Fundamentals Spring 2005 INSTITUTIONEN FÖR SYSTEMTEKNIK LULEÅ TEKNISKA UNIVERSITET Renderer Implementation: Basics and Clipping David Carr Virtual Environments, Fundamentals Spring 2005 Feb-28-05 SMM009, Basics and Clipping 1

More information

COMP371 COMPUTER GRAPHICS

COMP371 COMPUTER GRAPHICS COMP371 COMPUTER GRAPHICS LECTURE 14 RASTERIZATION 1 Lecture Overview Review of last class Line Scan conversion Polygon Scan conversion Antialiasing 2 Rasterization The raster display is a matrix of picture

More information

2D Graphics Primitives II. Additional issues in scan converting lines. 1)Endpoint order. Want algorithms to draw the same pixels for each line

2D Graphics Primitives II. Additional issues in scan converting lines. 1)Endpoint order. Want algorithms to draw the same pixels for each line walters@buffalo.edu CSE 480/580 Lecture 8 Slide 1 2D Graphics Primitives II Additional issues in scan converting lines 1)Endpoint order Want algorithms to draw the same pixels for each line How handle?

More information

Chapter - 2: Geometry and Line Generations

Chapter - 2: Geometry and Line Generations Chapter - 2: Geometry and Line Generations In Computer graphics, various application ranges in different areas like entertainment to scientific image processing. In defining this all application mathematics

More information

Chapter 8: Implementation- Clipping and Rasterization

Chapter 8: Implementation- Clipping and Rasterization Chapter 8: Implementation- Clipping and Rasterization Clipping Fundamentals Cohen-Sutherland Parametric Polygons Circles and Curves Text Basic Concepts: The purpose of clipping is to remove objects or

More information

Computer Graphics (CS 543) Lecture 10: Rasterization and Antialiasing

Computer Graphics (CS 543) Lecture 10: Rasterization and Antialiasing Computer Graphics (CS 543) Lecture 10: Rasterization and Antialiasing Prof Emmanuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) Recall: Rasterization Rasterization (scan conversion)

More information

Tópicos de Computação Gráfica Topics in Computer Graphics 10509: Doutoramento em Engenharia Informática. Chap. 2 Rasterization.

Tópicos de Computação Gráfica Topics in Computer Graphics 10509: Doutoramento em Engenharia Informática. Chap. 2 Rasterization. Tópicos de Computação Gráfica Topics in Computer Graphics 10509: Doutoramento em Engenharia Informática Chap. 2 Rasterization Rasterization Outline : Raster display technology. Basic concepts: pixel, resolution,

More information

CSCI 4620/8626. Coordinate Reference Frames

CSCI 4620/8626. Coordinate Reference Frames CSCI 4620/8626 Computer Graphics Graphics Output Primitives Last update: 2014-02-03 Coordinate Reference Frames To describe a picture, the world-coordinate reference frame (2D or 3D) must be selected.

More information

Output Primitives. Dr. S.M. Malaek. Assistant: M. Younesi

Output Primitives. Dr. S.M. Malaek. Assistant: M. Younesi Output Primitives Dr. S.M. Malaek Assistant: M. Younesi Output Primitives Output Primitives: Basic geometric structures (points, straight line segment, circles and other conic sections, quadric surfaces,

More information

Computer Graphics. - Rasterization - Philipp Slusallek

Computer Graphics. - Rasterization - Philipp Slusallek Computer Graphics - Rasterization - Philipp Slusallek Rasterization Definition Given some geometry (point, 2D line, circle, triangle, polygon, ), specify which pixels of a raster display each primitive

More information

Incremental Form. Idea. More efficient if we look at d k, the value of the decision variable at x = k

Incremental Form. Idea. More efficient if we look at d k, the value of the decision variable at x = k Idea 1 m 0 candidates last pixel Note that line could have passed through any part of this pixel Decision variable: d = x(a-b) d is an integer d < 0 use upper pixel d > 0 use lower pixel Incremental Form

More information

2D rendering takes a photo of the 2D scene with a virtual camera that selects an axis aligned rectangle from the scene. The photograph is placed into

2D rendering takes a photo of the 2D scene with a virtual camera that selects an axis aligned rectangle from the scene. The photograph is placed into 2D rendering takes a photo of the 2D scene with a virtual camera that selects an axis aligned rectangle from the scene. The photograph is placed into the viewport of the current application window. A pixel

More information

Rasteriza2on and Clipping

Rasteriza2on and Clipping Overview Scan conversion Computer Graphics Rasterizaon and Clipping Polygon filling Clipping in D Aleksandra Pizurica Raster Display PIEL (picture element) RASTER (a rectangular array of points or dots)

More information

From Ver(ces to Fragments: Rasteriza(on

From Ver(ces to Fragments: Rasteriza(on From Ver(ces to Fragments: Rasteriza(on From Ver(ces to Fragments 3D vertices vertex shader rasterizer fragment shader final pixels 2D screen fragments l determine fragments to be covered l interpolate

More information

UNIT 2 GRAPHIC PRIMITIVES

UNIT 2 GRAPHIC PRIMITIVES UNIT 2 GRAPHIC PRIMITIVES Structure Page Nos. 2.1 Introduction 46 2.2 Objectives 46 2.3 Points and Lines 46 2.4 Line Generation Algorithms 48 2.4.1 DDA Algorithm 49 2.4.2 Bresenhams Line Generation Algorithm

More information

Rasterization and Graphics Hardware. Not just about fancy 3D! Rendering/Rasterization. The simplest case: Points. When do we care?

Rasterization and Graphics Hardware. Not just about fancy 3D! Rendering/Rasterization. The simplest case: Points. When do we care? Where does a picture come from? Rasterization and Graphics Hardware CS559 Course Notes Not for Projection November 2007, Mike Gleicher Result: image (raster) Input 2D/3D model of the world Rendering term

More information

OpenGL Graphics System. 2D Graphics Primitives. Drawing 2D Graphics Primitives. 2D Graphics Primitives. Mathematical 2D Primitives.

OpenGL Graphics System. 2D Graphics Primitives. Drawing 2D Graphics Primitives. 2D Graphics Primitives. Mathematical 2D Primitives. D Graphics Primitives Eye sees Displays - CRT/LCD Frame buffer - Addressable pixel array (D) Graphics processor s main function is to map application model (D) by projection on to D primitives: points,

More information

Polygon Filling. Can write frame buffer one word at time rather than one bit. 2/3/2000 CS 4/57101 Lecture 6 1

Polygon Filling. Can write frame buffer one word at time rather than one bit. 2/3/2000 CS 4/57101 Lecture 6 1 Polygon Filling 2 parts to task which pixels to fill what to fill them with First consider filling unclipped primitives with solid color Which pixels to fill consider scan lines that intersect primitive

More information

CSCI 4620/8626. Primitives and Attributes

CSCI 4620/8626. Primitives and Attributes CSCI 4620/8626 Computer Graphics Attributes of Graphics Primitives (Chapter 5) Last update: 2016-02-23 Primitives and Attributes The graphics primitives we ve seen so far are fundamental shapes, like lines,

More information

Pipeline implementation II

Pipeline implementation II Pipeline implementation II Overview Line Drawing Algorithms DDA Bresenham Filling polygons Antialiasing Rasterization Rasterization (scan conversion) Determine which pixels that are inside primitive specified

More information

Computer Graphics : Bresenham Line Drawing Algorithm, Circle Drawing & Polygon Filling

Computer Graphics : Bresenham Line Drawing Algorithm, Circle Drawing & Polygon Filling Computer Graphics : Bresenham Line Drawing Algorithm, Circle Drawing & Polygon Filling Downloaded from :www.comp.dit.ie/bmacnamee/materials/graphics/006- Contents In today s lecture we ll have a loo at:

More information

FROM VERTICES TO FRAGMENTS. Lecture 5 Comp3080 Computer Graphics HKBU

FROM VERTICES TO FRAGMENTS. Lecture 5 Comp3080 Computer Graphics HKBU FROM VERTICES TO FRAGMENTS Lecture 5 Comp3080 Computer Graphics HKBU OBJECTIVES Introduce basic implementation strategies Clipping Scan conversion OCTOBER 9, 2011 2 OVERVIEW At end of the geometric pipeline,

More information

Filled Area Primitives. CEng 477 Introduction to Computer Graphics METU, 2007

Filled Area Primitives. CEng 477 Introduction to Computer Graphics METU, 2007 Filled Area Primitives CEng 477 Introduction to Computer Graphics METU, 2007 Filled Area Primitives Two basic approaches to area filling on raster systems: Determine the overlap intervals for scan lines

More information

Implementation III. Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts University of New Mexico

Implementation III. Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts University of New Mexico Implementation III Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts University of New Mexico Objectives Survey Line Drawing Algorithms - DDA - Bresenham 2 Rasterization

More information

Rasterization: Geometric Primitives

Rasterization: Geometric Primitives Rasterization: Geometric Primitives Outline Rasterizing lines Rasterizing polygons 1 Rasterization: What is it? How to go from real numbers of geometric primitives vertices to integer coordinates of pixels

More information

Graphics Output Primitives

Graphics Output Primitives Important Graphics Output Primitives Graphics Output Primitives in 2D polgons, circles, ellipses & other curves piel arra operations in 3D triangles & other polgons Werner Purgathofer / Computergraphik

More information

Agenda. Polygon Terminology Types of polygons Inside Test Polygon Filling Algorithms. Scan-Line Polygon Fill Algorithm Flood-Fill Algorithm

Agenda. Polygon Terminology Types of polygons Inside Test Polygon Filling Algorithms. Scan-Line Polygon Fill Algorithm Flood-Fill Algorithm Polygons UNIT - III Agenda Polygon Terminology Types of polygons Inside Test Polygon Filling Algorithms Scan-Line Polygon Fill Algorithm Flood-Fill Algorithm A Polygon Vertex = point in space (2D or 3D)

More information

Attributes of Graphics Primitives

Attributes of Graphics Primitives ttributes for Graphics Output Primitives ttributes of Graphics Primitives in 2 points, lines polygons, circles, ellipses & other curves (also filled) characters in 3 triangles & other polygons anti-aliasing

More information

Computer Graphics Lecture Notes

Computer Graphics Lecture Notes Computer Graphics Lecture Notes UNIT- Overview of Computer Graphics. Application of Computer Graphics Computer-Aided Design for engineering and architectural systems etc. Objects maybe displayed in a wireframe

More information

Topics. From vertices to fragments

Topics. From vertices to fragments Topics From vertices to fragments From Vertices to Fragments Assign a color to every pixel Pass every object through the system Required tasks: Modeling Geometric processing Rasterization Fragment processing

More information

Topic #1: Rasterization (Scan Conversion)

Topic #1: Rasterization (Scan Conversion) Topic #1: Rasterization (Scan Conversion) We will generally model objects with geometric primitives points, lines, and polygons For display, we need to convert them to pixels for points it s obvious but

More information

Computer Graphics 7 - Rasterisation

Computer Graphics 7 - Rasterisation Computer Graphics 7 - Rasterisation Tom Thorne Slides courtesy of Taku Komura www.inf.ed.ac.uk/teaching/courses/cg Overview Line rasterisation Polygon rasterisation Mean value coordinates Decomposing polygons

More information

Announcements. Midterms graded back at the end of class Help session on Assignment 3 for last ~20 minutes of class. Computer Graphics

Announcements. Midterms graded back at the end of class Help session on Assignment 3 for last ~20 minutes of class. Computer Graphics Announcements Midterms graded back at the end of class Help session on Assignment 3 for last ~20 minutes of class 1 Scan Conversion Overview of Rendering Scan Conversion Drawing Lines Drawing Polygons

More information

Rasterization. Rasterization (scan conversion) Digital Differential Analyzer (DDA) Rasterizing a line. Digital Differential Analyzer (DDA)

Rasterization. Rasterization (scan conversion) Digital Differential Analyzer (DDA) Rasterizing a line. Digital Differential Analyzer (DDA) CSCI 420 Computer Graphics Lecture 14 Rasterization Jernej Barbic University of Southern California Scan Conversion Antialiasing [Angel Ch. 6] Rasterization (scan conversion) Final step in pipeline: rasterization

More information

Line Drawing. Introduction to Computer Graphics Torsten Möller / Mike Phillips. Machiraju/Zhang/Möller

Line Drawing. Introduction to Computer Graphics Torsten Möller / Mike Phillips. Machiraju/Zhang/Möller Line Drawing Introduction to Computer Graphics Torsten Möller / Mike Phillips Rendering Pipeline Hardware Modelling Transform Visibility Illumination + Shading Perception, Color Interaction Texture/ Realism

More information

CSC Computer Graphics

CSC Computer Graphics // CSC. Computer Graphics Lecture Kasun@dscs.sjp.ac.lk Department of Computer Science University of Sri Jayewardanepura Polygon Filling Scan-Line Polygon Fill Algorithm Span Flood-Fill Algorithm Inside-outside

More information

Computer Graphics. The Two-Dimensional Viewing. Somsak Walairacht, Computer Engineering, KMITL

Computer Graphics. The Two-Dimensional Viewing. Somsak Walairacht, Computer Engineering, KMITL Computer Graphics Chapter 6 The Two-Dimensional Viewing Somsak Walairacht, Computer Engineering, KMITL Outline The Two-Dimensional Viewing Pipeline The Clipping Window Normalization and Viewport Transformations

More information

CS452/552; EE465/505. Clipping & Scan Conversion

CS452/552; EE465/505. Clipping & Scan Conversion CS452/552; EE465/505 Clipping & Scan Conversion 3-31 15 Outline! From Geometry to Pixels: Overview Clipping (continued) Scan conversion Read: Angel, Chapter 8, 8.1-8.9 Project#1 due: this week Lab4 due:

More information

Scan Conversion. CMP 477 Computer Graphics S. A. Arekete

Scan Conversion. CMP 477 Computer Graphics S. A. Arekete Scan Conversion CMP 477 Computer Graphics S. A. Areete What is Scan-Conversion? 2D or 3D objects in real world space are made up of graphic primitives such as points, lines, circles and filled polygons.

More information

(Refer Slide Time: 00:03:51)

(Refer Slide Time: 00:03:51) Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture 17 Scan Converting Lines, Circles and Ellipses Hello and welcome everybody

More information

The Traditional Graphics Pipeline

The Traditional Graphics Pipeline Last Time? The Traditional Graphics Pipeline Participating Media Measuring BRDFs 3D Digitizing & Scattering BSSRDFs Monte Carlo Simulation Dipole Approximation Today Ray Casting / Tracing Advantages? Ray

More information

Rasterization, or What is glbegin(gl_lines) really doing?

Rasterization, or What is glbegin(gl_lines) really doing? Rasterization, or What is glbegin(gl_lines) really doing? Course web page: http://goo.gl/eb3aa February 23, 2012 Lecture 4 Outline Rasterizing lines DDA/parametric algorithm Midpoint/Bresenham s algorithm

More information

CS 4731/543: Computer Graphics Lecture 7 (Part I): Raster Graphics: Polygons & Antialiasing. Emmanuel Agu

CS 4731/543: Computer Graphics Lecture 7 (Part I): Raster Graphics: Polygons & Antialiasing. Emmanuel Agu CS 4731/543: Computer Graphics Lecture 7 (Part I): Raster Graphics: Polygons & Antialiasing Emmanuel Agu So Far Raster graphics: Line drawing algorithms (simple, Bresenham s) Today: Defining and filling

More information

CS 4731: Computer Graphics Lecture 21: Raster Graphics: Drawing Lines. Emmanuel Agu

CS 4731: Computer Graphics Lecture 21: Raster Graphics: Drawing Lines. Emmanuel Agu CS 4731: Computer Graphics Lecture 21: Raster Graphics: Drawing Lines Emmanuel Agu 2D Graphics Pipeline Clipping Object World Coordinates Applying world window Object subset window to viewport mapping

More information

Scan Conversion. Drawing Lines Drawing Circles

Scan Conversion. Drawing Lines Drawing Circles Scan Conversion Drawing Lines Drawing Circles 1 How to Draw This? 2 Start From Simple How to draw a line: y(x) = mx + b? 3 Scan Conversion, a.k.a. Rasterization Ideal Picture Raster Representation Scan

More information

Realtime 3D Computer Graphics Virtual Reality

Realtime 3D Computer Graphics Virtual Reality Realtime 3D Computer Graphics Virtual Reality From Vertices to Fragments Overview Overall goal recapitulation: Input: World description, e.g., set of vertices and states for objects, attributes, camera,

More information

1 Introduction to Graphics

1 Introduction to Graphics 1 1.1 Raster Displays The screen is represented by a 2D array of locations called pixels. Zooming in on an image made up of pixels The convention in these notes will follow that of OpenGL, placing the

More information

0. Introduction: What is Computer Graphics? 1. Basics of scan conversion (line drawing) 2. Representing 2D curves

0. Introduction: What is Computer Graphics? 1. Basics of scan conversion (line drawing) 2. Representing 2D curves CSC 418/2504: Computer Graphics Course web site (includes course information sheet): http://www.dgp.toronto.edu/~elf Instructor: Eugene Fiume Office: BA 5266 Phone: 416 978 5472 (not a reliable way) Email:

More information

CPSC / Scan Conversion

CPSC / Scan Conversion CPSC 599.64 / 601.64 Computer Screens: Raster Displays pixel rasters (usually) square pixels in rectangular raster evenly cover the image problem no such things such as lines, circles, etc. scan conversion

More information

CS Rasterization. Junqiao Zhao 赵君峤

CS Rasterization. Junqiao Zhao 赵君峤 CS10101001 Rasterization Junqiao Zhao 赵君峤 Department of Computer Science and Technology College of Electronics and Information Engineering Tongji University Vector Graphics Algebraic equations describe

More information

Line Drawing Week 6, Lecture 9

Line Drawing Week 6, Lecture 9 CS 536 Computer Graphics Line Drawing Week 6, Lecture 9 David Breen, William Regli and axim Peysakhov Department of Computer Science Drexel University Outline Line drawing Digital differential analyzer

More information

The Traditional Graphics Pipeline

The Traditional Graphics Pipeline Last Time? The Traditional Graphics Pipeline Reading for Today A Practical Model for Subsurface Light Transport, Jensen, Marschner, Levoy, & Hanrahan, SIGGRAPH 2001 Participating Media Measuring BRDFs

More information

Computer Graphics Geometry and Transform

Computer Graphics Geometry and Transform ! Computer Graphics 2014! 5. Geometry and Transform Hongxin Zhang State Key Lab of CAD&CG, Zhejiang University 2014-10-11! Today outline Triangle rasterization Basic vector algebra ~ geometry! Antialiasing

More information

Overview of Computer Graphics

Overview of Computer Graphics Application of Computer Graphics UNIT- 1 Overview of Computer Graphics Computer-Aided Design for engineering and architectural systems etc. Objects maybe displayed in a wireframe outline form. Multi-window

More information

The Traditional Graphics Pipeline

The Traditional Graphics Pipeline Final Projects Proposals due Thursday 4/8 Proposed project summary At least 3 related papers (read & summarized) Description of series of test cases Timeline & initial task assignment The Traditional Graphics

More information

? Which intermediate. Recall: Line drawing algorithm. Programmer specifies (x,y) of end pixels Need algorithm to determine pixels on line path

? Which intermediate. Recall: Line drawing algorithm. Programmer specifies (x,y) of end pixels Need algorithm to determine pixels on line path Recall: Line drawing algorithm Programmer specifies (x,y) of end pixels Need algorithm to determine pixels on line path 8 7 6 5 4 3 2 1 (3,2) (9,6) Line: (3,2) -> (9,6)? Which intermediate pixels to turn

More information

Fall CSCI 420: Computer Graphics. 7.1 Rasterization. Hao Li.

Fall CSCI 420: Computer Graphics. 7.1 Rasterization. Hao Li. Fall 2015 CSCI 420: Computer Graphics 7.1 Rasterization Hao Li http://cs420.hao-li.com 1 Rendering Pipeline 2 Outline Scan Conversion for Lines Scan Conversion for Polygons Antialiasing 3 Rasterization

More information

Output Primitives Lecture: 3. Lecture 3. Output Primitives. Assuming we have a raster display, a picture is completely specified by:

Output Primitives Lecture: 3. Lecture 3. Output Primitives. Assuming we have a raster display, a picture is completely specified by: Lecture 3 Output Primitives Assuming we have a raster display, a picture is completely specified by: - A set of intensities for the pixel positions in the display. - A set of complex objects, such as trees

More information

CSCI 420 Computer Graphics Lecture 14. Rasterization. Scan Conversion Antialiasing [Angel Ch. 6] Jernej Barbic University of Southern California

CSCI 420 Computer Graphics Lecture 14. Rasterization. Scan Conversion Antialiasing [Angel Ch. 6] Jernej Barbic University of Southern California CSCI 420 Computer Graphics Lecture 14 Rasterization Scan Conversion Antialiasing [Angel Ch. 6] Jernej Barbic University of Southern California 1 Rasterization (scan conversion) Final step in pipeline:

More information

Line Drawing. Foundations of Computer Graphics Torsten Möller

Line Drawing. Foundations of Computer Graphics Torsten Möller Line Drawing Foundations of Computer Graphics Torsten Möller Rendering Pipeline Hardware Modelling Transform Visibility Illumination + Shading Perception, Interaction Color Texture/ Realism Reading Angel

More information

Lecture 2 October 31, 2005

Lecture 2 October 31, 2005 What is a frame buffer? Basic rasterization Computer Graphics 1, Fall 2005 Lecture 02 Chapters 7.8-7.10, 7.12, 8.13 A memory array for display Spatial size nxm pixels Use a xy coordinate system Origin

More information

Rendering. A simple X program to illustrate rendering

Rendering. A simple X program to illustrate rendering Rendering A simple X program to illustrate rendering The programs in this directory provide a simple x based application for us to develop some graphics routines. Please notice the following: All points

More information

Computer Graphics Fundamentals. Jon Macey

Computer Graphics Fundamentals. Jon Macey Computer Graphics Fundamentals Jon Macey jmacey@bournemouth.ac.uk http://nccastaff.bournemouth.ac.uk/jmacey/ 1 1 What is CG Fundamentals Looking at how Images (and Animations) are actually produced in

More information

graphics pipeline computer graphics graphics pipeline 2009 fabio pellacini 1

graphics pipeline computer graphics graphics pipeline 2009 fabio pellacini 1 graphics pipeline computer graphics graphics pipeline 2009 fabio pellacini 1 graphics pipeline sequence of operations to generate an image using object-order processing primitives processed one-at-a-time

More information

Department of Computer Sciences Graphics Fall 2003 (Lecture 2) Pixels

Department of Computer Sciences Graphics Fall 2003 (Lecture 2) Pixels Pixels Pixel: Intensity or color sample. Raster Image: Rectangular grid of pixels. Rasterization: Conversion of a primitive s geometric representation into A set of pixels. An intensity or color for each

More information

CS 325 Computer Graphics

CS 325 Computer Graphics CS 325 Computer Graphics 02 / 06 / 2012 Instructor: Michael Eckmann Today s Topics Questions? Comments? Antialiasing Polygons Interior points Fill areas tiling halftoning dithering Antialiasing Aliasing

More information

graphics pipeline computer graphics graphics pipeline 2009 fabio pellacini 1

graphics pipeline computer graphics graphics pipeline 2009 fabio pellacini 1 graphics pipeline computer graphics graphics pipeline 2009 fabio pellacini 1 graphics pipeline sequence of operations to generate an image using object-order processing primitives processed one-at-a-time

More information

Raster Displays and Scan Conversion. Computer Graphics, CSCD18 Fall 2008 Instructor: Leonid Sigal

Raster Displays and Scan Conversion. Computer Graphics, CSCD18 Fall 2008 Instructor: Leonid Sigal Raster Displays and Scan Conversion Computer Graphics, CSCD18 Fall 28 Instructor: Leonid Sigal Rater Displays Screen is represented by 2D array of locations called piels y Rater Displays Screen is represented

More information

Computer Graphics. Rasterization. Teacher: A.prof. Chengying Gao( 高成英 ) School of Data and Computer Science

Computer Graphics. Rasterization. Teacher: A.prof. Chengying Gao( 高成英 )   School of Data and Computer Science Rasterization Teacher: A.prof. Chengying Gao( 高成英 ) E-mail: mcsgcy@mail.sysu.edu.cn School of Data and Computer Science To make an image, we can... Drawing Photography 2 Two Ways to Render an Image In

More information

Practical Linear Algebra: A Geometry Toolbox

Practical Linear Algebra: A Geometry Toolbox Practical Linear Algebra: A Geometry Toolbox Third edition Chapter 18: Putting Lines Together: Polylines and Polygons Gerald Farin & Dianne Hansford CRC Press, Taylor & Francis Group, An A K Peters Book

More information

RASTERIZING POLYGONS IN IMAGE SPACE

RASTERIZING POLYGONS IN IMAGE SPACE On-Line Computer Graphics Notes RASTERIZING POLYGONS IN IMAGE SPACE Kenneth I. Joy Visualization and Graphics Research Group Department of Computer Science University of California, Davis A fundamental

More information

Computer Graphics CS 543 Lecture 11 (Part 1) Polygon Filling & Antialiasing

Computer Graphics CS 543 Lecture 11 (Part 1) Polygon Filling & Antialiasing Computer Graphics CS 543 Lecture 11 (Part 1) Polygon Filling & Antialiasing Prof Emmanuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) Defining and Filling Regions of Pixels Methods

More information

Rendering. Basic Math Review. Rasterizing Lines and Polygons Hidden Surface Remove Multi-pass Rendering with Accumulation Buffers.

Rendering. Basic Math Review. Rasterizing Lines and Polygons Hidden Surface Remove Multi-pass Rendering with Accumulation Buffers. Rendering Rasterizing Lines and Polygons Hidden Surface Remove Multi-pass Rendering with Accumulation Buffers Basic Math Review Slope-Intercept Formula For Lines Given a third point on the line: P = (X,Y)

More information

4.5 VISIBLE SURFACE DETECTION METHODES

4.5 VISIBLE SURFACE DETECTION METHODES 4.5 VISIBLE SURFACE DETECTION METHODES A major consideration in the generation of realistic graphics displays is identifying those parts of a scene that are visible from a chosen viewing position. There

More information

Identifying those parts of a scene that are visible from a chosen viewing position, and only process (scan convert) those parts

Identifying those parts of a scene that are visible from a chosen viewing position, and only process (scan convert) those parts Visible Surface Detection Identifying those parts of a scene that are visible from a chosen viewing position, and only process (scan convert) those parts Two approaches: 1. Object space methods 2. Image

More information

Time: 3 hours Max. Marks: 80. Note: Answer FIVE full questions, choosing one full question from each module.

Time: 3 hours Max. Marks: 80. Note: Answer FIVE full questions, choosing one full question from each module. USN 6 th Semester CBCS Scheme Model Question Paper 1 Department of Computer Science and Engineering, C. Byregowda Institute of Technology Computer Graphics and Visualization Time: 3 hours Max. Marks: 80

More information

Rasterization. COMP 575/770 Spring 2013

Rasterization. COMP 575/770 Spring 2013 Rasterization COMP 575/770 Spring 2013 The Rasterization Pipeline you are here APPLICATION COMMAND STREAM 3D transformations; shading VERTEX PROCESSING TRANSFORMED GEOMETRY conversion of primitives to

More information

Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 14

Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 14 Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 14 Scan Converting Lines, Circles and Ellipses Hello everybody, welcome again

More information

UNIT -8 IMPLEMENTATION

UNIT -8 IMPLEMENTATION UNIT -8 IMPLEMENTATION 1. Discuss the Bresenham s rasterization algorithm. How is it advantageous when compared to other existing methods? Describe. (Jun2012) 10M Ans: Consider drawing a line on a raster

More information

EF432. Introduction to spagetti and meatballs

EF432. Introduction to spagetti and meatballs EF432 Introduction to spagetti and meatballs CSC 418/2504: Computer Graphics Course web site (includes course information sheet): http://www.dgp.toronto.edu/~karan/courses/418/fall2015 Instructor: Karan

More information

MODULE - 4. e-pg Pathshala

MODULE - 4. e-pg Pathshala e-pg Pathshala MODULE - 4 Subject : Computer Science Paper: Computer Graphics and Visualization Module: Midpoint Circle Drawing Procedure Module No: CS/CGV/4 Quadrant 1 e-text Before going into the Midpoint

More information

2D Image Synthesis. 2D image synthesis. Raster graphics systems. Modeling transformation. Vectorization. u x u y 0. o x o y 1

2D Image Synthesis. 2D image synthesis. Raster graphics systems. Modeling transformation. Vectorization. u x u y 0. o x o y 1 General scheme of a 2D CG application 2D Image Synthesis Balázs Csébfalvi modeling image synthesis Virtual world model world defined in a 2D plane Department of Control Engineering and Information Technology

More information

Surface shading: lights and rasterization. Computer Graphics CSE 167 Lecture 6

Surface shading: lights and rasterization. Computer Graphics CSE 167 Lecture 6 Surface shading: lights and rasterization Computer Graphics CSE 167 Lecture 6 CSE 167: Computer Graphics Surface shading Materials Lights Rasterization 2 Scene data Rendering pipeline Modeling and viewing

More information

CS6504 & Computer Graphics Unit I Page 1

CS6504 & Computer Graphics Unit I Page 1 Introduction Computer contains two components. Computer hardware Computer hardware contains the graphics workstations, graphic input devices and graphic output devices. Computer Software Computer software

More information

CHAPTER 1 Graphics Systems and Models 3

CHAPTER 1 Graphics Systems and Models 3 ?????? 1 CHAPTER 1 Graphics Systems and Models 3 1.1 Applications of Computer Graphics 4 1.1.1 Display of Information............. 4 1.1.2 Design.................... 5 1.1.3 Simulation and Animation...........

More information

SE Mock Online Test 1-CG

SE Mock Online Test 1-CG SE Mock Online Test 1-CG 1. Email address * 2. 1. For gentle slope line, slope m is -1

More information

Lab Manual. Computer Graphics. T.E. Computer. (Sem VI)

Lab Manual. Computer Graphics. T.E. Computer. (Sem VI) Lab Manual Computer Graphics T.E. Computer (Sem VI) Index Sr. No. Title of Programming Assignments Page No. 1. Line Drawing Algorithms 3 2. Circle Drawing Algorithms 6 3. Ellipse Drawing Algorithms 8 4.

More information

CS602 Midterm Subjective Solved with Reference By WELL WISHER (Aqua Leo)

CS602 Midterm Subjective Solved with Reference By WELL WISHER (Aqua Leo) CS602 Midterm Subjective Solved with Reference By WELL WISHER (Aqua Leo) www.vucybarien.com Question No: 1 What are the two focusing methods in CRT? Explain briefly. Page no : 26 1. Electrostatic focusing

More information

COMPUTER GRAPHICS COURSE. Rendering Pipelines

COMPUTER GRAPHICS COURSE. Rendering Pipelines COMPUTER GRAPHICS COURSE Rendering Pipelines Georgios Papaioannou - 2014 A Rendering Pipeline Rendering or Graphics Pipeline is the sequence of steps that we use to create the final image Many graphics/rendering

More information

Computing Visibility. Backface Culling for General Visibility. One More Trick with Planes. BSP Trees Ray Casting Depth Buffering Quiz

Computing Visibility. Backface Culling for General Visibility. One More Trick with Planes. BSP Trees Ray Casting Depth Buffering Quiz Computing Visibility BSP Trees Ray Casting Depth Buffering Quiz Power of Plane Equations We ve gotten a lot of mileage out of one simple equation. Basis for D outcode-clipping Basis for plane-at-a-time

More information

R asterisation. Part I: Simple Lines. Affine transformation. Transform Render. Rasterisation Line Rasterisation 2/16

R asterisation. Part I: Simple Lines. Affine transformation. Transform Render. Rasterisation Line Rasterisation 2/16 ECM2410:GraphicsandAnimation R asterisation Part I: Simple Lines Rasterisation 1/16 Rendering a scene User space Device space Affine transformation Compose Transform Render Com pose from primitives (lines,

More information