CS552: Computer Graphics Lecture 17: Scan Conversion (Special Cases)

Slides:



Advertisements
Similar presentations
30/9/2008Lecture 21 Computer Graphics Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD3107 University of Palestine.
Advertisements

CP411 polygon Lecture 6 1. Scan conversion algorithm for circle 2. Draw polygons 3. Antialiasing.
CS 352: Computer Graphics Chapter 7: The Rendering Pipeline.
In the name of God Computer Graphics Bastanfard.
CS 551 / CS 645 Antialiasing. What is a pixel? A pixel is not… –A box –A disk –A teeny tiny little light A pixel is a point –It has no dimension –It occupies.
CS 376 Introduction to Computer Graphics 02 / 05 / 2007 Instructor: Michael Eckmann.
Output Primitives Computer Graphics.
CS248 Midterm Review. CS248 Midterm Mon, November 4, 7-9 pm, Terman Aud Mostly “short answer” questions – Keep your answers short and sweet! Covers lectures.
Graphics Device Principles B.Sc. (Hons) Multimedia ComputingMedia Technologies.
CS248 Midterm Review. CS248 Midterm Mon, November 3, 7-9 pm, Gates B01 Mostly “short answer” questions – Keep your answers short and sweet! Covers lectures.
Graphics Output Primitives Pixel Addressing and Fill Area Dr. M. Al-Mulhem Feb. 1, 2008.
CS248 Midterm Review Michael Green and Sean Walker (based on the work of previous TAs)
CS 4731: Computer Graphics Lecture 22: Raster Graphics Part 3 Emmanuel Agu.
Aliasing and Anti-Aliasing Copyright Zachary Wartell, University of North Carolina at Charlotte, All Rights Reserved Revision: 10/24/2007 3:38:00 AM ©Zachary.
CAP4730: Computational Structures in Computer Graphics Chapter 3 Hearn & Baker Portions obtained from Leonard McMillan’s COMP136 Notes:
Vector vs. Bitmap SciVis V
V Obtained from a summer workshop in Guildford County July, 2014
TOPIC 4 PART III FILL AREA PRIMITIVES POLYGON FILL AREAS CGMB214: Introduction to Computer Graphics.
Image Processing 고려대학교 컴퓨터 그래픽스 연구실 cgvr.korea.ac.kr.
Computer Graphics Inf4/MSc Computer Graphics Lecture 9 Antialiasing, Texture Mapping.
March Shape Drawing Algorithms Shmuel Wimer Bar Ilan Univ., Engineering Faculty.
CGMB 314 Intro to Computer Graphics Fill Area Primitives.
Geometric Objects Computer Graphics Lab. Sun-Jeong Kim.
CGMB214: Introduction to Computer Graphics
IT- 601: Computer Graphics Lecture-03 Scan Conversion
Dr. S.M. Malaek Assistant: M. Younesi
Vector vs. Bitmap
Graphics Graphics Korea University cgvr.korea.ac.kr Raster Graphics 고려대학교 컴퓨터 그래픽스 연구실.
Computer Graphics An Introduction. What’s this course all about? 06/10/2015 Lecture 1 2 We will cover… Graphics programming and algorithms Graphics data.
1 JPEG v JPEG stands for Joint Photographic Experts Group v Superior for continuous tone, photographic color images not good on sharp-edges or flat-colornot.
10/26/04© University of Wisconsin, CS559 Fall 2004 Last Time Drawing lines Polygon fill rules Midterm Oct 28.
Digital Media Dr. Jim Rowan ITEC Vector Graphics Elegant way to construct digital images that –have a compact representation –are scalable –are.
1 Introduction Line attribute Color and gray scale Area filled attribute Anti-aliasing.
Week 6 - Wednesday.  What did we talk about last time?  Light  Material  Sensors.
CSE Real Time Rendering Week 2. Graphics Processing 2.
2D Output Primitives Points Lines Circles Ellipses Other curves Filling areas Text Patterns Polymarkers.
Image Processing Basics. What are images? An image is a 2-d rectilinear array of pixels.
1 Aliasing & Anti-Aliasing. 2 What is aliasing? An artifact (loss of detail and false details) Caused by discretization (finite resolution) A rasterized.
Digital Media Dr. Jim Rowan ITEC So far… We have compared bitmapped graphics and vector graphics We have discussed bitmapped images, some file formats.
Sang Il Park Sejong University
Computing & Information Sciences Kansas State University CIS 536/636 Introduction to Computer Graphics Lecture 8 of 41 William H. Hsu Department of Computing.
Computer Graphics Rendering 2D Geometry CO2409 Computer Graphics Week 2.
Attributes of Graphics Primitives Hearn & Baker Chapter 4 Some slides are taken from Robert Thomsons notes.
Lecture 6 Rasterisation, Antialiasing, Texture Mapping,
In the name of God Computer Graphics. Today Introduction Sampling Graphic Output Primitives 1.Line 2.Circle 3.Curve 4.polygon.
CISC 110 Day 3 Introduction to Computer Graphics.
Computer Graphics Filling. Filling Polygons So we can figure out how to draw lines and circles How do we go about drawing polygons? We use an incremental.
Digital Media Dr. Jim Rowan ITEC Vector Graphics Elegant way to construct digital images that –have a compact representation –are scalable –are.
1 Perception and VR MONT 104S, Fall 2008 Lecture 20 Computer Graphics and VR.
2D Output Primitives Points Lines Circles Ellipses Other curves Filling areas Text Patterns Polymarkers.
Lecture 15: Raster Graphics and Scan Conversion
Lecture 13: Raster Graphics and Scan Conversion
Guilford County SciVis V104.03
OUTPUT PRIMITIVES A.Aruna/Faculty of Information technology/SNSCE13/19/2016.
Attributes of Graphics Primitives Chapter 4
Lecture 30: Visible Surface Detection
Vector vs. Bitmap. Vector Images Vector images (also called outline images) are images made with lines, text, and shapes. Test type is considered to be.
CS552: Computer Graphics Lecture 16: Polygon Filling.
Attributes of Graphics Primitives Hearn & Baker Chapter 4
Computer Graphics Lecture 3 Computer Graphics Hardware
Computer Graphics Filling.
CSE 554 Lecture 1: Binary Pictures
Basic Raster Graphics Algorithms for Drawing 2D Primitives
Digital Media Dr. Jim Rowan ITEC 2110.
Primitive Drawing Algorithm
Basic Raster Graphics Algorithms for Drawing 2D Primitives
Primitive Drawing Algorithm
HSR & Scan conversion 신승영.
Presentation transcript:

