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


 Antonia Cunningham
 1 years ago
 Views:
Transcription
1 CS452/552; EE465/505 Clipping & Scan Conversion
2 Outline! From Geometry to Pixels: Overview Clipping (continued) Scan conversion Read: Angel, Chapter 8, Project#1 due: this week Lab4 due: next week
3 Rendering Overview! Examine what happens between the vertex shader and the fragment shader! Introduce basic implementation strategies! Clipping (continued from last week)! Rendering lines polygons Angel and Shreiner: Interactive Computer Graphics 7E AddisonWesley 2015
4 Overview! At end of the geometric pipeline, vertices have been assembled into primitives! Must clip out primitives that are outside the view frustum Algorithms based on representing primitives by lists of vertices! Must find which pixels can be affected by each primitive Fragment generation Rasterization or scan conversion Angel and Shreiner: Interactive Computer Graphics 7E AddisonWesley 2015
5 Required Tasks! Clipping! Rasterization or scan conversion! Transformations! Some tasks deferred until fragment processing Hidden surface removal Antialiasing Angel and Shreiner: Interactive Computer Graphics 7E AddisonWesley 2015
6 Rasterization Meta Algorithms! Any rendering method must process every object and must assign a color to every pixel! Think of rendering algorithms as two loops over objects over pixels! The order of these loops defines two strategies image oriented object oriented Angel and Shreiner: Interactive Computer Graphics 7E AddisonWesley 2015
7 Object Space Approach! For every object, determine which pixels it covers and shade these pixels Pipeline approach Must keep track of depths for HSR Cannot handle most global lighting calculations Need entire framebuffer available at all times Angel and Shreiner: Interactive Computer Graphics 7E AddisonWesley 2015
8 Image Space Approach! For every pixel, determine which object that projects on the pixel is closest to the viewer and compute the shade of this pixel Ray tracing paradigm Need all objects available! Patch Renderers Divide framebuffer into small patches Determine which objects affect each patch Used in limited power devices such as cell phones Angel and Shreiner: Interactive Computer Graphics 7E AddisonWesley 2015
9 Recap: Linesegment Clipping! Modify endpoints of lines to lie within clipping rectangle (result shown in red)! Practical algorithms avoid expensive operations & generalize to 3D! Last time we looked at CohenSutherland Clipping! Today we will see LiangBarsky Clipping Angel and Shreiner: Interactive Computer Graphics 7E AddisonWesley 2015
10 Recap: CohenSutherland Clipping! Divide space into 9 regions (4 lines: x min, x max, y min, y max )! 4bit outcode determined by comparisons case1: both endpoints of line segment inside all four lines => accept case2: both endpoints outside all lines and on same side of a line => reject case3: one endpoint inside, one outside => at least one intersection case4: both outside & not on same side => may have multiple intersections! May have to apply the algorithm more than once (source of inefficiency)! Generalizes to 3D
11 Cohen Sutherland in 3D! Use 6bit outcodes! When needed, clip line segment against planes Angel and Shreiner: Interactive Computer Graphics 7E AddisonWesley 2015
12 LiangBarsky Clipping! Start with parametric form for a line
13 LiangBarsky Clipping! Compute all four intersections 1, 2, 3, 4 with extended clipping rectangle! Often, no need to compute all 4 intersections
14 LiangBarsky Clipping! Consider the parametric form of a line segment p(α) = (1α)p 1 + αp 2 1 α 0 p 2 p 1! We can distinguish between the cases by looking at the ordering of the values of α where the line determined by the line segment crosses the lines that determine the window Angel and Shreiner: Interactive Computer Graphics 7E AddisonWesley 2015
15 Ordering of intersection points
16 LiangBarsky Idea! It is possible to clip already if one knows the order of the four intersection points!! Even if the actual intersections were not computed!! Can enumerate all ordering cases
17 LiangBarsky efficiency improvements! Efficiency improvement 1: compute intersections one by one often can reject before all four are computed! Efficiency improvement 2:
18 Advantages! Can accept/reject as easily as with Cohen Sutherland! Using values of α, we do not have to use algorithm recursively as with CS! Extends to 3D Angel and Shreiner: Interactive Computer Graphics 7E AddisonWesley 2015
19 LineSegment Clipping Assessment! CohenSutherland works well if many lines can be rejected early recursive structure (multiple subdivisions) is a drawback! LiangBarsky avoids recursive calls many cases to consider (tedious, but not expensive)
20 Polygon Clipping! Convert a polygon into one or more polygons! Their union is the intersection with clip window! Alternatively, we can first tesselate concave polygons (OpenGL supported)
21 Polygon Clipping! Not as simple as line segment clipping Clipping a line segment yields at most one line segment Clipping a polygon can yield multiple polygons! However, clipping a convex polygon can yield at most one other polygon Angel and Shreiner: Interactive Computer Graphics 7E AddisonWesley 2015
22 Concave Polygons! Approach 1: clip, then join pieces to a single polygon (often difficult to manage)! Approach 2: tesselate and clip triangles this is the common solution
23 Tessellation and Convexity! One strategy is to replace nonconvex (concave) polygons with a set of triangular polygons (a tessellation)! Also makes fill easier! Tessellation through tesselllation shaders Angel and Shreiner: Interactive Computer Graphics 7E AddisonWesley 2015
24 Clipping as a Black Box! Can consider line segment clipping as a process that takes in two vertices and produces either no vertices or the vertices of a clipped line segment Angel and Shreiner: Interactive Computer Graphics 7E AddisonWesley 2015
25 Pipeline Clipping of Line Segments! Clipping against each side of window is independent of other sides Can use four independent clippers in a pipeline Angel and Shreiner: Interactive Computer Graphics 7E AddisonWesley 2015
26 Pipeline Clipping of Polygons! Three dimensions: add front and back clippers! Strategy used in SGI Geometry Engine! Small increase in latency Angel and Shreiner: Interactive Computer Graphics 7E AddisonWesley 2015
27 SutherlandHodgeman (part 1)! Subproblem: input: polygon (vertex list) and single clip plane output: new (clipped) polygon (vertex list)! Apply once for each clip place 4 in two dimensions 6 in three dimensions can arrange in pipeline
28 SutherlandHodgeman (part 2)! To clip vertex list (polygon) against a 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
29 Other Cases and Optimizations! Curves and surfaces Do it analytically if possible Otherwise, approximate curves/surfaces by lines and polygons! Bounding boxes Easy to calculate and maintain Sometimes big savings
30 Bounding Boxes! Rather than doing clipping on a complex polygon, we can use an axisaligned bounding box or extent Smallest rectangle aligned with axes that encloses the polygon Simple to compute: max and min of x and y Angel and Shreiner: Interactive Computer Graphics 7E AddisonWesley 2015
31 Bounding boxes! Can usually determine accept/reject based only on bounding box reject accept requires detailed clipping Angel and Shreiner: Interactive Computer Graphics 7E AddisonWesley 2015
32 Clipping and Visibility! Clipping has much in common with hiddensurface removal! In both cases, we are trying to remove objects that are not visible to the camera! Often we can use visibility or occlusion testing early in the process to eliminate as many polygons as possible before going through the entire pipeline Angel and Shreiner: Interactive Computer Graphics 7E AddisonWesley 2015
33 Recap: from vertices to fragments! What are the basic algorithms used to implement the rendering pipeline employed by OpenGL/WebGL (and other graphics systems)?! clipping! rasterization! hiddensurface removal cf. Angel, Chapter 6
34 Rasterization (scan conversion)! From screen coordinates (float) to pixels (int)! Writing pixels into frame buffer! Separate buffers: depth (zbuffer) display (frame buffer) shadows (stencil buffer) blending (accumulation buffer)
35 Rasterization (scan conversion)! Rasterization: Determine which pixels that are inside primitive specified by a set of vertices Produces a set of fragments Fragments have a location (pixel location) and other attributes such color and texture coordinates that are determined by interpolating values at vertices! Pixel colors determined later using color, texture, and other vertex properties E. Angel and D. Shreiner: Interactive Computer Graphics 6E AddisonWesley 2012
36 Outline! Rasterization: Scan conversion for Lines DDA (Digital Differential Analyzer) Bresenham s Algorithm Scan conversion for Polygons Antialiasing
37 Rasterizing a Line
38 Digital Differential Analyzer (DDA)
39 Digital Differential Analyzer (DDA)
40 Problem! DDA = for each x plot pixel at closest y Problems for steep lines Angel and Shreiner: Interactive Computer Graphics 7E AddisonWesley 2015
41 Digital Differential Analyzer (DDA)
42 Bresenham s Algorithm! Need different cases to handle m > 1! Highly efficient! Easy to implement in hardware and software! Widely used
43 Bresenham s Algorithm! DDA requires one floating point addition per step! We can eliminate all fp ops through Bresenham s algorithm! Consider only 1 m 0 Other cases by symmetry! Assume pixel centers are at half integers! If we start at a pixel that has been written, there are only two candidates for the next pixel to be written into the frame buffer Angel and Shreiner: Interactive Computer Graphics 7E AddisonWesley 2015
44 Candidate Pixels 1 m 0 candidates last pixel Note that line could have passed through any part of this pixel Angel and Shreiner: Interactive Computer Graphics 7E AddisonWesley 2015
45 Decision Variable d = Δx(ba) d is an integer d > 0 use upper pixel d < 0 use lower pixel  Angel and Shreiner: Interactive Computer Graphics 7E AddisonWesley 2015
46 Bresenham s Algorithm
47 Incremental Form! More efficient if we look at d k, the value of the decision variable at x = k d k+1 = d k 2Δy, if d k <0 d k+1 = d k 2(Δy Δx), otherwise For each x, we need do only an integer addition and a test Single instruction on graphics chips Angel and Shreiner: Interactive Computer Graphics 7E AddisonWesley 2015
48 Bresenham s Algorithm
49 Bresenham s Algorithm
50 Bresenham s Algorithm
51 Bresenham s Algorithm
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 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 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 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 informationClipping and Scan Conversion
15462 Computer Graphics I Lecture 14 Clipping and Scan Conversion Line Clipping Polygon Clipping Clipping in Three Dimensions Scan Conversion (Rasterization) [Angel 7.37.6, 7.87.9] March 19, 2002 Frank
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 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 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 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 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 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 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 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 informationRendering. Converting a 3D scene to a 2D image. Camera. Light. Rendering. View Plane
Rendering Pipeline Rendering Converting a 3D scene to a 2D image Rendering Light Camera 3D Model View Plane Rendering Converting a 3D scene to a 2D image Basic rendering tasks: Modeling: creating the world
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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.  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 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 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 informationDirect Rendering of Trimmed NURBS Surfaces
Direct Rendering of Trimmed NURBS Surfaces Hardware Graphics Pipeline 2/ 81 Hardware Graphics Pipeline GPU Video Memory CPU Vertex Processor Raster Unit Fragment Processor Render Target Screen Extended
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 informationCS230 : Computer Graphics Lecture 4. Tamar Shinar Computer Science & Engineering UC Riverside
CS230 : Computer Graphics Lecture 4 Tamar Shinar Computer Science & Engineering UC Riverside Shadows Shadows for each pixel do compute viewing ray if ( ray hits an object with t in [0, inf] ) then compute
More informationIntroduction to Computer Graphics 5. Clipping
Introduction to Computer Grapics 5. Clipping ICen Lin, Assistant Professor National Ciao Tung Univ., Taiwan Textbook: E.Angel, Interactive Computer Grapics, 5 t Ed., Addison Wesley Ref:Hearn and Baker,
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 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 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 informationGraphics and Interaction Rendering pipeline & object modelling
433324 Graphics and Interaction Rendering pipeline & object modelling Department of Computer Science and Software Engineering The Lecture outline Introduction to Modelling Polygonal geometry The rendering
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 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 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 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 informationPart IV. 2D Clipping
Part IV 2D Clipping The LiangBarsky algorithm Boolean operations on polygons Outline The LiangBarsky algorithm Boolean operations on polygons Clipping The goal of clipping is mainly to eliminate parts
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 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 informationCHETTINAD COLLEGE OF ENGINEERING & TECHNOLOGY CS2401 COMPUTER GRAPHICS QUESTION BANK
CHETTINAD COLLEGE OF ENGINEERING & TECHNOLOGY DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS2401 COMPUTER GRAPHICS QUESTION BANK PART A UNIT I2D PRIMITIVES 1. Define Computer graphics. 2. Define refresh
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 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 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 informationMotivation. Culling Don t draw what you can t see! What can t we see? Lowlevel Culling
Motivation Culling Don t draw what you can t see! Thomas Larsson Mälardalen University April 7, 2016 Image correctness Rendering speed One day we will have enough processing power!? Goals of realtime
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 informationPipeline Operations. CS 4620 Lecture 14
Pipeline Operations CS 4620 Lecture 14 2014 Steve Marschner 1 Pipeline you are here APPLICATION COMMAND STREAM 3D transformations; shading VERTEX PROCESSING TRANSFORMED GEOMETRY conversion of primitives
More information0. 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 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 informationRendering the Teapot 1
Rendering the Teapot 1 Utah Teapot 2 Angel and Shreiner: Interactive Computer Graphics 7E AddisonWesley 2015 vertices.js var numteapotvertices = 306; var vertices = [ vec3(1.4, 0.0, 2.4), vec3(1.4, 0.784,
More informationRendering approaches. 1.imageoriented. 2.objectoriented. foreach pixel... 3D rendering pipeline. foreach object...
Rendering approaches 1.imageoriented foreach pixel... 2.objectoriented foreach object... geometry 3D rendering pipeline image 3D graphics pipeline Vertices Vertex processor Clipper and primitive assembler
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 informationCS 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 informationVisibility: Z Buffering
University of British Columbia CPSC 414 Computer Graphics Visibility: Z Buffering Week 1, Mon 3 Nov 23 Tamara Munzner 1 Poll how far are people on project 2? preferences for Plan A: status quo P2 stays
More informationPESIT Bangalore South Campus Hosur road, 1km before Electronic City, Bengaluru 100 Department of Computer Science
INTERNAL ASSESSMENT TEST 2 Solution Date : 30.03.15 Max Marks : 50 Subject & Code : Computer Graphics and Visualization/10CS65 Section : A, B and C Name of faculty : Ms. Sarasvathi V/ Ms. Archana Time
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 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 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 informationDrawing Fast The Graphics Pipeline
Drawing Fast The Graphics Pipeline CS559 Fall 2016 Lectures 10 & 11 October 10th & 12th, 2016 1. Put a 3D primitive in the World Modeling 2. Figure out what color it should be 3. Position relative to the
More informationModels and Architectures. Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts University of New Mexico
Models and Architectures Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts University of New Mexico 1 Objectives Learn the basic design of a graphics system Introduce
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 informationGraphics (Output) Primitives. Chapters 3 & 4
Graphics (Output) Primitives Chapters 3 & 4 Graphic Output and Input Pipeline Scan conversion converts primitives such as lines, circles, etc. into pixel values geometric description a finite scene area
More informationRasterization. CS 4620 Lecture Kavita Bala w/ prior instructor Steve Marschner. Cornell CS4620 Fall 2015 Lecture 16
Rasterization CS 4620 Lecture 16 1 Announcements A3 due on Thu Will send mail about grading once finalized 2 Pipeline overview you are here APPLICATION COMMAND STREAM 3D transformations; shading VERTEX
More informationCOMP30019 Graphics and Interaction Rendering pipeline & object modelling
COMP30019 Graphics and Interaction Rendering pipeline & object modelling Department of Computer Science and Software Engineering The Lecture outline Introduction to Modelling Polygonal geometry The rendering
More informationLecture outline. COMP30019 Graphics and Interaction Rendering pipeline & object modelling. Introduction to modelling
Lecture outline COMP30019 Graphics and Interaction Rendering pipeline & object modelling Department of Computer Science and Software Engineering The Introduction to Modelling Polygonal geometry The rendering
More informationIntroduction to Computer Graphics with WebGL
Introduction to Computer Graphics with WebGL Ed Angel Professor Emeritus of Computer Science Founding Director, Arts, Research, Technology and Science Laboratory University of New Mexico Models and Architectures
More informationTDA362/DIT223 Computer Graphics EXAM (Same exam for both CTH and GU students)
TDA362/DIT223 Computer Graphics EXAM (Same exam for both CTH and GU students) Saturday, January 13 th, 2018, 08:3012:30 Examiner Ulf Assarsson, tel. 031772 1775 Permitted Technical Aids None, except
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 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 informationOXFORD ENGINEERING COLLEGE (NAAC Accredited with B Grade) DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING LIST OF QUESTIONS
OXFORD ENGINEERING COLLEGE (NAAC Accredited with B Grade) DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING LIST OF QUESTIONS YEAR/SEM.: III/V STAFF NAME: T.ELANGOVAN SUBJECT NAME: Computer Graphics SUB. CODE:
More informationThe University of Calgary
The University of Calgary Department of Computer Science Final Examination, Questions ENEL/CPSC 555 Computer Graphics Time: 2 Hours Closed Book, calculators are permitted. The questions carry equal weight.
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 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 informationModels and Architectures
Models and Architectures Objectives Learn the basic design of a graphics system Introduce graphics pipeline architecture Examine software components for an interactive graphics system 1 Image Formation
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 informationS U N G  E U I YO O N, K A I S T R E N D E R I N G F R E E LY A VA I L A B L E O N T H E I N T E R N E T
S U N G  E U I YO O N, K A I S T R E N D E R I N G F R E E LY A VA I L A B L E O N T H E I N T E R N E T Copyright 2018 Sungeui Yoon, KAIST freely available on the internet http://sglab.kaist.ac.kr/~sungeui/render
More informationRASTERIZING POLYGONS IN IMAGE SPACE
OnLine 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 informationCS130 : Computer Graphics. Tamar Shinar Computer Science & Engineering UC Riverside
CS130 : Computer Graphics Tamar Shinar Computer Science & Engineering UC Riverside Raster Devices and Images Raster Devices Hearn, Baker, Carithers Raster Display Transmissive vs. Emissive Display anode
More informationComputer Graphics. BingYu Chen National Taiwan University
Computer Graphics BingYu Chen National Taiwan University VisibleSurface Determination BackFace Culling The DepthSort Algorithm Binary SpacePartitioning Trees The zbuffer Algorithm ScanLine Algorithm
More informationCS130 : Computer Graphics Lecture 2: Graphics Pipeline. Tamar Shinar Computer Science & Engineering UC Riverside
CS130 : Computer Graphics Lecture 2: Graphics Pipeline Tamar Shinar Computer Science & Engineering UC Riverside Raster Devices and Images Raster Devices  raster displays show images as a rectangular array
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 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 informationHidden Surfaces II. Week 9, Mon Mar 15
University of British Columbia CPSC 314 Computer Graphics JanApr 2010 Tamara Munzner Hidden Surfaces II Week 9, Mon Mar 15 http://www.ugrad.cs.ubc.ca/~cs314/vjan2010 ews yes, I'm granting the request
More informationSurface 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 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 informationLast Time: Acceleration Data Structures for Ray Tracing. Schedule. Today. Shadows & Light Sources. Shadows
Last Time: Acceleration Data Structures for Ray Tracing Modeling Transformations Illumination (Shading) Viewing Transformation (Perspective / Orthographic) Clipping Projection (to Screen Space) Scan Conversion
More informationComputer Graphics. BingYu Chen National Taiwan University The University of Tokyo
Computer Graphics BingYu Chen National Taiwan University The University of Tokyo HiddenSurface Removal BackFace Culling The DepthSort Algorithm Binary SpacePartitioning Trees The zbuffer Algorithm
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 informationDrawing Fast The Graphics Pipeline
Drawing Fast The Graphics Pipeline CS559 Fall 2015 Lecture 9 October 1, 2015 What I was going to say last time How are the ideas we ve learned about implemented in hardware so they are fast. Important:
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 informationhttps://ilearn.marist.edu/xslportal/tool/d4e4fd3aa3...
Assessment Preview  This is an example student view of this assessment done Exam 2 Part 1 of 5  Modern Graphics Pipeline Question 1 of 27 Match each stage in the graphics pipeline with a description
More information