Presentation is loading. Please wait.

Presentation is loading. Please wait.

©College of Computer and Information Science, Northeastern UniversityFebruary 25, 20161 CS G140 Graduate Computer Graphics Prof. Harriet Fell Spring 2009.

Published byMarlene Alexander Modified over 8 years ago

Similar presentations

Presentation on theme: "©College of Computer and Information Science, Northeastern UniversityFebruary 25, 20161 CS G140 Graduate Computer Graphics Prof. Harriet Fell Spring 2009."— Presentation transcript:

1 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 20161 CS G140 Graduate Computer Graphics Prof. Harriet Fell Spring 2009 Lecture 1 - January 7, 2009

2 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 20162 Course Overview - Topics Emphasis on rendering realistic images. Fundamentals of 2- and 3- dimensional computer graphics –2-dimensional algorithms for drawing lines and curves, anti-aliasing, filling, and clipping –Using ray-tracing to render 3-dimensional scenes composed of spheres, polygons, quadric surfaces, and bi- cubic surfaces –Techniques for adding texture to surfaces using texture and bump maps, noise, and turbulence Other topics as time permits

3 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 20163 Sample Images

4 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 20164 Sample Images

5 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 20165 Sample Images

6 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 20166 Sample Images

7 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 20167 Sample Images

8 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 20168 Course Overview - Organization Texts: –Peter Shirley, et al. Fundamentals of Computer Graphics, 2nd Edition, A K Peters, 2005 –Alan Watt, 3D Computer Graphics, 3rd Edition, Addison Wesley, 1999. Grading –Assignment 0: 10% –Assignment 1: 15% –Assignment 2: 15% –Assignment 3: 10% –Assignment 4: 10% –Exam: 25% –Project and Presentation: 15%

9 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 20169 Early HistoryHistory http://accad.osu.edu/~waynec/history/timeline.html http://sophia.javeriana.edu.co/~ochavarr/computer_graphics_history/historia/ 1801 Joseph-Marie Jacquard invented an automatic loom using punched cards to control patterns in the fabrics. The introduction of these looms caused the riots against the replacement of people by machines.loom 1941 First U.S. regular TV broadcast,TV broadcast 1st TV commercial (for Bulova watches) 1948 Transistors 1949 Williams tube (CRT storage tube)

10 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201610 Jacquard Loom From Wikipedia.org

11 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201611 Early TV

12 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201612 HistoryHistory – the 50s 1951 Graphics display, Whirlwind computerGraphics display, Whirlwind computer 1954 color TV 1955 Light Pen, SAGE- Lincoln LabLight Pen, SAGE- Lincoln Lab 1958 Graphics Console, TX-1 MIT 1958 John Whitney Sr. uses analogJohn Whitney Sr. computer to make art

13 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201613 1951 Graphics display, Whirlwind computer

14 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201614 SAGE

15 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201615 John Whitney Sr. 1958 CG Vertigo Start Titles

16 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201616 HistoryHistory - the 60s 1961 Spacewars, 1st video game, Steve Russell, MIT for PDP-1Spacewars 1963 Sketchpad, Ivan Sutherland, MITSketchpad, Ivan Sutherland 1963 Mouse invented, Doug Englebart, SRI 1963 Roberts hidden line algorithm, MITRoberts hidden line algorithm 1965 Bresenham Algorithm for plotting lines, IBMBresenham Algorithm for plotting lines 1966 Odyssey, home video game, Ralph Baer,Odyssey –Sanders Assoc, is 1st consumer CG product 1967 Full-color, real-time, interactive flight simulator for NASA - Rod Rougelet, GE

17 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201617 Spacewars

18 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201618 Ivan Sutherland & Sketchpad System on TX-2 at MIT(1963)

19 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201619 Odyssey http://www.geekcomix.com/vgh/first/odyssey.shtml

20 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201620 Roberts Hidden Line Algorithm Block scene (576 blocks)

21 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201621 Bresenham Line Algorithm (0, 0) (9, 7)

22 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201622 HistoryHistory – the 70s 1970sUtah dominated - algorithm development 1970 Watkins algorithm for visible surfacesWatkins algorithm for visible surfaces 1970 Bezier free-form curve representationBezier free-form curve 1971 Gouraud shadingGouraud shading 1973 Principles of Interactive Computer Graphics (Newman and Sproull) 1974 Addressable cursor in a graphics display terminal - DEC VT52 1974 z-buffer developed by Ed Catmull (Univ of Utah) 1975 Phong shadingPhong shading 1975 Fractals - Benoit Mandelbrot (IBM)Fractals 1978 Bump mapping, BlinnBump mapping 1979 George Lucas starts Lucasfilm –with Ed Catmull, Ralph Guggenheim, and Alvy Ray Smith

