Introduction to Computer Graphics

Slides:



Advertisements
Similar presentations
Computer Graphics- SCC 342
Advertisements

CS 4731: Computer Graphics Lecture 20: Raster Graphics Part 1 Emmanuel Agu.
Basic Raster Graphics Algorithms for Drawing 2D Primitives
Scan conversion of Line , circle & ellipse
30/9/2008Lecture 21 Computer Graphics Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD3107 University of Palestine.
Advanced Manufacturing Laboratory Department of Industrial Engineering Sharif University of Technology Session # 6.
Computer Graphics Tz-Huan Huang National Taiwan University (Slides are based on Prof. Chen’s)
Advanced Manufacturing Laboratory Department of Industrial Engineering Sharif University of Technology Session # 7.
OUTPUT PRIMITIVES Screen vs. World coordinate systems ● Objects positions are specified in a Cartesian coordinate system called World Coordinate.
CS 450: COMPUTER GRAPHICS FILLING POLYGONS SPRING 2015 DR. MICHAEL J. REALE.
CS 352: Computer Graphics Chapter 7: The Rendering Pipeline.
Raster conversion algorithms for line and circle
Output Primitives Computer Graphics.
Implementation Dr. Amy Zhang. Reading 2  Hill, Chapters  Hill, Chapter 10.
CS5500 Computer Graphics © Chun-Fa Chang, Spring 2007 CS5500 Computer Graphics May 3, 2007.
Course Overview, Introduction to CG Glenn G. Chappell U. of Alaska Fairbanks CS 381 Lecture Notes Friday, September 5, 2003.
Dr. S.M. Malaek Assistant: M. Younesi
Jehee Lee Seoul National University
1 CPE 333 : Computer Graphics มหาวิทยาลัยเทคโนโลยีพระจอม เกล้าธนบุรี Dr. Natasha Dejdumrong.
Graphics Graphics Korea University cgvr.korea.ac.kr Raster Graphics 고려대학교 컴퓨터 그래픽스 연구실.
Graphics Pipeline Rasterization CMSC 435/634. Drawing Terms Primitive – Basic shape, drawn directly – Compare to building from simpler shapes Rasterization.
Triangle Scan Conversion. 2 Angel: Interactive Computer Graphics 5E © Addison-Wesley 2009 Rasterization Rasterization (scan conversion) –Determine which.
Introduction to Computer Graphics PPT2: Graphics Output Primitives
CGMB214: Introduction to Computer Graphics
Computer Graphics Chapter 6 Andreas Savva. 2 Interactive Graphics Graphics provides one of the most natural means of communicating with a computer. Interactive.
Image Synthesis Rabie A. Ramadan, PhD 7. 2 Image Rasterization.
1 CSCE 441 Lecture 2: Scan Conversion of Lines Jinxiang Chai.
In the name of God Computer Graphics. Today Introduction Sampling Graphic Output Primitives 1.Line 2.Circle 3.Curve 4.polygon.
Graphics Pipeline Rasterization CMSC 435/634. Drawing Terms Primitive – Basic shape, drawn directly – Compare to building from simpler shapes Rasterization.
Lecture 13: Raster Graphics and Scan Conversion
OUTPUT PRIMITIVES A.Aruna/Faculty of Information technology/SNSCE13/19/2016.
Lecture 2: 19/4/1435 Graphical algorithms Lecturer/ Kawther Abas CS- 375 Graphics and Human Computer Interaction.
Rasterization CENG 477 Introduction to Computer Graphics Slides from Steve Marschner, CS4620, 2008 Cornell University.
Scan Conversion of Line Segments. What is Scan conversion? Final step of rasterization (the process of taking geometric shapes and converting them into.
Chapter 71 Computer Graphics - Chapter 7 From Vertices to Fragments Objectives are: How your program are processed by the system that you are using, Learning.
OUTPUT PRIMITIVES CEng 477 Computer Graphics METU, 2004.
Computer Graphics Drawing Line.
CSCE 441 Lecture 2: Scan Conversion of Lines
Computer graphics 2D graphics.
Photorealistic Rendering vs. Interactive 3D Graphics
CS 4731: Computer Graphics Lecture 20: Raster Graphics Part 1
CSCE 441 Lecture 2: Scan Conversion of Lines
Introduction to Computer Graphics
Introduction to Computer Graphics
PPT and video are due: no later than November 16, 5:00 PM
PPT9: Asserting expectations
PPT6: Scientific debugging
CSCE 441 Computer Graphics: Clipping Polygons Jinxiang Chai
PPT1: Basics of software engineering
PPT and video are due no later than February 15, 2019
PPT4: Rational B-spline Curves and Surfaces
PPT12: Shape Modification Tools
PPT3: Project planning and management
PPT3: B-spline Curves and Surfaces
PPT6: Advanced Geometric Algorithms
PPT9: Global and local interpolation
PPT7: Conics and Circles
PPT2: B-spline Basics Functions
PPT4: Requirement analysis
PPT8: Common Surfaces as NURBS
PPT6: Object-oriented design
PPT and video are due no later than March 1, 2019
PPT and video are due no later than March 22, 2019
PPT11: Advanced Surface Construction Techniques
PPT and video are due no later than March 29, 2019
PPT11: System maintenance
PPT10: Global and local approximation
PPT5: Fundamental Geometric Algorithms
Clipping University of British Columbia CPSC 314 Computer Graphics
OUTPUT PRIMITIVES / DISPLAY TECHNIQUES
Presentation transcript:

Introduction to Computer Graphics EEL 5771-001 Introduction to Computer Graphics PPT2: Graphics Output Primitives PPT and video are due : no later than September 7, 5:00 PM Submit to: lpiegl@gmail.com This template file is just an outline of the presentation that you need to complete. Additional pages will be necessary to fully explore the topic above. Each page should contain adequate text as well as illustrations. You are free to use all publically available information (text as well as graphics) as long as the sources are properly acknowledged.

Team members’ contributions Member [name]:

Coordinate Frames Content outline: Coordinate frames, screen coordinates Graphics programing: points and lines

Line Drawing Algorithms Content outline: Line drawing principles The math behind a simple line drawing algorithm

Line Drawing Algorithms Content outline: The digital differential analyzer (DDA) algorithm The principle and pseudo-code

Line Drawing Algorithms Content outline: Bresenham’s algorithm The principle The math The pseudo-code Detailed example

Line Drawing Algorithms Content outline: Pixel addressing General addressing, addressing for x/y increment

Line Drawing Algorithms: Order Dependence Content outline: The problem of order dependence Possible solutions

Line Drawing Algorithms Content outline: The problem of clipping Side and bottom clipping

Line Drawing Algorithms Content outline: The problem of intensity as the function of the slope Potential solutions

Circle Algorithms Content outline: Circle algorithms via polygonal approximation Circle algorithms via implicit functions

Circle Algorithms Content outline: Circle raster (integer) algorithms Extension of Bresenham’s line algorithm The math The code Worked example

Ellipse Algorithms Content outline: Ellipse raster (integer) algorithms Extension of Bresenham’s line algorithm The math The code Worked example

Pixel Addressing Content outline: Pixel addressing for lines Mathematical vs. raster lines

Pixel Addressing Content outline: Pixel addressing for rectangles Graphics convention in rectangle drawing

Pixel Addressing Content outline: Pixel addressing for circles/ellipses Graphics convention in circle drawing

Area Fill Methods Content outline: Concave and convex polygons Polygon split

Area Fill Methods Content outline: Area fill with Boolean operation Data structure for polygonal objects

Plane Equations Content outline: General implicit form Three-point form Fitting to a random data set via the eingen-vector method

OpenGL Area Fill Content outline: Polygons, triangles, strips Quads and quad strips

Vertex Arrays Content outline: Data structure for vertex arrays Sample code for polygonal objects

Pixel Array Primitives Content outline: Bitmaps and pixmaps Storage in hardware

Pixel Array Primitives Content outline: Bit-shape representations Code segment for storage and application

Pixel Array Primitives Content outline: Pixel drawing Double buffering Buffers for stereo imaging

Character Handling Content outline: Bitmap characters Stroke characters