Modeling CSCI 440 Computer Graphics based on Chapter 9

Slides:



Advertisements
Similar presentations
Trees Rosen Chapter 9 (page 631 onwards).
Advertisements

Binary Trees CSC 220. Your Observations (so far data structures) Array –Unordered Add, delete, search –Ordered Linked List –??
SUNY Oneonta Data Structures and Algorithms Visualization Teaching Materials Generation Group Binary Search Tree A running demonstration of binary search.
Trees 2 and Doubly Linked Lists As you arrive: Please snarf today’s code.
Lecture 16: Tree Traversal.
Trees Chapter 23 Copyright ©2012 by Pearson Education, Inc. All rights reserved.
Graphical Objects and Scene Graphs CS4395: Computer Graphics 1 Mohan Sridharan Based on slides created by Edward Angel.
Tree Implementations Chapter 24 Copyright ©2012 by Pearson Education, Inc. All rights reserved.
Joseph Lindo Trees Sir Joseph Lindo University of the Cordilleras.
Chapter 18 - basic definitions - binary trees - tree traversals Intro. to Trees 1CSCI 3333 Data Structures.
Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University Cpt S 122 – Data Structures Data Structures Trees.
Basic Graphics Concepts Day One CSCI 440. Terminology object - the thing being modeled image - view of object(s) on the screen frame buffer - memory that.
Trees Chapter 8. 2 Tree Terminology A tree consists of a collection of elements or nodes, organized hierarchically. The node at the top of a tree is called.
CS2852 Week 8, Class 2 Today Tree terminology Non-Binary and Non-Search Trees Tree Traversals (Remaining slides not yet shown) Tomorrow: Quiz Implementing.
1 Trees Tree nomenclature Implementation strategies Traversals –Depth-first –Breadth-first Implementing binary search trees.
Graphical Objects and Scene Graphs 1 Angel: Interactive Computer Graphics 5E © Addison-Wesley 2009.
Trees Chapter 15 Data Structures and Problem Solving with C++: Walls and Mirrors, Carrano and Henry, © 2013.
Week 2 - Wednesday CS361.
Tree (new ADT) Terminology:  A tree is a collection of elements (nodes)  Each node may have 0 or more successors (called children)  How many does a.
Review for Final Andy Wang Data Structures, Algorithms, and Generic Programming.
CSE 12 – Basic Data Structures Cynthia Bailey Lee Some slides and figures adapted from Paul Kube’s CSE 12 CS2 in Java Peer Instruction Materials by Cynthia.
Compiled by: Dr. Mohammad Omar Alhawarat
Trees Chapter 8. 2 Tree Terminology A tree consists of a collection of elements or nodes, organized hierarchically. The node at the top of a tree is called.
Lecture – Searching a Tree Neil Ghani University of Strathclyde.
CompSci 102 Discrete Math for Computer Science April 17, 2012 Prof. Rodger.
1 Introduction to Computer Graphics with WebGL Ed Angel Professor Emeritus of Computer Science Founding Director, Arts, Research, Technology and Science.
1 Introduction to Computer Graphics with WebGL Ed Angel Professor Emeritus of Computer Science Founding Director, Arts, Research, Technology and Science.
Computer Science 112 Fundamentals of Programming II Introduction to Trees.
Scene Graph & Game Engines. 2 Limitations of Immediate Mode Graphics  When we define a geometric object in an application, upon execution of the code.
Min Chen School of Computer Science and Engineering Seoul National University Data Structure: Chapter 6.
Chapter 6 (cont’) 1 AVL Tree. Search Trees 2 Two standard search trees: Binary Search Trees (non-balanced) All items in left sub-tree are less than root.
Lecture 17: Trees and Networks I Discrete Mathematical Structures: Theory and Applications.
1 Introduction to Computer Graphics with WebGL Ed Angel Professor Emeritus of Computer Science Founding Director, Arts, Research, Technology and Science.
Attack of the Clones Image source:
Graphical Objects and Scene Graphs Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts University of New Mexico.
Tree Implementations Chapter 24 © 2015 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. Data Structures and Abstractions with Java,
Data Abstraction and Problem Solving with JAVA Walls and Mirrors Frank M. Carrano and Janet J. Prichard © 2001 Addison Wesley Data Abstraction and Problem.
1 Trees General Trees  Nonrecursive definition: a tree consists of a set of nodes and a set of directed edges that connect pairs of nodes.
Binary Tree Implementation. Binary Search Trees (BST) Nodes in Left subtree has smaller values Nodes in right subtree has bigger values.
Data Structures Azhar Maqsood School of Electrical Engineering and Computer Sciences (SEECS-NUST) Binary Trees.
Lecture 7: Searching a Tree Neil Ghani University of Strathclyde.
Graphs and Trees Mathematical Structures for Computer Science Chapter 5 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesGraphs and Trees.
Mobile & Casual Gaming OpenGL ES Intro. /red/chapter03.html.
Rotation Translation Reflection. Review of Cartesian Plane.
Chapter 10 Trees © 2006 Pearson Education Inc., Upper Saddle River, NJ. All rights reserved.
Trees Chapter 15.
Data Structure and Algorithms
Fundamentals of Programming II Introduction to Trees
Recursive Objects (Part 4)
Graphical Objects and Scene Graphs
Graphical Objects and Scene Graphs
Binary Search Tree (BST)
Tree.
Section 8.1 Trees.
Lecture 08: Coordinate Transformation II
Introduction to Computer Graphics with WebGL
Introduction to Computer Graphics with WebGL
Copyright ©2012 by Pearson Education, Inc. All rights reserved
Copyright ©2012 by Pearson Education, Inc. All rights reserved
Abstract Data Structures
Chapter 9 Binary Trees.
Programming Assignment 2A
Binary Tree Chapter 8 (cont’) Part2.
Copyright ©2012 by Pearson Education, Inc. All rights reserved
Binary Search Trees Chapter 7 Objectives
Chapter 20: Binary Trees.
AVL Tree Chapter 6 (cont’).
Computer Graphics Matrix Hierarchies / Animation
Data Structures Using C++ 2E
A Binary Tree is a tree in which each node has at most 2 children
Presentation transcript:

Modeling CSCI 440 Computer Graphics based on Chapter 9

The Modeling Problem

Data Points  How can we create a model with 1000s of data points?  What information needs to be stored in these data files? 1.coordinates 2.organization of points: triangles, triangle fan, lines, … 3.normals 4.texture coordinates

Data Structure for Simple Scenes Angel figures 9.2 and 9.3

Complex Objects

function render() { gl.clear(…); modelMatrix = rotate (angle[base], 0,1,0 ); drawBase(); modelMatrix = mult (modelMatrix, translate ( 0, baseHeight, 0)); modelMatrix = mult (modelMatrix, rotate ( angle[lowerArm], 0,0,1 ); drawLowerArm(); modelMatrix = mult (modelMatrix, translate ( 0, lowerArmLength, 0)); modelMatrix = mult (modelMatrix, rotate ( angle[upperArm], 0,0,1 ); drawUpperArm();

Really Complex Objects Angel figures 9.12 and 9.13

Tree Traversal  Traversal Order?  pre-order  in-order  post-order  Coding Method?  manual traversal  recursive traversal  Node Content?

Scene Modeling Angel figures 9.18

Moral of Today's Story To model a complex scene you will need to either build a complex data management and rendering system, or learn a complex API that sits on top of WebGL.