Attributes of Graphics Primitives
|
|
- Amber Blake
- 5 years ago
- Views:
Transcription
1 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 Werner Purgathofer / omputergraphik 1 1 Points and Line ttributes color type: solid, dashed, dotted, width, line caps, corners pen and brush options rea-ill ttributes (1) fill styles hollow, solid fill, pattern fill fill options edge type, width, color pattern specification through pattern tables tiling (reference point) Werner Purgathofer / omputergraphik 1 2 Werner Purgathofer / omputergraphik 1 3 rea-ill ttributes (2) Polygon ill lgorithms combination of fill pattern with background colors soft fill combination of colors antialiasing at object borders simul. of semitransparent brushes example: linear soft-fill...foreground color...background color Werner Purgathofer / omputergraphik 1 4 pattern background and or xor replace P = t + (1 t) what is inside? scan-line fill method flood fill method interior, exterior for selfintersecting polygons? Werner Purgathofer / omputergraphik 1 5 1
2 Polygon ill lgorithms what is inside? scan-line fill method flood fill method Polygon ill lgorithms what is inside? scan-line fill method flood fill method interior pixels along a scan line passing through a polygon area Werner Purgathofer / omputergraphik 1 6 starting from a seed point fill until you reach a border Werner Purgathofer / omputergraphik 1 7 Inside-Outside Tests area-filling algorithms interior, exterior for self-intersecting polygons? odd-even rule nonzero winding number rule cross or dot product to determine winding number same result for simple polygons What is Inside?: Odd-ven Rule inside/outside switches at every edge straight line to the outside: even # edge intersections = outside odd # edge intersections = inside Werner Purgathofer / omputergraphik 1 8 Werner Purgathofer / omputergraphik 1 9 What is Inside?: Nonzero Winding Number Scan-Line ill: Sorted dge Table point is inside if polygon surrounds it straight line to the outside: same # edges up and down = outside different # edges up and down = inside y x 1/m y x 1/m y x 1/m y x 1/m The sorted edge table contains all polygon edges sorted by lowest y-value y max x start 1/m y x 1/m Werner Purgathofer / omputergraphik 1 10 Werner Purgathofer / omputergraphik
3 Scan-Line ill: Sorted dge Table Sorted dge Table sort all edges on smallest y-value edge entry: [max y-value, x-intercept, inverse slope] y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m active-edge list for each scan line contains all edges crossed by that scan line incremental update consecutive intersection pairs (spans) filled Werner Purgathofer / omputergraphik 1 12 Werner Purgathofer / omputergraphik 1 13 y x 1/m The sorted edge table contains all polygon edges sorted by lowest y-value y max x start 1/m y x 1/m Sorted dge Table / ctive dge List Sorted dge Table / ctive dge List y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m ctive dge List Werner Purgathofer / omputergraphik 1 14 When processing from bottom to top, keep a list of all active edges ctive dge List y x 1/m y x 1/m Werner Purgathofer / omputergraphik 1 15 incremental update! Sorted dge Table / ctive dge List Sorted dge Table / ctive dge List y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m ctive dge List ctive dge List y x 1/m y x 1/m y x 1/m Werner Purgathofer / omputergraphik 1 16 Werner Purgathofer / omputergraphik
4 Sorted dge Table / ctive dge List Sorted dge Table / ctive dge List y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m ctive dge List ctive dge List y x 1/m y x 1/m Werner Purgathofer / omputergraphik 1 18 Werner Purgathofer / omputergraphik 1 19 Sorted dge Table / ctive dge List Sorted dge Table / ctive dge List y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m ctive dge List ctive dge List y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m Werner Purgathofer / omputergraphik 1 20 Werner Purgathofer / omputergraphik 1 21 Sorted dge Table / ctive dge List Sorted dge Table / ctive dge List y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m ctive dge List ctive dge List y x 1/m y x 1/m Werner Purgathofer / omputergraphik 1 22 Werner Purgathofer / omputergraphik
5 Sorted dge Table / ctive dge List Sorted dge Table / ctive dge List y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m ctive dge List ctive dge List y x 1/m y x 1/m Werner Purgathofer / omputergraphik 1 24 Werner Purgathofer / omputergraphik 1 25 Sorted dge Table / ctive dge List y x 1/m y x 1/m y x 1/m y x 1/m y x 1/m ctive dge List Scan-Line ill: Incremental Update incremental update of intersection point slope of polygon boundary line: m x k+ = 1 x + k 1 m (for 2 successive scanlines) (x k+1, y k+1 ) (x k, y k ) y k = + 1 y 1 + k y k +1 y k Werner Purgathofer / omputergraphik 1 26 Werner Purgathofer / omputergraphik 1 27 Scan-Line ill: Intersecting Vertices intersection points along scan lines that intersect polygon vertices. 2 1 either special handling (1 or 2 intersections?) lood-ill lgorithm pixel filling of area areas with no single color boundary start from interior point flood internal region 4-connected, 8-connected areas reduce stack size by eliminating several recursive calls or move vertices up or down by ε Werner Purgathofer / omputergraphik 1 28 Werner Purgathofer / omputergraphik
6 lood-ill: oundary and Seed Point lood-ill: onnectedness area must be distinguishable from boundaries seed point example: area defined within multiple color boundaries efinition: 4-connected means, that a connection is only valid in these 4 directions efinition: 8-connected means, that a connection is valid in these 8 directions Werner Purgathofer / omputergraphik 1 30 Werner Purgathofer / omputergraphik 1 31 xamples for 4- and 8-connected a 4-connected area has an 8-connected border Werner Purgathofer / omputergraphik 1 32 an 8-connected area has a 4-connected border Simple lood-ill lgorithm void floodill4 (int x, int y, int new, int old) { int color; /* set current color to new */ getpixel (x, y, color); if (color = old) { setpixel (x, y); floodill4 (x 1, y, new, old); /* left */ floodill4 (x, y+1, new, old); /* up */ floodill4 (x+1, y, new, old); /* right */ floodill4 (x, y 1, new, old) /* down */ }} Werner Purgathofer / omputergraphik 1 33 ad ehavior of Simple lood-ill Span lood-ill lgorithm recursion sequence floodill4 produces too high stacks (recursion!) solution: incremental horizontal fill (left to right) recursive vertical fill (first up then down) Werner Purgathofer / omputergraphik 1 34 Werner Purgathofer / omputergraphik
7 Good ehavior of Span lood-ill Span lood-ill xample 1 2 recursion sequence x Werner Purgathofer / omputergraphik 1 36 Werner Purgathofer / omputergraphik 1 37 Span lood-ill xample Span lood-ill xample x Werner Purgathofer / omputergraphik 1 38 Werner Purgathofer / omputergraphik 1 39 Span lood-ill xample Span lood-ill xample G G =H G H Werner Purgathofer / omputergraphik 1 40 Werner Purgathofer / omputergraphik
8 Span lood-ill xample Span lood-ill xample () H J I I J Werner Purgathofer / omputergraphik 1 42 Werner Purgathofer / omputergraphik 1 43 Span lood-ill xample Span lood-ill xample I I J K I K Werner Purgathofer / omputergraphik 1 44 Werner Purgathofer / omputergraphik 1 45 Span lood-ill xample Span lood-ill xample =N M L K L M N () M L L M N Werner Purgathofer / omputergraphik 1 46 Werner Purgathofer / omputergraphik
9 Span lood-ill xample Span lood-ill xample L L M L Werner Purgathofer / omputergraphik 1 48 Werner Purgathofer / omputergraphik 1 49 Span lood-ill xample Werner Purgathofer / omputergraphik 1 50 finished! haracter ttributes text attributes font (e.g. ourier, rial, Times, Werner Purgathofer / omputergraphik 1 51, ) styles (regular, bold, italic, underline, ) size (32 point, 1 point = 1/72 inch) proportionally sized vs. fixed space fonts string attributes horizontal orientation alignment (left, center, right, justify) isplayed primitives generated by the raster algorithms discussed in hapter 3 have a jagged, or stairstep, appearance. isplayed primitives generated by the raster algorithms discussed in hapter 3 have a jagged, or stairstep, appearance. isplayed primitives generated by the raster algorithms discussed in hapter 3 have a jagged, or stairstep, appearance. slanted v e r t i c a l isplayed primitives generated by the raster algorithms discussed in hapter 3 have a jagged, or stairstep, appearance. Triangle and Polygon ttributes color material transparency texture surface details reflexion properties, liasing and ntialiasing what is aliasing? ['eiliæsiη] what is the reason for aliasing? what can we do against it? defined illumination produces effects Werner Purgathofer / omputergraphik 1 52 Werner Purgathofer / omputergraphik
10 What is liasing? liasing: Staircase ffect errors that are caused by the discretization of analog data to digital data Werner Purgathofer / omputergraphik 1 54 too bad resolution too few colors too few images / sec geometric errors numeric errors Werner Purgathofer / omputergraphik 1 55 Various liasing ffects liasing from too few olors artificial color borders can appear Werner Purgathofer / omputergraphik 1 56 Werner Purgathofer / omputergraphik 1 57 liasing in nimations jumping images "worming t Solutions against liasing? 1. improve the devices higher resolution more color levels faster image sequence expensive or incompatible backwards rotating wheels 2. improve the images = antialiasing postprocessing software prefiltering! Werner Purgathofer / omputergraphik 1 58 Werner Purgathofer / omputergraphik
11 Shannon Sampling Theorem a signal can only be reconstructed without information loss if the sampling frequency is at least twice the highest frequency of the signal this border frequency is called "Nyquist Limit" Shannon Sampling Theorem original signal reconstructed signal sampling rate Δ Δ Nyquist sampling interval Werner Purgathofer / omputergraphik 1 60 Werner Purgathofer / omputergraphik 1 61 ntialiasing: Nyquist Sampling requency a signal can only be reconstructed without information loss if the sampling frequency is at least twice the highest frequency of the signal Nyquist sampling frequency: f s = 2 f max Δxcycle Δx = with Δx = s cycle 1/ fmax 2 i.e. sampling interval one-half cycle interval ntialiasing Strategies supersampling straight-line segments subpixel weighting masks area sampling straight-line segments filtering techniques compensating for line-intensity differences antialiasing area boundaries (adjusting boundary pixel positions) adjusting boundary pixel intensity Werner Purgathofer / omputergraphik 1 62 Werner Purgathofer / omputergraphik 1 63 ntialiasing: Supersampling Lines ntialiasing mathematical line 3 = max. intensity... 0 = min. intensity line of finite width 9 = max. intensity... 0 = min. intensity Werner Purgathofer / omputergraphik 1 64 Werner Purgathofer / omputergraphik
12 ntialiasing: rea Sampling Lines ntialiasing: Pixel Weighting Masks calculate the pixel coverage exactly can be done with incremental schemes 0% 0% 43% 15% 71% 84% 90% 52% 3% more weight for center subpixels must be divided by sum of weights subpixel grids can also include some neighboring pixels relative weights for a grid of 3x3 subpixels Werner Purgathofer / omputergraphik 1 66 Werner Purgathofer / omputergraphik 1 67 ntialiasing: iltering Techniques continuous overlapping weighting functions to calculate the antialiased values with integrals box filter cone filter Gaussian filter Werner Purgathofer / omputergraphik 1 68 ntialiasing: Intensity ifferences Werner Purgathofer / omputergraphik 1 69 unequal line lengths displayed with the same number of pixels in each line/row have different intensities proper antialiasing compensates for that! ntialiasing ntialiasing rea oundaries (1) alternative 1: supersampling adjusting pixel intensities along an area boundary Werner Purgathofer / omputergraphik 1 70 Werner Purgathofer / omputergraphik
13 ntialiasing rea oundaries (2) alternative 2: like midpoint line algorithm p = y y mid = [m(x k + 1) + b] (y k + 0.5) y ymid Werner Purgathofer / omputergraphik 1 72 p <0 y closer to y k p >0 y closer to y k+1 p = p +(1 m) : p<1 m closer to y k p>1 m closer to y k+1 ( and p [0,1] ) ntialiasing rea oundaries (3) p = p +(1-m) = [m(x k + 1) + b] (y k + 0.5) + (1 m) = = mx k + b y k = mx k + b (y k 0.5) y k p for next pixel = overlap area for current pixel p y k x k x k +1 Werner Purgathofer / omputergraphik 1 73 p p m 1-m 1-m m ntialiasing rea oundaries (4) ntialiasing xamples Werner Purgathofer / omputergraphik 1 74 Werner Purgathofer / omputergraphik 1 75 ntialiasing xamples Summary: ttributes of Primitives in 2 points, lines polygons, circles, ellipses & other curves (also filled) characters in 3 triangles & other polygons anti-aliasing Werner Purgathofer / omputergraphik 1 76 Werner Purgathofer / omputergraphik
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 informationComputer 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 informationComputer 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 informationUnit 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 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 informationAliasing and Antialiasing. ITCS 4120/ Aliasing and Antialiasing
Aliasing and Antialiasing ITCS 4120/5120 1 Aliasing and Antialiasing What is Aliasing? Errors and Artifacts arising during rendering, due to the conversion from a continuously defined illumination field
More informationChapter 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 informationCS 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 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 informationGraphics 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 informationPolygon 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 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 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 informationUNIT 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 informationText in OpenGL and Windows. Computer Graphics Attributes. Computer Graphics. Binghamton University. EngiNet. Thomas J. Watson
Binghamton University EngiNet State University of New York EngiNet Thomas J. Watson School of Engineering and Applied Science WARNING All rights reserved. No Part of this video lecture series may be reproduced
More informationAgenda. 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 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 informationFall 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 informationChapter - 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 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 information2D 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 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 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 information? 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 informationScan Converting Text. Attributes of Output Primitives. CS 460/560 Computer Graphics. Binghamton University. EngiNet. Thomas J.
Binghamton University EngiNet State University of New York EngiNet Thomas J. Watson School of Engineering and Applied Science WARNING All rights reserved. No Part of this video lecture series may be reproduced
More informationCS 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 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 informationCSCI 4620/8626. Computer Graphics Attributes of Graphics Primitives (Chapter 5)
CSCI 4620/8626 Computer Graphics Attributes of Graphics Primitives (Chapter 5) Last update: 2015-03-02 Non-Fill Methods While polygons can be filled (with patterns or colors), they can also be displayed
More informationVisible Surface Detection Methods
Visible urface Detection Methods Visible-urface Detection identifying visible parts of a scene (also hidden- elimination) type of algorithm depends on: complexity of scene type of objects available equipment
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 informationComputer 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 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 informationCS354 Computer Graphics Sampling and Aliasing
Slide Credit: http://www.siggraph.org/education/materials/hypergraph/aliasing/alias0.htm CS354 Computer Graphics Sampling and Aliasing Qixing Huang February 12th 2018 Sampling and Aliasing Display is discrete
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 informationTheoretically Perfect Sensor
Sampling 1/67 Sampling The ray tracer samples the geometry, only gathering information from the parts of the world that interact with a finite number of rays In contrast, a scanline renderer can push all
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 informationComputer 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 informationTheoretically Perfect Sensor
Sampling 1/60 Sampling The ray tracer samples the geometry, only gathering information from the parts of the world that interact with a finite number of rays In contrast, a scanline renderer can push all
More information1 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 informationComputer Graphics. Sampling Theory & Anti-Aliasing. Philipp Slusallek
Computer Graphics Sampling Theory & Anti-Aliasing Philipp Slusallek Dirac Comb (1) Constant & δ-function flash Comb/Shah function 2 Dirac Comb (2) Constant & δ-function Duality f(x) = K F(ω) = K (ω) And
More informationOutput 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 informationCSCI 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 informationRaster Scan Displays. Framebuffer (Black and White)
Raster Scan Displays Beam of electrons deflected onto a phosphor coated screen Phosphors emit light when excited by the electrons Phosphor brightness decays -- need to refresh the display Phosphors make
More informationComputer 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 informationCSC 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 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 Feb-28-05 SMM009, Basics and Clipping 1
More informationScan line algorithm. Jacobs University Visualization and Computer Graphics Lab : Graphics and Visualization 272
Scan line algorithm The scan line algorithm is an alternative to the seed fill algorithm. It does not require scan conversion of the edges before filling the polygons It can be applied simultaneously to
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 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 informationIncremental 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 informationChapter 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 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 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 informationAdobe Photoshop Sh S.K. Sublania and Sh. Naresh Chand
Adobe Photoshop Sh S.K. Sublania and Sh. Naresh Chand Photoshop is the software for image processing. With this you can manipulate your pictures, either scanned or otherwise inserted to a great extant.
More informationComputer graphics 2 Marks 1. Define Computer graphics.
Computer graphics 2 Marks 1. Define Computer graphics. Computer graphics remains one of the most existing and rapidly growing computer fields. Computer graphics may be defined as a pictorial representation
More informationCS6504 & 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 informationRasterization Computer Graphics I Lecture 14. Scan Conversion Antialiasing Compositing [Angel, Ch , ]
15-462 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 informationCOMP30019 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 informationFilled 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 informationProf. Feng Liu. Fall /25/2018
Prof. Feng Liu Fall 08 http://www.cs.pd.edu/~fliu/courses/cs7/ 0/5/08 Last time Clipping Toda Rasterization In-class Mid-term November Close-book eam Notes on page of A or Letter size paper Where We Stand
More informationTó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 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 informationSampling, Aliasing, & Mipmaps
Sampling, Aliasing, & Mipmaps Last Time? Monte-Carlo Integration Importance Sampling Ray Tracing vs. Path Tracing source hemisphere Sampling sensitive to choice of samples less sensitive to choice of samples
More informationScan Conversion of Polygons. Dr. Scott Schaefer
Scan Conversion of Polygons Dr. Scott Schaefer Drawing Rectangles Which pixels should be filled? /8 Drawing Rectangles Is this correct? /8 Drawing Rectangles What if two rectangles overlap? 4/8 Drawing
More informationWerner Purgathofer
Einführung in Visual Computing 186.822 Visible Surface Detection Werner Purgathofer Visibility in the Rendering Pipeline scene objects in object space object capture/creation ti modeling viewing projection
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 informationLecture 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 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 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 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 informationIn today s lecture we ll have a look at: A simple technique The mid-point circle algorithm
Drawing Circles In today s lecture we ll have a look at: Circle drawing algorithms A simple technique The mid-point circle algorithm Polygon fill algorithms Summary raster drawing algorithms A Simple Circle
More informationPOLYGON FILLING ALGORITHM
POLYGON FILLING ALGORITHM http://www.tutorialspoint.com/computer_graphics/polygon_filling_algorithm.htm Copyright tutorialspoint.com Polygon is an ordered list of vertices as shown in the following figure.
More informationRendering. 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 informationAdvanced Ray Tracing
Advanced Ray Tracing Thanks to Fredo Durand and Barb Cutler The Ray Tree Ni surface normal Ri reflected ray Li shadow ray Ti transmitted (refracted) ray 51 MIT EECS 6.837, Cutler and Durand 1 Ray Tree
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 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 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 informationComputer Graphics Solved MCQs -Part 2 MCQs Questions
http://itbookshub.com/ Computer Graphics Solved MCQs -Part 2 MCQs Multiple Choice Questions Computer Graphics Solved MCQs -Part 2 Two consecutive scaling transformation s1 and s2 are Additive Multiplicative
More informationOutput models Drawing Rasterization Color models
Output models Drawing Rasterization olor models Fall 2004 6.831 UI Design and Implementation 1 Fall 2004 6.831 UI Design and Implementation 2 omponents Graphical objects arranged in a tree with automatic
More informationR 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 informationAliasing. Can t draw smooth lines on discrete raster device get staircased lines ( jaggies ):
(Anti)Aliasing and Image Manipulation for (y = 0; y < Size; y++) { for (x = 0; x < Size; x++) { Image[x][y] = 7 + 8 * sin((sqr(x Size) + SQR(y Size)) / 3.0); } } // Size = Size / ; Aliasing Can t draw
More informationComputer 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 informationComputer Graphics. Texture Filtering & Sampling Theory. Hendrik Lensch. Computer Graphics WS07/08 Texturing
Computer Graphics Texture Filtering & Sampling Theory Hendrik Lensch Overview Last time Texture Parameterization Procedural Shading Today Texturing Filtering 2D Texture Mapping Forward mapping Object surface
More informationSampling, Aliasing, & Mipmaps
Sampling, Aliasing, & Mipmaps Last Time? Monte-Carlo Integration Importance Sampling Ray Tracing vs. Path Tracing source hemisphere What is a Pixel? Sampling & Reconstruction Filters in Computer Graphics
More informationToday. Acceleration Data Structures for Ray Tracing. Cool results from Assignment 2. Last Week: Questions? Schedule
Today Acceleration Data Structures for Ray Tracing Cool results from Assignment 2 Last Week: koi seantek Ray Tracing Shadows Reflection Refraction Local Illumination Bidirectional Reflectance Distribution
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 informationOutput 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 informationRay-tracing Acceleration. Acceleration Data Structures for Ray Tracing. Shadows. Shadows & Light Sources. Antialiasing Supersampling.
Ray-tracing Acceleration Acceleration Data Structures for Ray Tracing Thanks to Fredo Durand and Barb Cutler Soft shadows Antialiasing (getting rid of jaggies) Glossy reflection Motion blur Depth of field
More informationMinnesota Academic Standards for Mathematics 2007
An Alignment of Minnesota for Mathematics 2007 to the Pearson Integrated High School Mathematics 2014 to Pearson Integrated High School Mathematics Common Core Table of Contents Chapter 1... 1 Chapter
More informationDisplay Technologies: CRTs Raster Displays
Rasterization Display Technologies: CRTs Raster Displays Raster: A rectangular array of points or dots Pixel: One dot or picture element of the raster Scanline: A row of pixels Rasterize: find the set
More informationOverview 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 informationAntialiasing with Line Samples
Antialiasing with Line Samples Thouis R. Jones, Ronald N. Perry MERL - Mitsubishi Electric Research Laboratory Antialiasing Fundamentally a sampled convolution: S( Px, P S( P x, P y y ) = I( x, y) F( x
More informationSE 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 informationSampling and Monte-Carlo Integration
Sampling and Monte-Carlo Integration Sampling and Monte-Carlo Integration Last Time Pixels are samples Sampling theorem Convolution & multiplication Aliasing: spectrum replication Ideal filter And its
More informationCreating Mathematical Illustrations
MLI Home Mathematics The Torus Creating Mathematical Illustrations Creating Mathematical Illustrations Worth the pain Creating the illustrations for the torus geodesics page was a challenge. No single
More informationCS-184: Computer Graphics. Today. 2D Scan Conversion. Tuesday, October 7, Drawing Lines Drawing Curves Filled Polygons Filling Algorithms
CS-184: Computer Graphics Lecture #9: Scan Conversion Prof. James O Brien University of California, Berkeley V2008-F-09-1.0 1 Today 2D Scan Conversion Drawing Lines Drawing Curves Filled Polygons Filling
More informationCS-184: Computer Graphics
CS-184: Computer Graphics Lecture #9: Scan Conversion Prof. James O Brien University of California, Berkeley V2009-F-09-1.0 Today 2D Scan Conversion Drawing Lines Drawing Curves Filled Polygons Filling
More informationComputer Graphics Geometry and Transform
Computer Graphics 2012 5. Geometry and Transform Hongxin Zhang State Key Lab of CAD&CG, Zhejiang University 2012-09-26 上机实践 地址 :ftp://give.zju.edu.cn 用户 :cgzhang 密码 :cgzhang 请大家把上机作业结果和报告内容, 上传至 学号 _ 姓名
More informationGRAPHICS OUTPUT PRIMITIVES
CHAPTER 3 GRAPHICS OUTPUT PRIMITIVES LINE DRAWING ALGORITHMS DDA Line Algorithm Bresenham Line Algorithm Midpoint Circle Algorithm Midpoint Ellipse Algorithm CG - Chapter-3 LINE DRAWING Line drawing is
More informationComputer Graphics - Week 6
Computer Graphics - Week 6 Bengt-Olaf Schneider IBM T.J. Watson Research Center Questions about Last Week? Questions about Assignment? Comments about submission Deadline is Friday, 2/26 at 5:30 pm Standard
More information