Clipping and Scan Conversion


 Basil Nathan Wright
 2 years ago
 Views:
Transcription
1 Computer Graphics I Lecture 14 Clipping and Scan Conversion Line Clipping Polygon Clipping Clipping in Three Dimensions Scan Conversion (Rasterization) [Angel , ] March 19, 2002 Frank Pfenning Carnegie Mellon University
2 The Graphics Pipeline, Revisited Must eliminate objects outside viewing frustum Tied in with projections Clipping: object space (eye coordinates) Scissoring: image space (pixels in frame buffer) Introduce clipping in stages 2D (for simplicity) 3D (as in OpenGL) In a later lecture: scissoring 03/19/ Graphics I 2
3 Transformations and Projections Sequence applied in many implementations 1. Object coordinates to 2. Eye coordinates to 3. Clip coordinates to 4. Normalized device coordinates to 5. Screen coordinates 03/19/ Graphics I 3
4 Clipping Against a Frustum General case of frustum (truncated pyramid) y x clipped line z image plane near far Clipping is tricky because of frustum shape 03/19/ Graphics I 4
5 Perspective Normalization Solution: Implement perspective projection by perspective normalization and orthographic projection Perspective normalization is a homogeneous tfm. y x clipped line 1 y 1 x clipped line z near 0 1 z far image plane near far See [Angel Ch. 5.8] 03/19/ Graphics I 5
6 The Normalized Frustum OpenGL uses 1 x,y,z 1 (others possible) Clip against resulting cube Clipping against programmerspecified planes is different and more expensive Often a useful programming device 03/19/ Graphics I 6
7 The Viewport Transformation Transformation sequence again: 1. Camera: From object coordinates to eye coords 2. Perspective normalization: to clip coordinates 3. Clipping 4. Perspective division: to normalized device coords. 5. Orthographic projection (setting z p = 0) 6. Viewport transformation: to screen coordinates Viewport transformation can distort Often in OpenGL: resize callback 03/19/ Graphics I 7
8 LineSegment Clipping General: 3D object against cube Simpler case: In 2D: line against square or rectangle Before scan conversion (rasterization) Later: polygon clipping Several practical algorithms Avoid expensive linerectangle intersections CohenSutherland Clipping LiangBarsky Clipping Many more [see Foley et al.] 03/19/ Graphics I 8
9 Clipping Against Rectangle Linesegment clipping: modify endpoints of lines to lie within clipping rectangle Could calculate intersections of line (segments) with clipping rectangle (expensive) 03/19/ Graphics I 9
10 CohenSutherland Clipping Clipping rectangle as intersection of 4 halfplanes ymax interior = y < ymax y > ymin ymin xmin xmax x > xmin x < xmax Encode results of four halfplane tests Generalizes to 3 dimensions (6 halfplanes) 03/19/ Graphics I 10
11 Outcodes Divide space into 9 regions 4bit outcode determined by comparisons ymax b o : y > y max b 1 : y < y min b 2 : x > x max b 3 : x < x min ymin xmin xmax o 1 = outcode(x 1,y 1 ) and o 2 = outcode(x 2,y 2 ) 03/19/ Graphics I 11
12 Cases for Outcodes Outcomes: accept, reject, subdivide ymax 0001 ymin o 1 = o 2 = 0000: accept o 1 & o : reject o 1 = 0000, o : subdiv o , o 2 = 0000: subdiv o 1 & o 2 = 0000: subdiv xmin xmax 03/19/ Graphics I 12
13 CohenSutherland Subdivision Pick outside endpoint (o 0000) Pick a crossed edge (o = b 0 b 1 b 2 b 3 and b k 0) Compute intersection of this line and this edge Replace endpoint with intersection point Restart with new line segment Outcodes of second point are unchanged Must converge (roundoff errors?) 03/19/ Graphics I 13
14 LiangBarsky Clipping Starting point is parametric form Compute four intersections with extended clipping rectangle Will see that this can be avoided 03/19/ Graphics I 14
15 Ordering of intersection points Order the intersection points Figure (a): 1 > α 4 > α 3 > α 2 > α 1 > 0 Figure (b): 1 > α 4 > α 2 > α 3 > α 1 > 0 03/19/ Graphics I 15
16 LiangBarsky Efficiency Improvements Efficiency improvement 1: Compute intersections one by one Often can reject before all four are computed Efficiency improvement 2: Equations for α 3, α 2 Compare α 3, α 2 without floatingpoint division 03/19/ Graphics I 16
17 LineSegment Clipping Assessment CohenSutherland Works well if many lines can be rejected early Recursive structure (multiple subdiv) a drawback LiangBarsky Avoids recursive calls (multiple subdiv) Many cases to consider (tedious, but not expensive) Used more often in practice (?) 03/19/ Graphics I 17
18 Outline LineSegment Clipping CohenSutherland LiangBarsky Polygon Clipping SutherlandHodgeman Clipping in Three Dimensions Scan Conversion DDA algorithm Bresenham s algorithm 03/19/ Graphics I 18
19 Polygon Clipping Convert a polygon into one ore more polygons Their union is intersection with clip window Alternatively, we can first tesselate concave polygons (OpenGL supported) 03/19/ Graphics I 19
20 Concave Polygons Approach 1: clip and join to a single polygon Approach 2: tesselate and clip triangles 03/19/ Graphics I 20
21 SutherlandHodgeman I Subproblem: Input: polygon (vertex list) and single clip plane Output: new (clipped) polygon (vertex list) Apply once for each clip plane 4 in two dimensions 6 in three dimension Can arrange in pipeline 03/19/ Graphics I 21
22 SutherlandHodgeman II To clip vertex list (polygon) against halfplane: Test first vertex. Output if inside, otherwise skip. Then loop through list, testing transitions Intoin: output vertex Intoout: output intersection outtoin: output intersection and vertex outtoout: no output Will output clipped polygon as vertex list May need some cleanup in concave case Can combine with LiangBarsky idea 03/19/ Graphics I 22
23 Other Cases and Optimizations Curves and surfaces Analytically if possible Through approximating lines and polygons otherwise Bounding boxes Easy to calculate and maintain Sometimes big savings 03/19/ Graphics I 23
24 Outline LineSegment Clipping CohenSutherland LiangBarsky Polygon Clipping SutherlandHodgeman Clipping in Three Dimensions Scan Conversion DDA algorithm Bresenham s algorithm 03/19/ Graphics I 24
25 Clipping Against Cube Derived from earlier algorithms Can allow right parallelepiped 03/19/ Graphics I 25
26 CohenSutherland in 3D Use 6 bits in outcode b 4 : z > z max b 5 : z < z min Other calculations as before 03/19/ Graphics I 26
27 LiangBarsky in 3D Add equation z(α) = (1 α) z 1 + α z 2 Solve, for p 0 in plane and normal n: Yields Optimizations as for LiangBarsky in 2D 03/19/ Graphics I 27
28 Perspective Normalization Intersection simplifies for orthographic viewing One division only (no multiplication) Other LiangBarsky optimizations also apply Otherwise, use perspective normalization Reduces to orthographic case Applies to oblique and perspective viewing Normalization of oblique projections 03/19/ Graphics I 28
29 Summary: Clipping Clipping line segments to rectangle or cube Avoid expensive multiplications and divisions CohenSutherland or LiangBarsky Clipping to viewing frustum Perspective normalization to orthographic projection Apply clipping to cube from above Clientspecific clipping Use more general, more expensive form Polygon clipping SutherlandHodgeman pipeline 03/19/ Graphics I 29
30 Outline LineSegment Clipping CohenSutherland LiangBarsky Polygon Clipping SutherlandHodgeman Clipping in Three Dimensions Scan Conversion DDA algorithm Bresenham s algorithm 03/19/ Graphics I 30
31 Rasterization Final step in pipeline: rasterization (scan conv.) From screen coordinates (float) to pixels (int) Writing pixels into frame buffer Separate zbuffer, display, shading, blending Concentrate on primitives: Lines Polygons (Thursday) 03/19/ Graphics I 31
32 DDA Algorithm DDA ( Digital Differential Analyzer ) Represent Assume 0 m 1 Exploit symmetry Distinguish special cases 03/19/ Graphics I 32
33 DDA Loop Assume write_pixel(int x, int y, int value) For (ix = x1; ix <= x2; ix++) { y += m; write_pixel(ix, round(y), color); } Slope restriction needed Easy to interpolate colors 03/19/ Graphics I 33
34 Bresenham s Algorithm I Eliminate floating point addition from DDA Assume again 0 m 1 Assume pixel centers halfway between ints 03/19/ Graphics I 34
35 Bresenham s Algorithm II Decision variable a b If a b > 0 choose lower pixel If a b 0 choose higher pixel Goal: avoid explicit computation of a b Step 1: rescale d = (x 2 x 1 )(a b) = x(a b) d is always integer 03/19/ Graphics I 35
36 Bresenham s Algorithm III Compute d at step k +1 from d at step k! Case: j did not change (d k > 0) a decreases by m, b increases by m (a b) decreases by 2m = 2( y/ x) x(ab) decreases by 2 y 03/19/ Graphics I 36
37 Bresenham s Algorithm IV Case: j did change (d k 0) a decreases by m1, b increases by m1 (a b) decreases by 2m 2 = 2( y/ x 1) x(ab) decreases by 2( y  x) 03/19/ Graphics I 37
38 Bresenham s Algorithm V So d k+1 = d k 2 y if d k > 0 And d k+1 = d k 2( y x) if d k 0 Final (efficient) implementation: void draw_line(int x1, int y1, int x2, int y2) { int x, y = y0; int dx = 2*(x2x1), dy = 2*(y2y1); int dydx = dydx, D = (dydx)/2; } for (x = x1 ; x <= x2 ; x++) { write_pixel(x, y, color); if (D > 0) D = dy; else {y++; D = dydx;} } 03/19/ Graphics I 38
39 Bresenham s Algorithm VI Need different cases to handle other m Highly efficient Easy to implement in hardware and software Widely used 03/19/ Graphics I 39
40 Summary LineSegment Clipping CohenSutherland LiangBarsky Polygon Clipping SutherlandHodgeman Clipping in Three Dimensions Scan Conversion DDA algorithm Bresenham s algorithm 03/19/ Graphics I 40
41 Preview Scan conversion of polygons Antialiasing Other pixellevel operations Assignment 5 due Thursday Assignment 6 (written) out Thursday 03/19/ Graphics I 41
CS452/552; EE465/505. Clipping & Scan Conversion
CS452/552; EE465/505 Clipping & Scan Conversion 331 15 Outline! From Geometry to Pixels: Overview Clipping (continued) Scan conversion Read: Angel, Chapter 8, 8.18.9 Project#1 due: this week Lab4 due:
More informationRealtime 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 informationRasterization Computer Graphics I Lecture 14. Scan Conversion Antialiasing Compositing [Angel, Ch , ]
15462 Computer Graphics I Lecture 14 Rasterization March 13, 2003 Frank Pfenning Carnegie Mellon University http://www.cs.cmu.edu/~fp/courses/graphics/ Scan Conversion Antialiasing Compositing [Angel,
More informationTopics. 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 informationFROM 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 informationFall CSCI 420: Computer Graphics. 7.1 Rasterization. Hao Li.
Fall 2015 CSCI 420: Computer Graphics 7.1 Rasterization Hao Li http://cs420.haoli.com 1 Rendering Pipeline 2 Outline Scan Conversion for Lines Scan Conversion for Polygons Antialiasing 3 Rasterization
More information3D Rendering Pipeline (for direct illumination)
Clipping 3D Rendering Pipeline (for direct illumination) 3D Primitives 3D Modeling Coordinates Modeling Transformation Lighting 3D Camera Coordinates Projection Transformation Clipping 2D Screen Coordinates
More informationCSCI 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 informationRasterization. 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 informationLast class. A vertex (w x, w y, w z, w)  clipping is in the  windowing and viewport normalized view volume if:  scan conversion/ rasterization
Lecture 6 Last class Last lecture (clip coordinates): A vertex (w x, w y, w z, w)  clipping is in the  windowing and viewport normalized view volume if:  scan conversion/ rasterization normalized view
More informationCOMP371 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 informationChapter 8: Implementation Clipping and Rasterization
Chapter 8: Implementation Clipping and Rasterization Clipping Fundamentals CohenSutherland Parametric Polygons Circles and Curves Text Basic Concepts: The purpose of clipping is to remove objects or
More informationExamples. Clipping. The Rendering Pipeline. View Frustum. Normalization. How it is done. Types of operations. Removing what is not seen on the screen
Computer Graphics, Lecture 0 November 7, 006 Eamples Clipping Types of operations Accept Reject Clip Removing what is not seen on the screen The Rendering Pipeline The Graphics pipeline includes one stage
More informationComputer Graphics (CS 543) Lecture 9 (Part 2): Clipping. Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)
Computer Graphics (CS 543) Lecture 9 (Part 2): Clipping Prof Emmanuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) OpenGL Stages After projection, several stages before objects drawn
More information2D 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 informationOverview. Pipeline implementation I. Overview. Required Tasks. Preliminaries Clipping. Hidden Surface removal
Overview Pipeline implementation I Preliminaries Clipping Line clipping Hidden Surface removal Overview At end of the geometric pipeline, vertices have been assembled into primitives Must clip out primitives
More informationComputer Graphics.  Clipping  Philipp Slusallek & Stefan Lemme
Computer Graphics  Clipping  Philipp Slusallek & Stefan Lemme Clipping Motivation Projected primitive might fall (partially) outside of the visible display window E.g. if standing inside a building Eliminate
More informationTwoDimensional Viewing. Chapter 6
TwoDimensional Viewing Chapter 6 Viewing Pipeline TwoDimensional Viewing Two dimensional viewing transformation From world coordinate scene description to device (screen) coordinates Normalization and
More informationComputer Graphics Geometry and Transform
! Computer Graphics 2014! 5. Geometry and Transform Hongxin Zhang State Key Lab of CAD&CG, Zhejiang University 20141011! Today outline Triangle rasterization Basic vector algebra ~ geometry! Antialiasing
More informationFrom Vertices To Fragments1
From Vertices To Fragments1 1 Objectives Clipping Linesegment clipping polygon clipping 2 Overview At end of the geometric pipeline, vertices have been assembled into primitives Must clip out primitives
More informationCS123 INTRODUCTION TO COMPUTER GRAPHICS. Clipping. Concepts, Algorithms for line clipping. 1 of 16. Andries van Dam. Clipping  10/12/17
Clipping Concepts, Algorithms for line clipping 1 of 16 Line Clipping in 2D Clipping endpoints If x min x x max and y min y y max, the point is inside the clip rectangle. Endpoint analysis for lines: if
More informationFrom 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 informationThe 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 informationComputer 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 informationRasterization, 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 informationThe 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 informationCSE528 Computer Graphics: Theory, Algorithms, and Applications
CSE528 Computer Graphics: Theory, Algorithms, and Applications Hong Qin Stony Brook University (SUNY at Stony Brook) Stony Brook, New York 117942424 Tel: (631)632845; Fax: (631)6328334 qin@cs.stonybrook.edu
More informationPipeline 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 informationRasterization: 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 informationImplementation 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 informationCHAPTER 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 informationClipping & Culling. Lecture 11 Spring Trivial Rejection Outcode Clipping Planeatatime Clipping Backface Culling
Clipping & Culling Trivial Rejection Outcode Clipping Planeatatime Clipping Backface Culling Lecture 11 Spring 2015 What is Clipping? Clipping is a procedure for spatially partitioning geometric primitives,
More informationCSE328 Fundamentals of Computer Graphics
CSE328 Fundamentals of Computer Graphics Hong Qin State University of New York at Stony Brook (Stony Brook University) Stony Brook, New York 79444 Tel: (63)632845; Fax: (63)6328334 qin@cs.sunysb.edu
More informationCS4620/5620: Lecture 14 Pipeline
CS4620/5620: Lecture 14 Pipeline 1 Rasterizing triangles Summary 1! evaluation of linear functions on pixel grid 2! functions defined by parameter values at vertices 3! using extra parameters to determine
More informationLine 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 informationFrom 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 informationLine 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 informationComputer Graphics I Lecture 11
15462 Computer Graphics I Lecture 11 Midterm Review Assignment 3 Movie Midterm Review Midterm Preview February 26, 2002 Frank Pfenning Carnegie Mellon University http://www.cs.cmu.edu/~fp/courses/graphics/
More informationThe 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 information2D 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 informationTopic #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 informationRenderer 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 Feb2805 SMM009, Basics and Clipping 1
More informationEECE 478. Learning Objectives. Learning Objectives. Rasterization & Scenes. Rasterization. Compositing
EECE 478 Rasterization & Scenes Rasterization Learning Objectives Be able to describe the complete graphics pipeline. Describe the process of rasterization for triangles and lines. Compositing Manipulate
More informationComputer Graphics Geometry and Transform
Computer Graphics 2012 5. Geometry and Transform Hongxin Zhang State Key Lab of CAD&CG, Zhejiang University 20120926 上机实践 地址 :ftp://give.zju.edu.cn 用户 :cgzhang 密码 :cgzhang 请大家把上机作业结果和报告内容, 上传至 学号 _ 姓名
More informationAnnouncements. 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 informationCS602 MCQ,s for midterm paper with reference solved by Shahid
#1 Rotating a point requires The coordinates for the point The rotation angles Both of above Page No 175 None of above #2 In Trimetric the direction of projection makes unequal angle with the three principal
More informationUNIT 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 informationZ Buffer Store the depth for each pixel on the screen and compare stored value with depth of new pixel being drawn.
Andrew Lewis  Graphics Revision Keywords PIXEL FRAME BUFFER memory of the screen VIDEO  SCREEN  WINDOW  POLYGON filled area bound by straight lines SPLINE bit of wood used by draughtsmen to draw curves
More informationCS602 Computer Graphics Solved MCQS From Midterm Papers. MIDTERM EXAMINATION Spring 2013 CS602 Computer Graphics
CS602 Computer Graphics Solved MCQS From Midterm Papers Dec 18,2013 MC100401285 Moaaz.pk@gmail.com Mc100401285@gmail.com PSMD01 Question No: 1 ( Marks: 1 )  Please choose one DDA abbreviated for. Discrete
More informationgraphics 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 objectorder processing primitives processed oneatatime
More informationGraphics System. Processor. Output Display. Input Devices. Frame Buffer. Memory. Array of pixels. Resolution: # of pixels Depth: # of bits/pixel
Graphics System Input Devices Processor Memory Frame Buffer Output Display Array of pixels Resolution: # of pixels Depth: # of bits/pixel Input Devices Physical Devices: Keyboard, Mouse, Tablet, etc. Logical
More informationLecture 7 of 41. Viewing 4 of 4: Culling and Clipping Lab 1b: Flash Intro
Viewing 4 of 4: Culling and Clipping Lab 1b: Flash Intro William H. Hsu Department of Computing and Information Sciences, KSU KSOL course pages: http://bit.ly/hgvxlh / http://bit.ly/evizre Public mirror
More informationgraphics 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 objectorder processing primitives processed oneatatime
More informationClipping Lines. Dr. Scott Schaefer
Clipping Lines Dr. Scott Schaefer Why Clip? We do not want to waste time drawing objects that are outside of viewing window (or clipping window) 2/94 Clipping Points Given a point (x, y) and clipping window
More informationCS 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 informationRasterization, Depth Sorting and Culling
Rasterization, Depth Sorting and Culling Rastrerzation How can we determine which pixels to fill? Reading Material These slides OH 1726, OH 6579 and OH 281282, by Magnus Bondesson You may also read
More informationOpenGL 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 informationVISIBILITY & CULLING. Don t draw what you can t see. Thomas Larsson, Afshin Ameri DVA338, Spring 2018, MDH
VISIBILITY & CULLING Don t draw what you can t see. Thomas Larsson, Afshin Ameri DVA338, Spring 2018, MDH Visibility Visibility Given a set of 3D objects, which surfaces are visible from a specific point
More informationCS602 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 informationInteractive Computer Graphics A TOPDOWN APPROACH WITH SHADERBASED OPENGL
International Edition Interactive Computer Graphics A TOPDOWN APPROACH WITH SHADERBASED OPENGL Sixth Edition Edward Angel Dave Shreiner Interactive Computer Graphics: A TopDown Approach with ShaderBased
More informationQUESTION BANK 10CS65 : COMPUTER GRAPHICS AND VISUALIZATION
QUESTION BANK 10CS65 : COMPUTER GRAPHICS AND VISUALIZATION INTRODUCTION OBJECTIVE: This chapter deals the applications of computer graphics and overview of graphics systems and imaging. UNIT I 1 With clear
More informationRasterization Overview
Rendering Overview The process of generating an image given a virtual camera objects light sources Various techniques rasterization (topic of this course) raytracing (topic of the course Advanced Computer
More informationPainter s HSR Algorithm
Painter s HSR Algorithm Render polygons farthest to nearest Similar to painter layers oil paint Viewer sees B behind A Render B then A Depth Sort Requires sorting polygons (based on depth) O(n log n) complexity
More informationFrom 3D World to 2D Screen. Hendrik Speleers
Hendrik Speleers Overview Synthetic camera Rendering pipeline World window versus viewport Clipping CohenSutherland algorithm Rasterizing Bresenham algorithm Three different actors in a scene Objects:
More informationComputer 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 informationCs602computer graphics MCQS MIDTERM EXAMINATION SOLVED BY ~ LIBRIANSMINE ~
Cs602computer graphics MCQS MIDTERM EXAMINATION SOLVED BY ~ LIBRIANSMINE ~ Question # 1 of 10 ( Start time: 08:04:29 PM ) Total Marks: 1 SutherlandHodgeman clipping algorithm clips any polygon against
More informationCSCI 4620/8626. Computer Graphics Clipping Algorithms (Chapter 85 )
CSCI 4620/8626 Computer Graphics Clipping Algorithms (Chapter 85 ) Last update: 20160315 Clipping Algorithms A clipping algorithm is any procedure that eliminates those portions of a picture outside
More informationHeight Fields and Contours Scalar Fields Volume Rendering Vector Fields [Angel Ch. 12] April 23, 2002 Frank Pfenning Carnegie Mellon University
15462 Computer Graphics I Lecture 21 Visualization Height Fields and Contours Scalar Fields Volume Rendering Vector Fields [Angel Ch. 12] April 23, 2002 Frank Pfenning Carnegie Mellon University http://www.cs.cmu.edu/~fp/courses/graphics/
More informationWhat is Clipping? Why do we Clip? Lecture 9 Comp 236 Spring Clipping is an important optimization
Clipping, Culling, Picking & Selection Trivial Rejection Outcode Clipping Planeatatime Clipping Backface Culling Picking Selection Programming Assignment #2 Lecture 9 Comp 236 Spring 2005 What is Clipping?
More informationGLOBAL EDITION. Interactive Computer Graphics. A TopDown Approach with WebGL SEVENTH EDITION. Edward Angel Dave Shreiner
GLOBAL EDITION Interactive Computer Graphics A TopDown Approach with WebGL SEVENTH EDITION Edward Angel Dave Shreiner This page is intentionally left blank. Interactive Computer Graphics with WebGL, Global
More informationVisualization Computer Graphics I Lecture 20
15462 Computer Graphics I Lecture 20 Visualization Height Fields and Contours Scalar Fields Volume Rendering Vector Fields [Angel Ch. 12] April 15, 2003 Frank Pfenning Carnegie Mellon University http://www.cs.cmu.edu/~fp/courses/graphics/
More informationScan 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 informationSungEui Yoon ( 윤성의 )
CS380: Computer Graphics Clipping and Culling SungEui Yoon ( 윤성의 ) Course URL: http://sglab.kaist.ac.kr/~sungeui/cg/ Class Objectives Understand clipping and culling Understand viewfrustum, backface
More informationEinfü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 information15. Clipping. Projection Transformation. Projection Matrix. Perspective Division
15. Clipping Procedures for eliminating all parts of primitives outside of the specified view volume are referred to as clipping algorithms or simply clipping This takes place as part of the Projection
More information2D Viewing. Viewing Pipeline: WindowViewport Transf.
Viewing Pipeline: WindowViewport Transf. 2D Viewing yw max clipping window: what to display viewport: where to be viewed translation, rotation, scaling, clipping,... Clipping Window yv max Viewport yv
More informationComputer Graphics. The TwoDimensional Viewing. Somsak Walairacht, Computer Engineering, KMITL
Computer Graphics Chapter 6 The TwoDimensional Viewing Somsak Walairacht, Computer Engineering, KMITL Outline The TwoDimensional Viewing Pipeline The Clipping Window Normalization and Viewport Transformations
More informationProjection and viewing. Computer Graphics CSE 167 Lecture 4
Projection and viewing Computer Graphics CSE 167 Lecture 4 CSE 167: Computer Graphics Review: transformation from the object (or model) coordinate frame to the camera (or eye) coordinate frame Projection
More informationUNIVERSITY OF NEBRASKA AT OMAHA Computer Science 4620/8626 Computer Graphics Spring 2014 Homework Set 1 Suggested Answers
UNIVERSITY OF NEBRASKA AT OMAHA Computer Science 4620/8626 Computer Graphics Spring 2014 Homework Set 1 Suggested Answers 1. How long would it take to load an 800 by 600 frame buffer with 16 bits per pixel
More informationPipeline Operations. CS 4620 Lecture 10
Pipeline Operations CS 4620 Lecture 10 2008 Steve Marschner 1 Hidden surface elimination Goal is to figure out which color to make the pixels based on what s in front of what. Hidden surface elimination
More informationRasterization. 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 informationClipping. Angel and Shreiner: Interactive Computer Graphics 7E AddisonWesley 2015
Clipping 1 Objectives Clipping lines First of implementation algorithms Clipping polygons (next lecture) Focus on pipeline plus a few classic algorithms 2 Clipping 2D against clipping window 3D against
More informationRasterization. MIT EECS Frédo Durand and Barb Cutler. MIT EECS 6.837, Cutler and Durand 1
Rasterization MIT EECS 6.837 Frédo Durand and Barb Cutler MIT EECS 6.837, Cutler and Durand 1 Final projects Rest of semester Weekly meetings with TAs Office hours on appointment This week, with TAs Refine
More informationCS 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 informationComputer Graphics: 7Polygon Rasterization, Clipping
Computer Graphics: 7Polygon Rasterization, Clipping Prof. Dr. Charles A. Wüthrich, Fakultät Medien, Medieninformatik BauhausUniversität Weimar caw AT medien.uniweimar.de Filling polygons (and drawing
More informationComputer Graphics and GPGPU Programming
Computer Graphics and GPGPU Programming Donato D Ambrosio Department of Mathematics and Computer Science and Center of Excellence for High Performace Computing Cubo 22B, University of Calabria, Rende 87036,
More informationRASTERISED RENDERING
DH2323 DGI16 INTRODUCTION TO COMPUTER GRAPHICS AND INTERACTION RASTERISED RENDERING Christopher Peters HPCViz, KTH Royal Institute of Technology, Sweden chpeters@kth.se http://kth.academia.edu/christopheredwardpeters
More informationCS184 : Foundations of Computer Graphics Professor David Forsyth Final Examination
CS184 : Foundations of Computer Graphics Professor David Forsyth Final Examination (Total: 100 marks) Figure 1: A perspective view of a polyhedron on an infinite plane. Cameras and Perspective Rendering
More informationGame Architecture. 2/19/16: Rasterization
Game Architecture 2/19/16: Rasterization Viewing To render a scene, need to know Where am I and What am I looking at The view transform is the matrix that does this Maps a standard view space into world
More informationChapter 43D Camera & Optimizations, Rasterization
Chapter 43D Camera & Optimizations, Rasterization Classical Viewing Taxonomy 3D Camera Model Optimizations for the Camera How to Deal with Occlusion Rasterization Clipping Drawing lines Filling areas
More informationCurves and Surfaces Computer Graphics I Lecture 9
15462 Computer Graphics I Lecture 9 Curves and Surfaces Parametric Representations Cubic Polynomial Forms Hermite Curves Bezier Curves and Surfaces [Angel 10.110.6] February 19, 2002 Frank Pfenning Carnegie
More informationInstitutionen för systemteknik
Code: Day: Lokal: M7002E 19 March E1026 Institutionen för systemteknik Examination in: M7002E, Computer Graphics and Virtual Environments Number of sections: 7 Max. score: 100 (normally 60 is required
More informationDrawing Fast The Graphics Pipeline
Drawing Fast The Graphics Pipeline CS559 Spring 2016 Lecture 10 February 25, 2016 1. Put a 3D primitive in the World Modeling Get triangles 2. Figure out what color it should be Do ligh/ng 3. Position
More informationCourse Title: Computer Graphics Course no: CSC209
Course Title: Computer Graphics Course no: CSC209 Nature of the Course: Theory + Lab Semester: III Full Marks: 60+20+20 Pass Marks: 24 +8+8 Credit Hrs: 3 Course Description: The course coversconcepts of
More informationModels and The Viewing Pipeline. Jian Huang CS456
Models and The Viewing Pipeline Jian Huang CS456 Vertex coordinates list, polygon table and (maybe) edge table Auxiliary: Per vertex normal Neighborhood information, arranged with regard to vertices and
More informationCSE 167: Lecture #5: Rasterization. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2012
CSE 167: Introduction to Computer Graphics Lecture #5: Rasterization Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2012 Announcements Homework project #2 due this Friday, October
More informationCS184 : Foundations of Computer Graphics Professor David Forsyth Final Examination (Total: 100 marks)
CS184 : Foundations of Computer Graphics Professor David Forsyth Final Examination (Total: 100 marks) Cameras and Perspective Figure 1: A perspective view of a polyhedron on an infinite plane. Rendering
More informationSRM INSTITUTE OF SCIENCE AND TECHNOLOGY
SRM INSTITUTE OF SCIENCE AND TECHNOLOGY DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK SUB.NAME: COMPUTER GRAPHICS SUB.CODE: IT307 CLASS : III/IT UNIT1 2marks 1. What is the various applications
More informationPipeline Operations. CS 4620 Lecture Steve Marschner. Cornell CS4620 Spring 2018 Lecture 11
Pipeline Operations CS 4620 Lecture 11 1 Pipeline you are here APPLICATION COMMAND STREAM 3D transformations; shading VERTEX PROCESSING TRANSFORMED GEOMETRY conversion of primitives to pixels RASTERIZATION
More informationCS 130 Final. Fall 2015
CS 130 Final Fall 2015 Name Student ID Signature You may not ask any questions during the test. If you believe that there is something wrong with a question, write down what you think the question is trying
More information