23 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201623 Watkins Scan-Line Algorithm

24 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201624 Bezier Curves

25 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201625 Gouraud Shading http://freespace.virgin.net/hugo.elias/graphics/x_polygo.htm

26 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201626 Phong Shading

27 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201627 Fractals

28 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201628 Bump Map Bump Maps in PovRay

29 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201629 HistoryHistory - the 80s 1980s Cheaper machines, memory - quest for realsim 1980 Ray Tracing, Turner Whitted, Bell LabsRay Tracing 1981 IBM introduces the first IBM PC (16 bit 8088 chip) 1982 Data Glove, Atari 1984 Macintosh computerMacintosh – introduced with Clio award winning commercial during Super Bowl 1985 Perlin NoisePerlin Noise 1986 GIF format (CompuServe) 1988 Who Framed Roger Rabbit live action & animationWho Framed Roger Rabbit

30 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201630 Whitted Ray-Tracing http://en.wikipedia.org/wiki/Ray_tracing

31 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201631 Perlin Noise

32 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201632 Who Framed Roger Rabbit

33 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201633 HistoryHistory- the 90s 1990s Visualization, Multimedia, the Net 1991 JPEG/MPEG 1993 Myst, CyanMyst 1994 U.S. Patent to Pixar –for creating, manipulating and displaying images 1995 Toy Story, PixarToy Story 1995 Internet 2 unveiled 1997 DVD technology unveiled 1998 XML standard 1999 deaths

34 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201634 Myst

35 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201635 Toy Story

36 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201636 Recent History 2000s Virtual Reality, Animation Reality 2001 Significant Movies –Final Fantasy, Square) –Monsters Inc, Pixar –Harry Potter, A.I., Lord of the Rings, Shrek, PDI –The Mummy, ILM –Tomb Raider, Cinesite –Jurassic Park III, Pearl Harbor,ILM –Planet of the Apes, Asylum 2001 Microsoft xBox and Nintendo Gamecube 2001, 2002, 2003 Lord of the RingsLord of the Rings

37 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201637 from Lord of the RingsLord of the Rings Motion Capture Technology –Andy Serkis "played" Gollum by providing his voice and movements on set, as well as performing within a motion capture suit. SKIN –Christoper Hery, Ken McGaugh and Joe Letteri received a 2003 Academy Award, Scientific or Technical for implementing the BSSRDF (Bidirectional Surface Scattering Reflection Distribution Function) technique used for Gollum's skin in a production environment. Henrik Wann Jensen, Stephen Robert Marschner, and Pat Hanrahan, who developed BSSRDF, won another the same year. MASSIVE –a computer program developed by WETA to create automatic battle sequences rather than individually animate every soldier. Stephen Regelous developed the system in 1996, originally to create crowd scenes in King Kong.

38 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201638 Time for a Break

39 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201639 Color www.thestagecrew.com

40 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201640 Red, Green, and Blue Light

41 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201641 Adding R, G, and B Values http://en.wikipedia.org/wiki/RGB

42 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201642 From the Hubble Hubble Site Link

43 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201643 RGB Color Cube (1, 1, 1) (1, 1, 0) (0, 0, 1) (0, 1, 1) (0, 1, 0) (1, 0, 1) (1, 0, 0)

44 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201644 RGB Color Cube The Dark Side (0, 0, 0) (1, 1, 0) (0, 0, 1) (0, 1, 1) (0, 1, 0) (1, 0, 1) (1, 0, 0)

45 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201645 Doug JacobsonDoug Jacobson's RGB Hex Triplet Color Chart

46 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201646 Making Colors Darker (1, 0, 0) (0, 1, 0) (0, 0, 1) (1, 1, 0) (1, 0, 1) (1, 1, 0) (0, 0, 0) (.5, 0, 0) (0, 0,.5) (0,.5,.5) (.5, 0,.5) (.5,.5, 0) (0,.5, 0)

