1 91.427 Computer Graphics I, Fall 2010 Building Models.

Slides:



Advertisements
Similar presentations
1Computer Graphics Building Models John Shearer Culture Lab – space 2
Advertisements

OpenGL: Simple Use Open a window and attach OpenGL to it Set projection parameters (e.g., field of view) Setup lighting, if any Main rendering loop –Set.
COMP 175 | COMPUTER GRAPHICS Remco Chang1/6103b – Shapes Lecture 03b: Shapes COMP 175: Computer Graphics February 3, 2015.
CMPE 466 COMPUTER GRAPHICS
CS 450: COMPUTER GRAPHICS FILLING POLYGONS SPRING 2015 DR. MICHAEL J. REALE.
1 Angel: Interactive Computer Graphics 4E © Addison-Wesley 2005 Building Models modified by Ray Wisman Ed Angel Professor of Computer Science,
1 Building Models. 2 Objectives Introduce simple data structures for building polygonal models ­Vertex lists ­Edge lists OpenGL vertex arrays.
3D Game Programming Geometric Transformations
David Luebke5/16/2015 Administrivia l Back on track: canceling OpenGL lecture 2 l Assignment 1 –Greg Yukl found an alternate XForms site:
Informationsteknologi Wednesday, November 7, 2007Computer Graphics - Class 51 Today’s class Geometric objects and transformations.
 The success of GL lead to OpenGL (1992), a platform-independent API that was  Easy to use  Close enough to the hardware to get excellent performance.
