CSI 421: Computer Graphics

Slides:



Advertisements
Similar presentations
5.1 Si23_03 SI23 Introduction to Computer Graphics Lecture 5 – Drawing A Line.
Advertisements

CS 4731: Computer Graphics Lecture 20: Raster Graphics Part 1 Emmanuel Agu.
1 King ABDUL AZIZ University Faculty Of Computing and Information Technology CS 454 Computer graphics Drawing Elementary Figures Dr. Eng. Farag Elnagahy.
CS 450: COMPUTER GRAPHICS REVIEW: DRAWING LINES AND CIRCLES SPRING 2015 DR. MICHAEL J. REALE.
+ CPCS 391 Computer Graphics 1 Instructor: Dr. Sahar Shabanah Lecture 3.
Scan Conversion Algorithms
Group Teaching and Learning 3 extra points. Lecture 11  Group A: Line drawing – DDA algorithm – Midpoint algorithm – Bresenham’s line algorithm  Group.
Line Drawing Algorithms. Rasterization-Process of determining which pixels give the best approximation to a desired line on the screen. Scan Conversion-Digitizing.
Computer Graphics Lecture 3 Line & Circle Drawing.
30/9/2008Lecture 21 Computer Graphics Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD3107 University of Palestine.
Lecture 2 Line & Circle Drawing
The lines of this object appear continuous However, they are made of pixels 2April 13, 2015.
CS 352: Computer Graphics Chapter 7: The Rendering Pipeline.
© 2001 By Default! A Free sample background from Slide 1 Attributes of Output Primitives Definition Parameter that affects.
Raster conversion algorithms for line and circle
Output Primitives Computer Graphics.
CS5500 Computer Graphics © Chun-Fa Chang, Spring 2007 CS5500 Computer Graphics May 3, 2007.
Implementation III Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts University of New Mexico.
University of Missouri at Columbia 2D Scan-line Conversion University of Missouri at Columbia.
Course Website: Computer Graphics 5: Line Drawing Algorithms.
CS123 | INTRODUCTION TO COMPUTER GRAPHICS Andries van Dam © Scan Conversion CS123 1 of 44Scan Conversion - 10/14/2014.
Circle Drawing algo..
March Shape Drawing Algorithms Shmuel Wimer Bar Ilan Univ., Engineering Faculty.
Dr. Scott Schaefer Scan Conversion of Lines. 2/78 Displays – Cathode Ray Tube.
1/1/20001 Topic >>>> Scan Conversion CSE Computer Graphics.
Scan Conversion. Also known as rasterization In our programs objects are represented symbolically –3D coordinates representing an object’s position –Attributes.
IT- 601: Computer Graphics Lecture-03 Scan Conversion
Dr. S.M. Malaek Assistant: M. Younesi
Jehee Lee Seoul National University
Larry F. Hodges 1 Design of Line and Circle Algorithms.
Mr. G DP Physics Physics and Physical Measurement Topic 1.3 Mathematical and Graphical Techniques.
1Computer Graphics Implementation III Lecture 17 John Shearer Culture Lab – space 2
Introduction to Computer Graphics with WebGL
CS 480/680 Computer Graphics Implementation III Dr. Frederick C Harris, Jr. Fall 2011.
1 Introduction Line attribute Color and gray scale Area filled attribute Anti-aliasing.
Line Drawing and Generalization. Outline  overview  line drawing  circle drawing  curve drawing.
CGMB214: Introduction to Computer Graphics
 A line segment in a scene is defined by the coordinate positions of the line end-points x y (2, 2) (7, 5)