47 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201647 Getting Darker, Left to Right for (int b = 255; b >= 0; b--){ c = new Color(b, 0, 0); g.setPaint(c); g.fillRect(800+3*(255-b), 50, 3, 150); c = new Color(0, b, 0); g.setPaint(c); g.fillRect(800+3*(255-b), 200, 3, 150); c = new Color(0, 0, b); g.setPaint(c); g.fillRect(800+3*(255-b), 350, 3, 150); c = new Color(0, b, b); g.setPaint(c); g.fillRect(800+3*(255-b), 500, 3, 150); c = new Color(b, 0, b); g.setPaint(c); g.fillRect(800+3*(255-b), 650, 3, 150); c = new Color(b, b, 0); g.setPaint(c); g.fillRect(800+3*(255-b), 800, 3, 150); }

48 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201648 Gamma Correction Generally, the displayed intensity is not linear in the input (0  a  1). dispIntensity = (maxIntensity) a  To find  –Find a that gives you.5 intensity –Solve.5 = a  –  = ln(.5) ln( a)

49 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201649 Gamma Correction Gamma half black half red (127, 0, 0)

50 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201650 Making Pale Colors (1, 0, 0) (0, 1, 0) (0, 0, 1) (1, 1, 0) (1, 0, 1) (1, 1, 0) (1, 1, 1) (1,.5,.5) (.5,.5, 1) (.5, 1, 1) (1,.5, 1) (1, 1,.5) (.5, 1,.5)

51 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201651 Getting Paler, Left to Right for (int w = 0; w < 256; w++){ c = new Color(255, w, w); g.setPaint(c); g.fillRect(3*w, 50, 3, 150); c = new Color(w, 255, w); g.setPaint(c); g.fillRect(3*w, 200, 3, 150); c = new Color(w, w, 255); g.setPaint(c); g.fillRect(3*w, 350, 3, 150); c = new Color(w, 255, 255); g.setPaint(c); g.fillRect(3*w, 500, 3, 150); c = new Color(255,w, 255); g.setPaint(c); g.fillRect(3*w, 650, 3, 150); c = new Color(255, 255, w); g.setPaint(c); g.fillRect(3*w, 800, 3, 150); }

52 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201652 Portable Pixmap Format (ppm) A "magic number" for identifying the file type. A ppm file's magic number is the two characters "P3". Whitespace (blanks, TABs, CRs, LFs). A width, formatted as ASCII characters in decimal. Whitespace. A height, again in ASCII decimal. Whitespace. The maximum color value again in ASCII decimal. Whitespace. Width * height pixels, each 3 values between 0 and maximum value. –start at top-left corner; proceed in normal English reading order –three values for each pixel for red, green, and blue, resp. –0 means color is off; maximum value means color is maxxed out –characters from "#" to end-of-line are ignored (comments) –no line should be longer than 70 characters

53 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201653 ppm Example P3 # feep.ppm 4 15 0 0 0 0 0 0 0 0 0 15 0 15 0 0 0 0 15 7 0 0 0 0 0 0 0 0 0 0 0 0 0 15 7 0 0 0 15 0 15 0 0 0 0 0 0 0 0 0

