CS 325 Computer Graphics
|
|
- Cory Franklin
- 5 years ago
- Views:
Transcription
1 CS 325 Computer Graphics 02 / 06 / 2012 Instructor: Michael Eckmann
2 Today s Topics Questions? Comments? Antialiasing Polygons Interior points Fill areas tiling halftoning dithering
3 Antialiasing Aliasing is the distortion we see when we undersample. The jaggedness stairstep quality of lines is an example of aliasing. Good example of undersampling figure 6-58 Solutions: Higher addressability e.g. Move from a 800x600 grid to a 1280x1024 grid and your lines will look smoother. When keeping fixed addressability --- then we can change the intensity of the pixels being turned on. And instead of turning on one pixel at full intensity, we appropriately weight the intensities of two pixels at each step to cause the illusion of a point at some intermediate location between the two pixel centers.
4 Antialiasing Supersampling is a technique to treat the screen as a finer grid than is actually addressable and plot the points by turning on multiple points in the finer grid. Then when ready to display --- use the finer grid points to determine the intensities of the pixels of the actual screen. Example --- divide each actual addressable pixel into 9 (3x3) finer subpixels. Draw a Bresenham line on the subpixels. Then base the intensity of actual pixel on how many of the 9 subpixels would be on. 3 subpixels is max, so that's full intensity 2 subpixels could cause the pixel to be at 2/3 intensity 1 subpixel on could cause the pixel to be at 1/3 intensity 0 would be off
5 Antialiasing Alternately, we could use a weighting mask that would give more weight to the center subpixel of the 3x3 grid Another alternative is to treat the line as a rectangle of width 1 pixel & draw it on the finer grid (w/ 9 subpixels per pixel). Then how many of the 9 subpixels are on (on = bottom left corner of subpixel is inside the rectangle) determines the intensity of pixel (9 = full intensity, 8 = 8/9 intensity, etc.) This is better than the three intensity levels of the other supersampling method.
6 Antialiasing Area sampling is a technique that computes areas of overlap of each pixel with the object (e.g. line or polygon) to be displayed. This is similar to the supersampling method described last (treating the line as a rectangle), but instead of just 9 different intensities, let the intensity of a pixel be the area of the rectangle that overlaps the pixel / the area of the whole pixel.
7 Antialiasing There are other techniques to do antialiasing --- filtering techniques. These are similar to the discrete mask two slides ago, except they work with a continuous function to determine the weightings of the pixels. Examples on the next slide show a box, a cone and a Gaussian. The volumes of these are normalized to 1 and to determine the weighting of a pixel we integrate the function over the pixel surface. Since integrating is expensive (in time) lookup tables can be used.
8 Antialiasing
9 Antialiasing also helps with... Notice: without antialiasing, compare a line with slope = 1 made up of n pixels and a line with slope = 0 made up of n pixels. The slope = 1 line is SQRT(2) longer but is made up of the same number of pixels. What do you think is the visual effect of this?
10 Antialiasing helps total intensity See figures 6-63 & 6-64 in text. In addition to lines looking straighter, when using the antialiasing technique that treats lines as having some finite width, lines of different angles will not have different total intensities.
11 Polygons 3 or more vertices describe a polygon. The vertices are connected with line segments (called an edge, or a side). Each edge can only have endpoints in common with any other edge. Definition of convex polygon Def 1: All interior angles are < 180 degrees Def 2: The interior lies completely on 1 side of the infinite extension of any edge. Def 3: If we select any two interior points, the line segment joining them is also fully in the interior of the polygon Definition of concave polygon Not convex.
12 Polygons Degenerate polygons are Those with 3 or more collinear vertices Those with repeated vertices Etc.
13 Polygon interior points A common operation is to determine if a point is in the interior of a polygon or not. One way to do it is, for some point, draw a horizontal line from that point to a distant point outside the possible area of the polygon and count how many times the horizontal line crosses edges of the polygon. If the line crosses an odd number of edges, then it is an interior point. If it crosses an even number of edges, then it is exterior. Example on board.
14 Polygon interior points What happens when the horizontal line crosses a vertex. Should it be counted as 1 or 2? Example on board.
15 Polygon interior points What happens when the horizontal line crosses a vertex. Should it be counted as 1 or 2? If the vertex is a local maximum or a local minimum then count it as 2. Otherwise count it as 1.
16 Polygon fill areas Polygons in OpenGL are specified by vertices. It is good to get into the habit now that you specify the vertices in counterclockwise order. The reason for this is, when we do some things later this semester like displaying 3D objects, we're going to care about which side (face) of the polygon is visible. The front face of a polygon is visible when its vertices are in counterclockwise order. We'll know if we're seeing the back face of a polygon if they are in clockwise order.
17 Polygon fill areas To do a scanline fill of a polygon (see figure 6-49). Determine the intersections (crossings) of the horizontal line (y=c) with the edges (y=mx + b) of the polygon. Sort the crossings (x coordinates) from low to high (left to right). There will be an even number of crossings, so draw horizontal lines between the first two crossings, then the next 2 and so on. If the scanline goes through a vertex Add the crossing to the list twice if it's a local max or min. Add the crossing only once otherwise. Horizontal edges of a polygon can be ignored (not turned on.) Example on board.
18 Polygon fill areas Another way to determine how many to count if the scanline goes through a vertex If the two edges are on the same side of the scanline, then add it twice. If the two edges are on different sides of the scanline, then add it once. To check for this, we can compare the y coordinates of the 3 vertices in question (draw on board) in either clockwise or counterclockwise fashion If all 3 are monotonically increasing or all 3 are monotonically decreasing then the two edges are on different sides.
19 Polygon fill areas Edge coherence properties can be used to speed up the calculation of the crossings of the scanline and edges. The crossing x-coordinate of one scanline with an edge differs from the crossing of the x-coordinate of the next scanline only by 1/m as seen below. Assuming we're processing the fill from bottom to top and the y's increase as we go up, Assume scan line y k crosses an edge at (x k, y k ) and y k+1 crosses at (x k+1, y k+1 ) m = (y k+1 y k ) / (x k+1 x k ) (y k+1 y k ) = 1, so, m = 1 / (x k+1 x k ) and solve for x k+1 So, scan line y k+1 crosses that edge at (x k + 1/m, y k+1 ) This is less processing than doing the intersection of y = y k+1 with y = mx + b which is x = (y k+1 +b)/m.
20 Polygon fill areas Efficient polygon filling 1) proceed around edges in a clockwise or counterclockwise fashion 2) store each edge in an edge table 3) sort the edges based on the minimum y in the edge 4) process the scanlines in a bottom to top order 5) when the current scanline reaches the lower endpoint (with the min y) of the edge, that edge becomes active 6) active edges are sorted by their x coordinates (left to right) During any given scanline non-active edges can be marked as either finished, or not yet active. Horizontal edges are ignored. Example on board.
21 Polygon fill areas Masks Besides being filled with a solid color, polygons are sometimes filled with patterns. The process of filling an area with a pattern is called tiling. Fill patterns can be stored as rectangular arrays. The arrays are called masks and they are applied to the fill area and are usually smaller than the area to be filled. The mask needs a starting position within the area to be filled. Starting at this position the mask is replicated both vertically and horizontally. If the mask is an m n array, and starting position is (0,0) a pixel at (x, y) will be drawn with the color in mask((x mod n), (y mod m)). Example on board.
22 Polygon fill areas Section 17.9 Halftoning and dithering When there are very few intensity levels available (e.g. 2, black & white) to be displayed, halftoning is a technique that can provide more intensities with a tradeoff in addressability (less). Newspapers show grey level photos by displaying black circles. The black circles vary in size according to how dark that part of the photo should be. In graphics systems this halftoning technique is approximated with halftone patterns. Halftone patterns are typically n n squares of pixels where the number of pixels turned on in that pattern corresponds to the intensity desired.
23 Polygon fill areas How is halftoning a tradeoff between intensities and addressability (resolution)?
24 Polygon fill areas Guidelines to creating halftoning patterns With halftoning, one thing to be careful about is that the patterns can become apparent. That is undesirable. The intent is to have the viewer see the increase in intensities without noticing unintentional patterns. Avoid only horizontal or vertical or diagonal pixels on in the patterns to reduce the possibility of streaks. Further it is good to approximate the way that newspapers do it --- that is, concentrate on turning on pixels in the center of the pattern at each successive intensity. To minimize unintentional patterns to be displayed, we can evolve each successive grid pattern by copying it and turning on an additional pixel. See next slide figure
25 Polygon fill areas
26 Polygon fill areas - Dithering Dithering Dithering refers to techniques for approximating halftones but without reducing addressability (resolution). An n n dither matrix D n is used to determine if a pixel should be on or off. The matrix is filled with the numbers from 0 to n 2 1 on page 534 (equation 17-49) there's a mistake, it should be the dither matrix D
27 Polygon fill areas - Dithering Example of dither matrix D First, we scale the input intensities to the range 0 to n 2. So, for some pixel at (x, y) we compute i = x mod n and j = y mod n to find which element (i,j) of the matrix D n to compare to the desired intensity. If I(x,y) > D n (i,j) then the pixel is turned on, otherwise it is not. This has the effect of different intensities, without reducing resolution. But what gets lost?
28 Antialiasing Polygons Edges of polygons are lines. Lines (and therefore edges) have aliasing problems when made discrete. Antialiasing edges of polygons can be done using similar techniques as were used with lines. One way described below is the way I described antialiasing Bresenham lines. During scanline fill of a polygon, if the edge falls between two pixels on the scanline, then the intensities of the pixels depend on how close to the centers of the two pixels the line falls. The pixel at (x j, y k ): could be set to have x j+1 x and The pixel at (x j+1, y k ) would then be set to have x x j Pixels that fall fully within the interior of a polygon are set to full intensity.
29 2D transformations Points are usually specified as vectors Matrices represent transformations Examples on the board.
Computer Graphics. Attributes of Graphics Primitives. Somsak Walairacht, Computer Engineering, KMITL 1
Computer Graphics Chapter 4 Attributes of Graphics Primitives Somsak Walairacht, Computer Engineering, KMITL 1 Outline OpenGL State Variables Point Attributes t Line Attributes Fill-Area Attributes Scan-Line
More 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 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 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 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 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 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 informationAttributes of Graphics Primitives
ttributes for Graphics Output Primitives ttributes of Graphics Primitives in 2 points, lines polygons, circles, ellipses & other curves (also filled) characters in 3 triangles & other polygons anti-aliasing
More 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 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 informationIntro to Modeling Modeling in 3D
Intro to Modeling Modeling in 3D Polygon sets can approximate more complex shapes as discretized surfaces 2 1 2 3 Curve surfaces in 3D Sphere, ellipsoids, etc Curved Surfaces Modeling in 3D ) ( 2 2 2 2
More informationLesson 1. Unit 2 Practice Problems. Problem 2. Problem 1. Solution 1, 4, 5. Solution. Problem 3
Unit 2 Practice Problems Lesson 1 Problem 1 Rectangle measures 12 cm by 3 cm. Rectangle is a scaled copy of Rectangle. Select all of the measurement pairs that could be the dimensions of Rectangle. 1.
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 informationComputer Graphics. The Two-Dimensional Viewing. Somsak Walairacht, Computer Engineering, KMITL
Computer Graphics Chapter 6 The Two-Dimensional Viewing Somsak Walairacht, Computer Engineering, KMITL Outline The Two-Dimensional Viewing Pipeline The Clipping Window Normalization and Viewport Transformations
More 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 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 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 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 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 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 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 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 informationComputational Geometry. Geometry Cross Product Convex Hull Problem Sweep Line Algorithm
GEOMETRY COMP 321 McGill University These slides are mainly compiled from the following resources. - Professor Jaehyun Park slides CS 97SI - Top-coder tutorials. - Programming Challenges books. Computational
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 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 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 informationFor this assignment, you are to implement three line drawers and a polygon drawer.
SFU CMPT 361 Computer Graphics Fall 2017 Assignment 1 Assignment due Thursday, September 28, by 11:59 pm. For this assignment, you are to implement three line drawers and a polygon drawer. These rendering
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 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 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 information(Refer Slide Time: 00:02:00)
Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 18 Polyfill - Scan Conversion of a Polygon Today we will discuss the concepts
More 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 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 informationCourse Guide (/8/teachers/teacher_course_guide.html) Print (/8/teachers/print_materials.html) LMS (/8
(http://openupresources.org)menu Close OUR Curriculum (http://openupresources.org) Professional Development (http://openupresources.org/illustrative-mathematics-professional-development) Implementation
More informationGraphics Hardware and Display Devices
Graphics Hardware and Display Devices CSE328 Lectures Graphics/Visualization Hardware Many graphics/visualization algorithms can be implemented efficiently and inexpensively in hardware Facilitates interactive
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 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 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: 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 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 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 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 informationCSCI 4620/8626. Computer Graphics Clipping Algorithms (Chapter 8-5 )
CSCI 4620/8626 Computer Graphics Clipping Algorithms (Chapter 8-5 ) Last update: 2016-03-15 Clipping Algorithms A clipping algorithm is any procedure that eliminates those portions of a picture outside
More informationCS 325 Computer Graphics
CS 325 Computer Graphics 02 / 29 / 2012 Instructor: Michael Eckmann Today s Topics Questions? Comments? Specifying arbitrary views Transforming into Canonical view volume View Volumes Assuming a rectangular
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 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 informationGraphics Programming Principles and Algorithms
Graphics Programming Principles and Algorithms Zongli Shi May 27, 2017 Abstract This paper is an introduction to graphics programming. This is a computer science field trying to answer questions such as
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 informationCSCI 4620/8626. Coordinate Reference Frames
CSCI 4620/8626 Computer Graphics Graphics Output Primitives Last update: 2014-02-03 Coordinate Reference Frames To describe a picture, the world-coordinate reference frame (2D or 3D) must be selected.
More 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 information1. (10 pts) Order the following three images by how much memory they occupy:
CS 47 Prelim Tuesday, February 25, 2003 Problem : Raster images (5 pts). (0 pts) Order the following three images by how much memory they occupy: A. a 2048 by 2048 binary image B. a 024 by 024 grayscale
More informationCourse Number: Course Title: Geometry
Course Number: 1206310 Course Title: Geometry RELATED GLOSSARY TERM DEFINITIONS (89) Altitude The perpendicular distance from the top of a geometric figure to its opposite side. Angle Two rays or two line
More informationpine cone Ratio = 13:8 or 8:5
Chapter 10: Introducing Geometry 10.1 Basic Ideas of Geometry Geometry is everywhere o Road signs o Carpentry o Architecture o Interior design o Advertising o Art o Science Understanding and appreciating
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 informationGlossary of dictionary terms in the AP geometry units
Glossary of dictionary terms in the AP geometry units affine linear equation: an equation in which both sides are sums of terms that are either a number times y or a number times x or just a number [SlL2-D5]
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 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 informationPractical Linear Algebra: A Geometry Toolbox
Practical Linear Algebra: A Geometry Toolbox Third edition Chapter 18: Putting Lines Together: Polylines and Polygons Gerald Farin & Dianne Hansford CRC Press, Taylor & Francis Group, An A K Peters Book
More 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 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 informationPLC Papers Created For:
PLC Papers Created For: Year 10 Topic Practice Papers: Polygons Polygons 1 Grade 4 Look at the shapes below A B C Shape A, B and C are polygons Write down the mathematical name for each of the polygons
More informationCHAPTER 2 REVIEW COORDINATE GEOMETRY MATH Warm-Up: See Solved Homework questions. 2.2 Cartesian coordinate system
CHAPTER 2 REVIEW COORDINATE GEOMETRY MATH6 2.1 Warm-Up: See Solved Homework questions 2.2 Cartesian coordinate system Coordinate axes: Two perpendicular lines that intersect at the origin O on each line.
More information3D graphics, raster and colors CS312 Fall 2010
Computer Graphics 3D graphics, raster and colors CS312 Fall 2010 Shift in CG Application Markets 1989-2000 2000 1989 3D Graphics Object description 3D graphics model Visualization 2D projection that simulates
More informationHigh School Geometry. Correlation of the ALEKS course High School Geometry to the ACT College Readiness Standards for Mathematics
High School Geometry Correlation of the ALEKS course High School Geometry to the ACT College Readiness Standards for Mathematics Standard 5 : Graphical Representations = ALEKS course topic that addresses
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 informationCS 325 Computer Graphics
CS 325 Computer Graphics 04 / 02 / 2012 Instructor: Michael Eckmann Today s Topics Questions? Comments? Illumination modelling Ambient, Diffuse, Specular Reflection Surface Rendering / Shading models Flat
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 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 informationHidden-Surface Removal.
Hidden-Surface emoval. Here we need to discover whether an object is visible or another one obscures it. here are two fundamental approaches to remove the hidden surfaces: ) he object-space approach )
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 informationComputer Science 474 Spring 2010 Viewing Transformation
Viewing Transformation Previous readings have described how to transform objects from one position and orientation to another. One application for such transformations is to create complex models from
More informationCS 248 Assignment 2 Polygon Scan Converter. CS248 Presented by Abe Davis Stanford University October 17, 2008
CS 248 Assignment 2 Polygon Scan Converter CS248 Presented by Abe Davis Stanford University October 17, 2008 Announcements First thing: read README.animgui. It should tell you everything you need to know
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 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 informationCS-321 Thursday 12 September 2002 Quiz (3 pts.) What is the purpose of a control grid in a cathode ray tube (CRT)?
Name CS-321 Thursday 12 September 2002 Quiz 1 1. (3 pts.) What is the purpose of a control grid in a cathode ray tube (CRT)? 2. (7 pts.) For the same resolution in pixels (for example, 640x480), why does
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 informationTexture Mapping. Texture (images) lecture 16. Texture mapping Aliasing (and anti-aliasing) Adding texture improves realism.
lecture 16 Texture mapping Aliasing (and anti-aliasing) Texture (images) Texture Mapping Q: Why do we need texture mapping? A: Because objects look fake and boring without it. Adding texture improves realism.
More informationlecture 16 Texture mapping Aliasing (and anti-aliasing)
lecture 16 Texture mapping Aliasing (and anti-aliasing) Texture (images) Texture Mapping Q: Why do we need texture mapping? A: Because objects look fake and boring without it. Adding texture improves realism.
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 informationPolygons. Discuss with a partner what a POLYGON is. Write down the key qualities a POLYGON has. Share with the class what a polygon is?
Polygons Use a ruler to draw 3 different POLYGONS Discuss with a partner what a POLYGON is Write down the key qualities a POLYGON has Share with the class what a polygon is? *Can you find the area of each
More informationElementary Planar Geometry
Elementary Planar Geometry What is a geometric solid? It is the part of space occupied by a physical object. A geometric solid is separated from the surrounding space by a surface. A part of the surface
More informationInvestigating Properties of Kites
Investigating Properties of Kites Definition: Kite a quadrilateral with two distinct pairs of consecutive equal sides (Figure 1). Construct and Investigate: 1. Determine three ways to construct a kite
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 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 informationHow do we draw a picture?
1 How do we draw a picture? Define geometry. Now what? We can draw the edges of the faces. Wireframe. We can only draw the edges of faces that are visible. We can fill in the faces. Giving each object
More informationObjective: Construct perpendicular line segments on a rectangular grid.
NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 15 5 6 Lesson 15 Objective: Construct perpendicular line segments on a rectangular grid. Suggested Lesson Structure Fluency Practice Concept Development Student
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 informationComputer Science 426 Midterm 3/11/04, 1:30PM-2:50PM
NAME: Login name: Computer Science 46 Midterm 3//4, :3PM-:5PM This test is 5 questions, of equal weight. Do all of your work on these pages (use the back for scratch space), giving the answer in the space
More informationIntersection of an Oriented Box and a Cone
Intersection of an Oriented Box and a Cone David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International
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 informationheptagon; not regular; hexagon; not regular; quadrilateral; convex concave regular; convex
10 1 Naming Polygons A polygon is a plane figure formed by a finite number of segments. In a convex polygon, all of the diagonals lie in the interior. A regular polygon is a convex polygon that is both
More informationCS488 2D Graphics. Luc RENAMBOT
CS488 2D Graphics Luc RENAMBOT 1 Topics Last time, hardware and frame buffer Now, how lines and polygons are drawn in the frame buffer. Then, how 2D and 3D models drawing into the frame buffer Then, more
More informationCS452/552; EE465/505. Clipping & Scan Conversion
CS452/552; EE465/505 Clipping & Scan Conversion 3-31 15 Outline! From Geometry to Pixels: Overview Clipping (continued) Scan conversion Read: Angel, Chapter 8, 8.1-8.9 Project#1 due: this week Lab4 due:
More informationIntroduction to Geometry
Introduction to Geometry This course covers the topics outlined below. You can customize the scope and sequence of this course to meet your curricular needs. Curriculum (211 topics + 6 additional topics)
More informationCS559: Computer Graphics. Lecture 12: Antialiasing & Visibility Li Zhang Spring 2008
CS559: Computer Graphics Lecture 12: Antialiasing & Visibility Li Zhang Spring 2008 Antialising Today Hidden Surface Removal Reading: Shirley ch 3.7 8 OpenGL ch 1 Last time A 2 (x 0 y 0 ) (x 1 y 1 ) P
More informationAn angle that has a measure less than a right angle.
Unit 1 Study Strategies: Two-Dimensional Figures Lesson Vocab Word Definition Example Formed by two rays or line segments that have the same 1 Angle endpoint. The shared endpoint is called the vertex.
More informationFrom Vertices To Fragments-1
From Vertices To Fragments-1 1 Objectives Clipping Line-segment clipping polygon clipping 2 Overview At end of the geometric pipeline, vertices have been assembled into primitives Must clip out primitives
More informationNEW YORK GEOMETRY TABLE OF CONTENTS
NEW YORK GEOMETRY TABLE OF CONTENTS CHAPTER 1 POINTS, LINES, & PLANES {G.G.21, G.G.27} TOPIC A: Concepts Relating to Points, Lines, and Planes PART 1: Basic Concepts and Definitions...1 PART 2: Concepts
More informationM2 GEOMETRY REVIEW FOR MIDTERM EXAM
M2 GEOMETRY REVIEW FOR MIDTERM EXAM #1-11: True or false? If false, replace the underlined word or phrase to make a true sentence. 1. Two lines are perpendicular if they intersect to form a right angle.
More informationPolygons. Discuss with a partner what a POLYGON is. Write down the key qualities a POLYGON has. Share with the class what a polygon is?
Polygons Use a ruler to draw 3 different POLYGONS Discuss with a partner what a POLYGON is Write down the key qualities a POLYGON has Share with the class what a polygon is? *Can you find the area of each
More information