2D Output Primitives Points Lines Circles Ellipses Other curves Filling areas Text Patterns Polymarkers.
Chapter 3 Scan Conversion Lecture-02. Bresenham’s Line Algorithm Bresenham’s line algorithm – is a highly efficient incremental method for scan- converting.
1 Introduction to Computer Graphics with WebGL Ed Angel Professor Emeritus of Computer Science Founding Director, Arts, Research, Technology and Science.
Image Synthesis Rabie A. Ramadan, PhD 7. 2 Image Rasterization.
1 Aliasing & Anti-Aliasing. 2 What is aliasing? An artifact (loss of detail and false details) Caused by discretization (finite resolution) A rasterized.
Computer Graphics Rendering 2D Geometry CO2409 Computer Graphics Week 2.
1 CSCE 441 Lecture 2: Scan Conversion of Lines Jinxiang Chai.
GEOMETRY AND LINE GENERATION Geometry and Line Generation Chapter 2.
2D Output Primitives Points Lines Circles Ellipses Other curves Filling areas Text Patterns Polymarkers.
Institute for Visualization and Perception Research 1 © Copyright 2000 Haim Levkowitz Raster graphics alg’s for drawing 2D primitives Points of view Application.
Scan Conversion.
CS552: Computer Graphics Lecture 17: Scan Conversion (Special Cases)
Rasterization Overview Raster Display Device. Scan Conversion / Rasterization: converting vector graphics into raster graphics (determining pixels in.
Computer Graphics CC416 Lecture 04: Bresenham Line Algorithm & Mid-point circle algorithm Dr. Manal Helal – Fall 2014.
Computer Graphics Inf4/MSc Computer Graphics Lecture 4 Line & Circle Drawing.
Rasterization CENG 477 Introduction to Computer Graphics Slides from Steve Marschner, CS4620, 2008 Cornell University.
Computer Graphics I, Fall 2010 Scan conversion algorithms.
Rasterization, or “What is glBegin(GL_LINES) really doing?” Course web page: February 23, 2012  Lecture 4.
Line Drawing Algorithms 1. A line in Computer graphics is a portion of straight line that extends indefinitely in opposite direction. 2. It is defined.
Lecture 9 Line Drawing Algorithms (Bresenham’s Line Algorithm)
IT- 601: Computer Graphics Lecture-03 Scan Conversion
University of New Mexico
Implementation III.
Chapter Three Part I Output Primitives CS 380.
Scan Conversion of Lines
Introduction to Computer Graphics with WebGL
2D Scan-line Conversion
Rasterization and Antialiasing
Computer Graphics Implementation III
Rasterization and Antialiasing
Chapter 3 Graphics Output Primitives
Implementation III Ed Angel Professor Emeritus of Computer Science
Presentation transcript:

CSI 421: Computer Graphics CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com

CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com

CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com 3

CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com

CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com

CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com

CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com

CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com

CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com

CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com 10

MNE P=(xp, yp) is pixel chosen by the algorithm in previous step To calculate d incrementally we require dne w If d > 0 then choose NE If d < 0 then choose E ( x + 1, y + ) ( x + 2, y + 3 ) p 2 1 p 2 MNE NE M yp E P=(xp, yp) xp xp+1 xp+2 Previous Current Next CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com

CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com

CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com

CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com

CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com

CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com

CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com

CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com

CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com

The most common side effects when working with raster devices are: Aliasing Unequal intensity Overstrike Picket fence problem CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com

Consider equation y = mx + b For m = 0.5, b = 1 and x = 3 : y = 2.5 Refers to the plotting of a point in a location other than its true location in order to fit the point into the raster. Consider equation y = mx + b For m = 0.5, b = 1 and x = 3 : y = 2.5 So the point (3,2.5) is plotted at alias location (3,3) Remedy Apply anti-aliasing algorithms. Most of these algorithms introduce extra pixels and pixels are intensified proportional to the area of that pixel covered by the object. CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com

CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com

Human perception of light is dependent on Density and Intensity of light source. 1 Thus, on a raster display with perfect squareness, a diagonal line of pixels will appear dimmer that a horizontal or vertical line. Remedy If speed of scan conversion is main then ignore By increasing the number of pixels in diagonal lines By increasing the intensity of pixels on diagonal lines. CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com

The same pixel is written more than once. This results in intensified pixels in case of photographic media, such as slide or transparency Remedy Check each pixel to see whether it has already been written to prior to writing a new point. CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com

Occurs when a user attempts to scan-convert an object that will not fit exactly in the raster. Original Object Local aliasing Global aliasing Remedy Local Aliasing: the distances between pickets in the picket fence will be kept as close to their true relative distance as possible Global Aliasing: the overall length of the picket fence will be approximately correct by the spacing between pickets will be distorted. CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com

Must Read: Optional: References: •Ellipse: Scan conversion •Region filling algorithms •Point conversion •DDA algorithm •Bresenham’s Algorithm •Solved problems (3.1-3.7) References: Text book – chapter 3 Wikipedia and google with topic name http://classes.cec.wustl.edu/~cse452/lectures/lect02_ScanConvert_2pp.pdf CSI 421: Computer Graphics | saleh.sabbir.aiub@gmail.com