54 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201654 private void saveImage() { String outFileName = “my.ppm"; File outFile = new File(outFileName); int clrR, clrG, clrB; try { PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter(outFile))); out.println("P3"); out.print(Integer.toString(xmax-xmin+1)); System.out.println(xmax-xmin+1); out.print(" "); out.println(Integer.toString(ymax-ymin+1)); System.out.println(ymax-ymin+1); out.println("255"); for (int y = ymin; y <= ymax; y++){ for (int x = xmin; x <= xmax; x++) { // compute clrR, clrG, clrB out.print(" "); out.print(clrR); out.print(" "); out.print(clrG); out.print(" "); out.println(clrB); } out.close(); } catch (IOException e) { System.out.println(e.toString()); }

55 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201655 Math Basics (All Readings from Shirley) Sets and Mappings – 2.1 Quadratic Equations – 2.2 Trigonometry – 2.3 Vectors – 2.4 2D Parametric Curves – 2.6 3D Parametric Curves – 2.8 Linear Interpolation – 2.10 Triangles – 2.11

56 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201656 Vectors A vector describes a length and a direction. a b a = b a zero length vector 1 a unit vector

57 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201657 Vector Operations a a b b b+a -d c-d Vector Sum a -a c Vector Difference d

58 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201658 Cartesian Coordinates Any two non-zero, non-parallel 2D vectors form a 2D basis. Any 2D vector can be written uniquely as a linear combination of two 2D basis vectors. x and y (or i and j) denote unit vectors parallel to the x-axis and y-axis. x and y form an orthonormal 2D basis. a = x a x + y a y a =( x a, y a ) or x, y and z form an orthonormal 3D basis. or a =(a x,a y )

59 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201659 Vector Length Vector a =( x a, y a ) yaya xaxa ||a|| a

60 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201660 Dot Product a =( x a, y a ) b =( x b, y b ) a  b = x a x b + y a y b a  b = || a ||  || b || cos(  ) a b   x a = ||a||cos(  +  ) x b = ||b||cos(  ) y a = ||a||sin(  +  ) y b = ||b||sin(  )

61 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201661 Projection a =( x a, y a ) b =( x b, y b ) a  b = ||a||  ||b||cos(  ) The length of the projection of a onto b is given by a b  abab

62 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201662 3D Vectors This all holds for 3D vectors too. a =( x a, y a, z a ) b =( x b, y b, z b ) a  b = x a x b + y a y b + z a z b a  b = ||a||  ||b|| cos (  )

63 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201663 Vector Cross Product axb a b  axb is perpendicular to a and b. Use the right hand rule to determine the direction of axb. Image from www.physics.udel.edu

64 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201664 Cross Product and Area axb a b  a b  ||a|| ||a||x||b|| = area of the parallelogram.

65 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201665 Computing the Cross Product

66 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201666 Linear Interpolation LERP: /lerp/, vi.,n. –Quasi-acronym for Linear Interpolation, used as a verb or noun for the operation. “Bresenham's algorithm lerps incrementally between the two endpoints of the line.” p = (1 – t) a + t b = a + t(b – a) a b L tL (1-t)L

67 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201667 b a L p = (1 – t) a + t b = a + t(b – a) t =.5 t = 1 t =.25 t =.75 t = 0

68 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201668 If (x, y) is on the edge ab, (x, y) = (1 – t) a + t b = a + t(b – a). Similar formulas hold for points on the other edges. If (x, y) is in the triangle: (x, y) =  a +  b +  c  +  +  = 1 ( , ,  ) are the Barycentric coordinates of (x, y). Triangles a b c (x,y)

69 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201669 Triangles a b c b-a c-a p = a +  (b-a) +  (c-a)  = 0  = 1  = 2  = -1  = 0  = 1  = 2  = -1 Barycentric coordinates  = 1-  -  p = p( , ,  ) =  a +  b +  c  = 0 p = (1-  -  )a +  b +  c  = 1

70 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201670 Computing Barycentric Coordinates a b c (x,y)

71 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201671 Barycentric Coordinates as Areas a b c (x,y) where A is the area of the triangle.  +  +  = 1

72 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201672 3D Triangles b c (x,y,z) where A is the area of the triangle.  +  +  = 1 This all still works in 3D. a

73 ©College of Computer and Information Science, Northeastern UniversityFebruary 25, 201673 Assignment 0 You will choose a programming platform for the quarter and familiarize yourself with RGB color and the ppm format. In part, this assignment is to ensure that you have a method of submitting you work so that I can: –read the code –compile (or interpret) the code –run the code to produce a file in ppm format. Sample Program You will write your own 3D vector tools (e.g. as a JAVA class) that you will use for your later programming assignments.

Download ppt "©College of Computer and Information Science, Northeastern UniversityFebruary 25, 20161 CS G140 Graduate Computer Graphics Prof. Harriet Fell Spring 2009."

Similar presentations

Short History of Computer Graphics. Early 60's: – Computer animations for physical simulation; Edward Zajac displays satellite research using CG in 1961.

Short History of Computer Graphics. Early 60's: – Computer animations for physical simulation; Edward Zajac displays satellite research using CG in 1961.
Ray tracing. New Concepts The recursive ray tracing algorithm Generating eye rays Non Real-time rendering.

Ray tracing. New Concepts The recursive ray tracing algorithm Generating eye rays Non Real-time rendering.
©College of Computer and Information Science, Northeastern UniversityApril 22, 20151 CS U540 Computer Graphics Prof. Harriet Fell Spring 2009 Lecture 4.

©College of Computer and Information Science, Northeastern UniversityApril 22, CS U540 Computer Graphics Prof. Harriet Fell Spring 2009 Lecture 4.
CP411 Computer Graphics, Wilfrid Laurier University Introduction # 1 Welcome to CP411 Computer Graphics 2012 Instructor: Dr. Hongbing Fan Introduction.

CP411 Computer Graphics, Wilfrid Laurier University Introduction # 1 Welcome to CP411 Computer Graphics 2012 Instructor: Dr. Hongbing Fan Introduction.
3D Graphics Rendering and Terrain Modeling

3D Graphics Rendering and Terrain Modeling
 Engineering Graphics & Introductory Design 3D Graphics and Rendering REU Modeling Course – June 13 th 2014.

 Engineering Graphics & Introductory Design 3D Graphics and Rendering REU Modeling Course – June 13 th 2014.
Computer Graphics (Fall 2005) COMS 4160, Lecture 16: Illumination and Shading 1

Computer Graphics (Fall 2005) COMS 4160, Lecture 16: Illumination and Shading 1
Computer Graphics (Fall 2008) COMS 4160, Lecture 1: Overview and History Ravi Ramamoorthi

Computer Graphics (Fall 2008) COMS 4160, Lecture 1: Overview and History Ravi Ramamoorthi
History of computer graphics CS 248 - Introduction to Computer Graphics Autumn quarter, 2000 Slides for September 28 lecture.

History of computer graphics CS Introduction to Computer Graphics Autumn quarter, 2000 Slides for September 28 lecture.
Computer Graphics (Fall 2004) COMS 4160, Lecture 1: Overview and History Ravi Ramamoorthi

Computer Graphics (Fall 2004) COMS 4160, Lecture 1: Overview and History Ravi Ramamoorthi
 Marc Levoy History of computer graphics CS 248 - Introduction to Computer Graphics Autumn quarter, 2003 Slides for September 25 lecture.

 Marc Levoy History of computer graphics CS Introduction to Computer Graphics Autumn quarter, 2003 Slides for September 25 lecture.
 Marc Levoy Choosing the right course CS 148 Winter, Hanrahan, not SCPD undergraduates only requires 107 terminal course broad and conceptual CS.

 Marc Levoy Choosing the right course CS 148 Winter, Hanrahan, not SCPD undergraduates only requires 107 terminal course broad and conceptual CS.
 Marc Levoy History of computer graphics CS 248 - Introduction to Computer Graphics Autumn quarter, 2001 Slides for September 27 lecture.

 Marc Levoy History of computer graphics CS Introduction to Computer Graphics Autumn quarter, 2001 Slides for September 27 lecture.
Foundations of Computer Graphics (Spring 2010) CS 184, Lecture 1: Overview and History Ravi Ramamoorthi

Foundations of Computer Graphics (Spring 2010) CS 184, Lecture 1: Overview and History Ravi Ramamoorthi
CIS 581 Interactive Computer Graphics (slides based on Dr. Han-Wei Shen’s slides) Instructor: Rick Parent Credit: 4 Class: MWF 10:30.

CIS 581 Interactive Computer Graphics (slides based on Dr. Han-Wei Shen’s slides) Instructor: Rick Parent Credit: 4 Class: MWF 10:30.
©College of Computer and Information Science, Northeastern UniversityAugust 10, 20151 CS 4300 Computer Graphics Prof. Harriet Fell Fall 2012 Lecture 1.

©College of Computer and Information Science, Northeastern UniversityAugust 10, CS 4300 Computer Graphics Prof. Harriet Fell Fall 2012 Lecture 1.
Advanced Computer Graphics Spring-2011 Kocaeli University Computer Engineering Department.

Advanced Computer Graphics Spring-2011 Kocaeli University Computer Engineering Department.
Cornell CS465 Fall 2004 Lecture 1© 2004 Steve Marschner 1 CS465: Computer Graphics I Professor: Steve Marschner.

Cornell CS465 Fall 2004 Lecture 1© 2004 Steve Marschner 1 CS465: Computer Graphics I Professor: Steve Marschner.
CS-557 Gregory Dudek CD Contents. CS-557 Gregory Dudek Course description Lecture schedule by week 1997 Image Gallery Assignments Page Morphing Notes.

CS-557 Gregory Dudek CD Contents. CS-557 Gregory Dudek Course description Lecture schedule by week 1997 Image Gallery Assignments Page Morphing Notes.
Polygon Shading. Assigning color to a shape to make graphical scenes look realistic, or artistic, or whatever effect we’re attempting to achieve But first.

Polygon Shading. Assigning color to a shape to make graphical scenes look realistic, or artistic, or whatever effect we’re attempting to achieve But first.

Similar presentations

Ads by Google