CS552: Computer Graphics Lecture 17: Scan Conversion (Special Cases)

Recap Rasterization Scan converting geometric primitives o Lines o Circle o Ellipse Filling o Rectangle o Polygon o Scan line, seed fill, flood fill

Objective After completing this lecture students will be able to Describe the process of o Rendering characters o Patterning Explain the importance of o Antialiasing o Half toning o Dithering

Introduction The main aim of computer graphics is to o display an arbitrary surface so that it looks real. The first step toward this goal is an understanding of curves Once we have an algorithm to calculate and display any curve We may try to extend it to a surface.

Character Display Alphanumeric characters are written to the frame buffer using a mask. Mask is a small raster which contains o the relative locations of the pixels representing the character

The Mask It contains o Binary values indicating what a particular pixel in the mask represents  The character or symbol shape. 1 indicates that a pixel is used in the representation 0 indicates that it is the background For color displays additional bits are used for representation

Algorithm Mask insertion into the frame buffer Xmin, Xmax, Ymin, Ymax are the limits of the mask xo, yo is the location in the frame buffer 1.for j = Ymin to Ymax for i = Xmin to Xmax if Mask(i, j) <> 0 then 1.write Mask(i,j) to the frame buffer at (xo + i, yo + j) 2.end if 2.next i 2.next j 3.finish

Style and orientation

Aliasing effect A continuous signal is sampled at discreet points Those samples are then used to reconstruct a new signal, that is intended to represent the original signal The reconstructed signals are a false representation (alias) of the original signals In computer graphics usually results in visually distracting artifacts Antialiasing: to reduce the aliasing effect

Small Triangles Problem happens with very small triangles Pixel properties are determined at the center of the pixel This has the potential to miss small objects If we have small, moving triangles, they may cause pixels to flicker on and off as they cross the pixel centers A related problem can be seen when very thin triangles cause pixel gaps

Stairstepping The jagged right angle patterns we see at the edges of triangles? Known as the stairstepping problem, also affectionately known as “the jaggies” These can be visually distracting, especially for high contrast edges near horizontal or vertical Stairstepping is another form of aliasing

Antialiasing techniques Increase the sample rate o Super-sampling Consider pixels as a finite area rather than a point o Pre-filtering

Super-sampling Physical raster (original image), pseudo-raster (higher resolution) Pseudo-raster is superimposed on the physical raster. Entities of interest o Lines o Edges o Interiors

Straight Lines n n The intensity of the physical pixel is Proportional to the Ratio of the number of Activated subpixels to the Total number of possible activated subpixels in a physical pixel.

Alternate approach

Halftoning It is a technique for using a minimum number of intensity levels to obtain increased visual resolution

Halftoning patterns

Thank you Next Lecture: Representing curves