Drawing Geometric Objects
Computer Graphics Ben-Gurion University of the Negev Fall 2012.
CENG 789 – Digital Geometry Processing 02- Mesh Data Structures Asst. Prof. Yusuf Sahillioğlu Computer Eng. Dept,, Turkey.
CS-321 Dr. Mark L. Hornick 1 3-D Object Modeling.
Geometric Objects and Transformation
Modeling. Geometric Models  2D and 3D objects  Triangles, quadrilaterals, polygons  Spheres, cones, boxes  Surface characteristics  Color  Texture.
CS559: Computer Graphics Lecture 33: Shape Modeling Li Zhang Spring 2008.
Fundamentals of Computer Graphics Part 4
Drawing Basic Graphics Primitives Lecture 4 Wed, Sep 3, 2003.
Triangulation Introduction to Computer Graphics and Animation (Principle of Computer Graphics) Rattapoom Waranusast.
Speeding Up Rendering After Deciding What to Draw.
Graphics Systems and OpenGL. Business of Generating Images Images are made up of pixels.
Interactive Computer Graphics CS 418 – Spring 2015 Mesh Rendering, Transformation, Camera Viewing and Projection in OpenGL TA: Zhicheng Yan Sushma S Kini.
State Management and Drawing Geometry Objects
Geometric Objects and Transformation
Representation. Objectives Introduce concepts such as dimension and basis Introduce coordinate systems for representing vectors spaces and frames for.
Viewing and Projection. 2 3 Angel: Interactive Computer Graphics 5E © Addison-Wesley 2009  Introduce the classical views  Compare and contrast image.
Jul 25, 2014IAT 3551 Scene Graphs.  A data structure that stores information about a graphics scene –Each node has information that structures the interpretation.
Computer Graphics Basic 3D Geometry CO2409 Computer Graphics Week 5-1.
Objectives Introduce simple data structures for building polygonal models -- Vertex lists and Edge lists Introduce simple data structures for building.
Computer Graphics I, Fall 2010 Programming with OpenGL Part 3: Three Dimensions.
Geometric Objects and Transformations
1 3D API OPENGL ES v1.0 Owned by Silicon Graphics (SGL) Control was then transferred to Khronos Group Introduction.
3D Programming and Viewing Week 3 David Breen Department of Computer Science Drexel University Based on material from Ed Angel, University of New Mexico.
Intro to OpenGL: Vertices and Drawing
1 Building Models Ed Angel Professor Emeritus of Computer Science University of New Mexico Angel and Shreiner: Interactive Computer Graphics 7E © Addison-Wesley.
UniS CS297 Graphics with Java and OpenGL State Management and Drawing Primative Geometric Objects.
Color and Color Models Angel 2.5 Angel: Interactive Computer Graphics5E © Addison-Wesley
OpenGL Vertex Arrays OpenGL vertex arrays store vertex properties such as coordinates, normal vectors, color values and texture coordinates. These properties.
1 Angel: Interactive Computer Graphics 4E © Addison-Wesley 2005 Programming with OpenGL Part 3: Three Dimensions Ed Angel Professor of Computer Science,
C O M P U T E R G R A P H I C S Guoying Zhao 1 / 73 C O M P U T E R G R A P H I C S Guoying Zhao 1 / 73 Computer Graphics Three-Dimensional Graphics II.
11/16/04© University of Wisconsin, CS559 Fall 2004 Last Time Texture Anti-Aliasing Texture boundaries Modeling introduction.
Project 4 Relief Map Fri, Oct 24, 2003 Due Fri, Oct 31, 2003.
OpenGL Objects Finalised. Debugging Tip For Debugging your applications remember: glGetError(); gluErrorString(); Don’t use these in release code (the.
3D Object Representations. Introduction Line and circle and polygon algorithms- represented simple and smooth object. Some Natural object are neither.
Graphics Graphics Korea University kucg.korea.ac.kr Geometric Primitives 고려대학교 컴퓨터 그래픽스 연구실.
4. Geometric Objects and Transformations
Computer Graphics (Fall 2003) COMS 4160, Lecture 5: OpenGL 1 Ravi Ramamoorthi Many slides courtesy Greg Humphreys.
Chapter (4)1 Computer Graphics - Chapter 4 Geometric Objects and Transformations Objectives are to learn to: represent the basic geometric types learn.
Unit-4 Geometric Objects and Transformations- I
Angel: Interactive Computer Graphics 5E © Addison-Wesley 2009
Draw a Simple Object.
IAT 355 Scene Graphs Feb 23, 2017 IAT 355.
Building Models Ed Angel
Building Models Ed Angel Professor Emeritus of Computer Science
Isaac Gang University of Mary Hardin-Baylor
Angel: Interactive Computer Graphics5E © Addison-Wesley 2009
Angel: Interactive Computer Graphics5E © Addison-Wesley 2009
Building Models Ed Angel Professor Emeritus of Computer Science
Introduction to Meshes
Isaac Gang University of Mary Hardin-Baylor
Programming with OpenGL Part 3: Three Dimensions
Geometric Objects and Transformations (I)
Computer Graphics Transformations
Viewing and Projection
Angel: Interactive Computer Graphics5E © Addison-Wesley 2009
Chapter 4: Geometry.
Introduction to Meshes
Viewing and Projection
Presentation transcript:

Computer Graphics I, Fall 2010 Building Models

Computer Graphics I, Fall 2010 Objectives Introduce simple data structures for building polygonal models ­Vertex lists ­Edge lists OpenGL vertex arrays

Computer Graphics I, Fall 2010 Representing a Mesh Consider a mesh 8 nodes and 12 edges ­5 interior polygons ­6 interior (shared) edges Each vertex has location v i = (x i y i z i ) v1v1 v2v2 v7v7 v6v6 v8v8 v5v5 v4v4 v3v3 e1e1 e8e8 e3e3 e2e2 e 11 e6e6 e7e7 e 10 e5e5 e4e4 e9e9 e 12

Computer Graphics I, Fall 2010 Simple Representation Define each polygon by geometric locations of vertices Leads to OpenGL code such as Inefficient and unstructured ­Consider moving vertex to new location ­Must search for all occurrences glBegin(GL_POLYGON); glVertex3f(x1, y1, z1); glVertex3f(x6, y6, z6); glVertex3f(x7, y7, z7); glEnd();

Computer Graphics I, Fall 2010 Inward and Outward Facing Polygons Order {v 1, v 6, v 7 } and {v 6, v 7, v 1 } equivalent ==> same polygon rendered by OpenGL but {v 1, v 7, v 6 } different First two ==> outwardly facing polygons Use right-hand rule = counter-clockwise encirclement of outward-pointing normal OpenGL can treat inward and outward facing polygons differently

Computer Graphics I, Fall 2010 Geometry vs Topology Good idea to look for data structures that separate geometry from topology ­Geometry: locations of vertices ­Topology: organization of vertices and edges ­Example: polygon = ordered list of vertices edge connecting successive pairs of vertices last to first ­Topology holds even if geometry changes

Computer Graphics I, Fall 2010 Vertex Lists Put geometry in array Use pointers from vertices into this array Introduce polygon list x 1 y 1 z 1 x 2 y 2 z 2 x 3 y 3 z 3 x 4 y 4 z 4 x 5 y 5 z 5. x 6 y 6 z 6 x 7 y 7 z 7 x 8 y 8 z 8 P1 P2 P3 P4 P5 v1v7v6v1v7v6 v8v5v6v8v5v6 topology geometry

Computer Graphics I, Fall 2010 Shared Edges Vertex lists will draw filled polygons correctly but if draw polygon by its edges ==> shared edges drawn twice Can store mesh by edge list

Computer Graphics I, Fall 2010 Edge List v1v1 v2v2 v7v7 v6v6 v8v8 v5v5 v3v3 e1e1 e8e8 e3e3 e2e2 e 11 e6e6 e7e7 e 10 e5e5 e4e4 e9e9 e 12 e1 e2 e3 e4 e5 e6 e7 e8 e9 x 1 y 1 z 1 x 2 y 2 z 2 x 3 y 3 z 3 x 4 y 4 z 4 x 5 y 5 z 5. x 6 y 6 z 6 x 7 y 7 z 7 x 8 y 8 z 8 v1 v6 Note polygons are not represented

Computer Graphics I, Fall 2010 Modeling a Cube GLfloat vertices[][3] = {{-1.0,-1.0,-1.0},{1.0,-1.0,-1.0}, {1.0,1.0,-1.0}, {-1.0,1.0,-1.0}, {-1.0,-1.0,1.0}, {1.0,-1.0,1.0}, {1.0,1.0,1.0}, {-1.0,1.0,1.0}}; GLfloat colors[][3] = {{0.0,0.0,0.0},{1.0,0.0,0.0}, {1.0,1.0,0.0}, {0.0,1.0,0.0}, {0.0,0.0,1.0}, {1.0,0.0,1.0}, {1.0,1.0,1.0}, {0.0,1.0,1.0}}; Model color cube for rotating cube program Define global arrays for vertices and colors

Computer Graphics I, Fall 2010 Drawing a polygon from a list of indices Draw quadrilateral from list of indices into array vertices and use color corresponding to first index void polygon(int a, int b, int c, int d) { glBegin(GL_POLYGON); glColor3fv(colors[a]); glVertex3fv(vertices[a]); glVertex3fv(vertices[b]); glVertex3fv(vertices[c]); glVertex3fv(vertices[d]); glEnd(); }

Computer Graphics I, Fall 2010 Draw cube from faces void colorcube( ) { polygon(0,3,2,1); polygon(2,3,7,6); polygon(0,4,7,3); polygon(1,2,6,5); polygon(4,5,6,7); polygon(0,1,5,4); } Note that vertices are ordered so that obtain correct outward facing normals

Computer Graphics I, Fall 2010 Efficiency Weakness of approach: ­building model in application ­==> many function calls to draw cube Drawing cube by its faces in most straightforward way requires ­6 glBegin, 6 glEnd ­6 glColor ­24 glVertex ­More if use texture and lighting

Computer Graphics I, Fall 2010 Vertex Arrays OpenGL provides facility called vertex arrays ==> allows to store array data in implementation Six types of arrays supported ­Vertices ­Colors ­Color indices ­Normals ­Texture coordinates ­Edge flags Will need only colors and vertices

Computer Graphics I, Fall 2010 Initialization Using same color and vertex data, first enable glEnableClientState(GL_COLOR_ARRAY); glEnableClientState(GL_VERTEX_ARRAY); Identify location of arrays glVertexPointer(3, GL_FLOAT, 0, vertices); glColorPointer(3, GL_FLOAT, 0, colors); 3d arraysstored as floats data contiguous data array

Computer Graphics I, Fall 2010 Mapping indices to faces Form array of face indices Each successive four indices describe face of cube Draw through glDrawElements ==> replaces all glVertex and glColor calls in display callback GLubyte cubeIndices[24] = {0,3,2,1,2,3,7,6 0,4,7,3,1,2,6,5,4,5,6,7,0,1,5,4};

Computer Graphics I, Fall 2010 Drawing the cube Method 1: Method 2: for(i=0; i<6; i++) glDrawElements(GL_POLYGON, 4, GL_UNSIGNED_BYTE, &cubeIndices[4*i]); format of index data start of index data what to draw number of indices glDrawElements(GL_QUADS, 24, GL_UNSIGNED_BYTE, cubeIndices); Draws cube with 1 function call!!