Computer Graphics. Attributes of Graphics Primitives. Somsak Walairacht, Computer Engineering, KMITL 1
|
|
- Leona Snow
- 5 years ago
- Views:
Transcription
1 Computer Graphics Chapter 4 Attributes of Graphics Primitives Somsak Walairacht, Computer Engineering, KMITL 1
2 Outline OpenGL State Variables Point Attributes t Line Attributes Fill-Area Attributes Scan-Line Polygon-Fill Algorithm Fill Methods for Areas with Irregular Boundaries Character Attributes Antialiasing / Computer Graphics 2
3 Introduction A parameter that affects the way a primitive i i is to be displayed d is referred to as an Attribute Parameter For example, lines can be dotted or dashed, fat or thin, and blue or orange Areas might be filled Text can appear from left to right, slanted diagonally, or in vertical / Computer Graphics 3
4 OpenGL State Variables For example, Color and other primitive attributes, the current matrix mode, the elements of the model-view matrix, the current position for the frame buffer, and the parameters for the lighting effects in a scene Remained in effect until their new values are specified We can query the system to determine the current value of a state parameter / Computer Graphics 4
5 Point Attributes Two attributes for points: color and size Color components are set with RGB values or an index into a color table Size is an integer multiple of the pixel size / Computer Graphics 5
6 Line Attributes Three basic attributes: color, width, and style Additionally, lines may be generated with other effects, such as pen and brush strokes / Computer Graphics 6
7 Fill-Area Attributes Most graphics packages limit fill areas to polygons, because they are described with linear equations Further restriction requires fill areas to be convex / Computer Graphics 7
8 Fill-Area Attributes (2) There are two basic procedures for filling an area on raster systems 1 (simple shape) Determines the overlap intervals for scan lines that cross the area Pixel positions along these overlap intervals are set to the fill color 2 (not so simple shape) Start from a given interior position and paint outward pixel-by-pixel until boundary / Computer Graphics 8
9 Fill-Area Attributes (3) The scan-line approach is usually applied to simple shapes such as circles or regions with polyline boundaries General graphics packages use this fill method While using a starting interior point, it is useful for filling areas with more complex boundaries and in interactive painting systems / Computer Graphics 9
10 Fill Styles / Computer Graphics 10
11 Color-Blended Fill Regions A pattern could be combined with background colors Using a transparency factor that determines how much of the background should be mixed with the object color / Computer Graphics 11
12 Color-Blended Fill Regions (2) Simple logical or replace operations / Computer Graphics 12
13 Color-Blended Fill Regions (3) Algorithm using color-blending Soft-fill or Tint-fill algorithms A foreground color F with a single background color B, where F = B The current RGB color P of each pixel within the area to be refilled is some linear combination of F and B P = tf + (1 t)b where the transparency factor t has a value between 0 and 1 P = (P R, P G G, P B B), F = (F R, F G G, F B B), B = (B R, B G G, B B B) t = P k B k / F k B k where k = R, G, or B; and F k B k Similarly, a foreground color is to be merged with multiple background color P = t 0 F+t 1 B 1 +(1 t 0 t 1 )B / Computer Graphics 13
14 General Scan-Line Polygon-Fill Algorithm A scan-line fill of a region is performed by first determining the intersection positions of the boundaries of the fill region with the screen scan lines Then the fill colors are applied to each section of a scan line that lies within the interior of the fill region The scan-line fill algorithm identifies the same interior regions as the odd-even rule / Computer Graphics 14
15 General Scan-Line Polygon-Fill Algorithm (2) Basic scan-line procedure: 2 steps 1. Edge intersections are sorted from left to right 2. Then the pixel positions between, and including, each intersection pair are set to the specified fill color จดร วมขอบอย ด านเด ยวก น จ ดรวมขอบอย ดานเดยวกน Sort x-intersection ascending จ ดร วมขอบอย คนละด าน / Computer Graphics 15
16 General Scan-Line Polygon-Fill Algorithm (3) To split those vertices that should be counted as one intersection When the endpoint y coordinates of the two edges are increasing, the y value of the upper endpoint for the current edge is decreased by 1 When the endpoint y values are monotonically decreasing, the y coordinate of the upper endpoint of the edge following the current edge is decreased by 1 next current current next / Computer Graphics 16
17 General Scan-Line Polygon-Fill Algorithm (4) Coherence properties can be used in computer-graphics algorithms to reduce processing It often involves incremental calculations l applied along a single scan line or between successive scan lines / Computer Graphics 17
18 Determining Fill-Area Edge Intersections Two successive scan lines crossing the left edge of a triangle The slope of this edge m = (y k+1 y k )/(x k+1 x k ) The change in y coordinates y k+1 y k = 1 Each successive x intercept can thus be calculated by adding the inverse of the slope and rounding to the nearest integer x k+1 = x k +1/m / Computer Graphics 18
19 Coherence Methods (Truncate) counter = 0 counter += dx If counter dy then { x++, counter -= dy } y++ Method 1 Method 2 (Rounding) counter = 0 counter += 2dx If counter dy then { x++, counter -= 2dy } y++ m=7/3 [1] [2] / Computer Graphics 19
20 Sorted Edge Table Proceeding around the edges in either a clockwise or a counterclockwise order, sorted on the smallest y value of each edge Only nonhorizontal edges are entered into the table For a particular scan line, the maximum y value for that edge, the x-intercept value (at the lower vertex) for the edge, the inverse slope of the edge For each scan line, the edges are in sorted order from left to right / Computer Graphics 20
21 Sorted Edge Table (2) / Computer Graphics 21
22 Sorted Edge Table (3) Process the scan lines from the bottom of the polygon to its top -> active edge list for each scan line For a scan line contains all edges crossed, uses iterative coherence calculations to obtain the edge intersections For each scan line, fill interior pixel at x-intercept values from left to right / Computer Graphics 22
23 Scan-Line Fill of Convex Polygons Uses coordinate extents to determine which edges cross a scan line Intersection calculations with these edges then determine the interior pixel span Any vertex crossing is counted as a single point Some graphics packages restrict fill areas to be triangles This makes filling even easier / Computer Graphics 23
24 Scan-Line Fill for Regions with Curved Boundaries For simple curves such as circles or ellipses, apply fill methods for convex polygons Each scan line cross just two boundary intersections Determine these two intersection points using the incremental calculations in the midpoint method Simply fill in the horizontal pixel spans Applies symmetric property between quadrants / Computer Graphics 24
25 Fill Methods For Areas with Irregular Boundaries Boundary-fill algorithm, is employed in interactive painting packages, where interior points are easily selected Select a fill color, specify the boundary color, and pick an interior i point / Computer Graphics 25
26 Fill Methods For Areas with Irregular Boundaries (2) Two methods for processing neighboring pixels from a current test position 4-connected : pixel positions that are right, left, above, and below the current pixel 8-connected : Neighboring positions to be tested includes the four diagonal pixels / Computer Graphics 26
27 Boundary Fill / Computer Graphics 27
28 Flood-Fill Algorithm Paints areas by replacing a specified interior color instead of searching for a particular boundary color Starting from a specified interior point (x, y) and reassign all pixel values to a given interior color Using either a 4-connected or 8-connected approach / Computer Graphics 28
29 Character Rendering Letters, digits, non-alphanumeric Font overall design style of a set of characters Times New Roman, Courier, Arial Fonts can vary in appearance Normal, Bold, Italic Rendering techniques Bitmap font Outlined fonts - Examples are PostScript Type 1 and Type 3 fonts, TrueType and OpenType / Computer Graphics 35
30 Character Attributes Characters with attributes such as font, size, color, and orientation Color settings for displayed text can be stored in the system attribute list Adjusts text size by scaling the overall dimensions (height h and width) of characters or by scaling only the height or the width / Computer Graphics 36
31 Character Attributes (2) The orientation for a character string can be set according to the direction of a character up vector / Computer Graphics 37
32 About Point Font size usually denoted in point (e.g. 10-point, 12- point) Denotes height of the characters in inches Atermfromtypography typography Smallest unit of measure We are concerned with desktop publishing (DTP) point, also called the PostScript point Not the original typographical point 1 DTP point = 1/72 of an inch or approx inch / Computer Graphics 38
33 Antialiasing Jagged or stair-step appearance happens because the sampling process digitizes coordinate points on an object to discrete integer pixel positions This distortion ti due to low-frequency sampling (undersampling) is called aliasing / Computer Graphics 39
34 Aliasing Starting with a continuous signal, then sample the signal at discreet points Those samples are then used to reconstruct a new signal It is intended to represent the original signal However, the reconstructed signals are a false representation of the original i signals In the English language, When a person uses a false name, it is known as an alias So, it was adapted in signal analysis to apply to falsely represented signals Aliasing in computer graphics usually results in visually distracting artifacts A lot of effort goes into trying to stop it This is known as antialiasing / Computer Graphics 40
35 Nyquist Frequency Theoretically, in order to adequately reconstruct a signal of frequency x, the original signal must be sampled with a frequency of greater than 2x This is known as the Nyquist Sampling Frequency or Nyquist Limit However, this is assuming that we are doing a somewhat idealized sampling and reconstruction In practice, it s probably a better idea to sample signals at a minimum of 4x / Computer Graphics 45
36 Nyquist Sampling Frequency To avoid losing information from such periodic objects, we need to set the sampling frequency to at least twice that of the highest frequency occurring in the object f s = 2 f max / Computer Graphics 46
37 Nyquist Sampling Interval The sampling interval should be no larger than one-half the cycle interval x s = x cycle / 2 where x cycle = 1/ f max / Computer Graphics 47
38 Antialiasing (2) To increase sampling rate, simply displays objects at higher h resolution Limitations: How big the frame buffer Refresh rate 60 fps or more Modify pixel intensities Appropriately varying the intensities iti of pixels along the boundaries of primitives / Computer Graphics 49
39 Antialiasing (3) Pre-filtering Filter before sampling- determine pixels from the continuous signal Disadvantage: percent calculation introduces complexity Post-filtering Filter after sampling- determine e pixels from the discreet samples of the continuous signal / Computer Graphics 50
40 Antialiasing (4) Supersampling (or Post-filtering) use multiple sample points across the finer grid to determine an appropriate intensity level for each screen pixel Area sampling (or Pre-filtering) by calculating the areas of overlap of each pixel with the objects to be displayed Pixel phasing Hardware approach by shifting the display location of pixel areas ( micropositioning iti i the electron beam in relation to object geometry) / Computer Graphics 51
41 Supersampling p Straight-Line Segments Divide each pixel into a number of subpixels and count the number of subpixels that overlap the line path The intensity level for each pixel is then set to a value that is proportional to this subpixel count / Computer Graphics 52
42 Supersampling p Straight-Line Segments : Advantage Represent the line with finite width The number of possible intensity levels for each pixel is equal to the total number of subpixels within the pixel area / Computer Graphics 53
43 Supersampling p Straight-Line Segments : Advantage (2) Since a particular line might cross several different color areas We can average subpixel intensities to obtain pixel color settings Ex. 5 subpixels within a particular pixel area are determined to be inside a red line and the remaining 4 subpixels fall within a blue background pixel color = (5 red + 4 blue) / / Computer Graphics 54
44 Subpixel Weighting Mask By giving more weight to subpixels near the center of a pixel area Since these subpixels are to be more important in determining the overall intensity of a pixel Intensities calculated l for each of the 9 subpixels Center subpixel is weighted by a factor of 1/4 Top, bottom, and side subpixels are each of 1/8 Corner subpixels are each weighted by 1/ / Computer Graphics 55
45 Area Sampling Straight-Line Segments A method for estimating pixel overlap areas The pixel with grid coordinates (10, 20) is about 90% covered by the line area, so its intensity would be set to 90% of the maximum intensity Similarly (10, 21) would be set to 15% / Computer Graphics 56
46 Filtering Techniques A more accurate method for antialiasing lines Similar to those for applying a weighting mask, but now we integrate over the pixel surface to obtain the weighted average intensity / Computer Graphics 57
47 Pixel Phasing With the technique by moving (micropositioning) pixel positions closer to the line path The electron beam is typically shifted by ¼, ½, or ¾ of a pixel diameter to plot points closer to the true path of a line or object edge / Computer Graphics 58
48 Pixel Phasing (2) / Computer Graphics 59
49 Compensating for Line Intensity Differences The diagonal line is longer than the horizontal line by a factor of 22 By adjusting the intensity of each line according to its slope Horizontal and vertical lines would be displayed with the lowest intensity, while 45 lines would be given the highest intensity / Computer Graphics 60
50 Antialiasing Area Boundaries Smooth area boundaries by shifting pixel positions Adjust pixel intensity at a boundary according to the percent of the interior Adjustments, based on the percent of pixel area coverage / Computer Graphics 61
51 Antialiasing Area Boundaries (2) Supersampling methods Along the two scan lines, 3 of the subpixel areas are inside the boundary So we set the pixel intensity at 75% / Computer Graphics 62
52 Antialiasing Area Boundaries (3) Determining the percentage of pixel area within a fill region By Pitteway and Watkinson, based on the midpoint line algorithm / Computer Graphics 63
53 Overlap Area of the Pixel Parameter p y - y mid = p = [m(x k + 1) + b] (y k +0.5) + (1 m) Pixel at y k is nearer if p < 1 m, and at y k + 1 is nearer if p > 1 m The interior part of the pixel area = m x k + b y k By evaluating p, we also determine the percentage of area coverage for the current pixel / Computer Graphics 64
54 OpenGL Antialiasing Functions To activate the antialiasing routines glenable (primitivetype); where primitivetype is GL_POINT_SMOOTH, GL_LINE_SMOOTH, or GL_POLYGON_SMOOTH Color-blending operations glenable (GL _ BLEND); glblendfunc (GL _ SRC_ ALPHA, GL_ ONE_ MINUS_ SRC_ ALPHA); / Computer Graphics 65
55 End of Chapter / Computer Graphics 68
Computer Graphics. Chapter 4 Attributes of Graphics Primitives. Somsak Walairacht, Computer Engineering, KMITL 1
Computer Graphics Chapter 4 Attributes of Graphics Primitives Somsak Walairacht, Computer Engineering, KMITL 1 Outline OpenGL State Variables Point Attributes Line Attributes Fill-Area Attributes Scan-Line
More 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationComputer Graphics: Graphics Output Primitives Line Drawing Algorithms
Computer Graphics: Graphics Output Primitives Line Drawing Algorithms By: A. H. Abdul Hafez Abdul.hafez@hku.edu.tr, 1 Outlines 1. Basic concept of lines in OpenGL 2. Line Equation 3. DDA Algorithm 4. DDA
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 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 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 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 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 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 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 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 information4.5 VISIBLE SURFACE DETECTION METHODES
4.5 VISIBLE SURFACE DETECTION METHODES A major consideration in the generation of realistic graphics displays is identifying those parts of a scene that are visible from a chosen viewing position. There
More 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 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 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 informationScan Converting Lines
Scan Conversion 1 Scan Converting Lines Line Drawing Draw a line on a raster screen between two points What s wrong with the statement of the problem? it doesn t say anything about which points are allowed
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 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 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 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 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 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 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 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 informationComputing Visibility. Backface Culling for General Visibility. One More Trick with Planes. BSP Trees Ray Casting Depth Buffering Quiz
Computing Visibility BSP Trees Ray Casting Depth Buffering Quiz Power of Plane Equations We ve gotten a lot of mileage out of one simple equation. Basis for D outcode-clipping Basis for plane-at-a-time
More 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 informationINSTRUCTORS: A. SANPHAWAT JATUPATWARANGKUL A. NATTAPOL SUPHAWONG A. THEEPRAKORN LUNTHOMRATTANA COMPUTER AIDED DESIGN I AUTOCAD AND ILLUSTRATOR CS
INSTRUCTORS: A. SANPHAWAT JATUPATWARANGKUL A. NATTAPOL SUPHAWONG A. THEEPRAKORN LUNTHOMRATTANA COMPUTER AIDED DESIGN I AUTOCAD AND ILLUSTRATOR CS BITMAP IMAGES VS VECTOR GRAPHICS WORKING WITH BITMAP IMAGES
More informationHow to draw and create shapes
Adobe Flash Professional Guide How to draw and create shapes You can add artwork to your Adobe Flash Professional documents in two ways: You can import images or draw original artwork in Flash by using
More informationCS 160: Lecture 10. Professor John Canny Spring 2004 Feb 25 2/25/2004 1
CS 160: Lecture 10 Professor John Canny Spring 2004 Feb 25 2/25/2004 1 Administrivia In-class midterm on Friday * Closed book (no calcs or laptops) * Material up to last Friday Lo-Fi Prototype assignment
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 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 informationLayer Styles. Learning Objectives. Introduction
5 Text, Shapes, and Layer Styles Learning Objectives After completing this chapter, you will be able to: Explain the differences between vector and bitmap graphics. Enter and edit text using the type tools.
More informationCS 4300 Computer Graphics. Prof. Harriet Fell Fall 2012 Lecture 5 September 13, 2012
CS 4300 Computer Graphics Prof. Harriet Fell Fall 2012 Lecture 5 September 13, 2012 1 Today s Topics Vectors review Shirley et al. 2.4 Rasters Shirley et al. 3.0-3.2.1 Rasterizing Lines Shirley et al.
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 informationLets assume each object has a defined colour. Hence our illumination model is looks unrealistic.
Shading Models There are two main types of rendering that we cover, polygon rendering ray tracing Polygon rendering is used to apply illumination models to polygons, whereas ray tracing applies to arbitrary
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 informationCSE 167: Introduction to Computer Graphics Lecture #5: Rasterization. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2015
CSE 167: Introduction to Computer Graphics Lecture #5: Rasterization Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2015 Announcements Project 2 due tomorrow at 2pm Grading window
More information8. Hidden Surface Elimination
8. Hidden Surface Elimination Identification and Removal of parts of picture that are not visible from a chosen viewing position. 1 8. Hidden Surface Elimination Basic idea: Overwriting Paint things in
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 information5. Text CHAPTER HIGHLIGHTS 10/12/2016 CHAPTER. Text tradition. Codes for computer text. t. Font technologies. Multimedia text.
CHAPTER 5. Text CHAPTER HIGHLIGHTS Text tradition. Codes for computer text. t Font technologies. Multimedia text. Guidelines for use of text in multimedia. 2 1 POWERS OF TEXT Multimedia developers value
More informationRendering. A simple X program to illustrate rendering
Rendering A simple X program to illustrate rendering The programs in this directory provide a simple x based application for us to develop some graphics routines. Please notice the following: All points
More 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 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 informationWrite C++/Java program to draw line using DDA and Bresenham s algorithm. Inherit pixel class and Use function overloading.
Group A Assignment No A1. Write C++/Java program to draw line using DDA and Bresenham s algorithm. Inherit pixel class and Use function overloading. Aim: To draw line using DDA and Bresenham s algorithm
More informationIT82: Mul timedia. Practical Graphics Issues 20th Feb Overview. Anti-aliasing. Fonts. What is it How to do it? History Anatomy of a Font
IT82: Mul timedia Practical Graphics Issues 20th Feb 2003 1 Anti-aliasing What is it How to do it? Lines Shapes Fonts History Anatomy of a Font Overview Types of Fonts ( which do I choose? ) How to make
More informationDo Now # 1 Label the Photoshop Interface.
Class Warmup AVTECH Do Now # 1 Label the Photoshop Interface. The Menu Bar The Options Panel The Canvas The Navigator Panel The History Panel Button The Workspace Button The Tool Bar The Layers Panel The
More informationDepartment of Computer Sciences Graphics Fall 2003 (Lecture 2) Pixels
Pixels Pixel: Intensity or color sample. Raster Image: Rectangular grid of pixels. Rasterization: Conversion of a primitive s geometric representation into A set of pixels. An intensity or color for each
More 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 informationPrime Time (Factors and Multiples)
CONFIDENCE LEVEL: Prime Time Knowledge Map for 6 th Grade Math Prime Time (Factors and Multiples). A factor is a whole numbers that is multiplied by another whole number to get a product. (Ex: x 5 = ;
More informationDiscrete Techniques. 11 th Week, Define a buffer by its spatial resolution (n m) and its depth (or precision) k, the number of
Discrete Techniques 11 th Week, 2010 Buffer Define a buffer by its spatial resolution (n m) and its depth (or precision) k, the number of bits/pixel Pixel OpenGL Frame Buffer OpenGL Buffers Color buffers
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 informationComputer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 14
Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 14 Scan Converting Lines, Circles and Ellipses Hello everybody, welcome again
More 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 informationPage 1. Area-Subdivision Algorithms z-buffer Algorithm List Priority Algorithms BSP (Binary Space Partitioning Tree) Scan-line Algorithms
Visible Surface Determination Visibility Culling Area-Subdivision Algorithms z-buffer Algorithm List Priority Algorithms BSP (Binary Space Partitioning Tree) Scan-line Algorithms Divide-and-conquer strategy:
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 informationComputer Graphics. Lecture 3 Graphics Output Primitives. Somsak Walairacht, Computer Engineering, KMITL
Computer Graphics Lecture 3 Graphics Output Primitives Somsa Walairacht, Computer Engineering, KMITL Outline Line Drawing Algorithms Circle-, Ellipse-Generating Algorithms Fill-Area Primitives Polgon Fill
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 informationanatomy cap height x-height baseline descender ligature finial terminal ascender spine small capital uppercase counter cross bar lowercase
Type Anatomy anatomy cap height x-height baseline stem bowl serif descender ligature ascender finial terminal ascender spine uppercase small capital cross bar counter lowercase 36 thinking with type cap
More informationAdvanced Shading I: Shadow Rasterization Techniques
Advanced Shading I: Shadow Rasterization Techniques Shadow Terminology umbra: light totally blocked penumbra: light partially blocked occluder: object blocking light Shadow Terminology umbra: light totally
More informationTime: 3 hours Max. Marks: 80. Note: Answer FIVE full questions, choosing one full question from each module.
USN 6 th Semester CBCS Scheme Model Question Paper 1 Department of Computer Science and Engineering, C. Byregowda Institute of Technology Computer Graphics and Visualization Time: 3 hours Max. Marks: 80
More 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 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 informationEF432. Introduction to spagetti and meatballs
EF432 Introduction to spagetti and meatballs CSC 418/2504: Computer Graphics Course web site (includes course information sheet): http://www.dgp.toronto.edu/~karan/courses/418/fall2015 Instructor: Karan
More 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 information