1 91.427 Computer Graphics I, Fall 2008 Hierarchical Modeling I.

Slides:



Advertisements
Similar presentations
Using GLU/GLUT Objects GLU/GLUT provides very simple object primitives glutWireCube glutWireCone gluCylinder glutWireTeapot.
Advertisements

Animation Following “Advanced Animation and Rendering Techniques” (chapter 15+16) By Agata Przybyszewska.
3D Graphics for Game Programming (J. Han) Chapter XI Character Animation.
1Notes  Assignment 0 marks should be ready by tonight (hand back in class on Monday)
Hierarchical Modeling I Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts University of New Mexico.
Lists A list is a finite, ordered sequence of data items. Two Implementations –Arrays –Linked Lists.
1 Intermediate representation Goals: –encode knowledge about the program –facilitate analysis –facilitate retargeting –facilitate optimization scanning.
Hierarchical Modeling II Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts University of New Mexico.
1 Geometrical Transformation Tong-Yee Lee. 2 Modeling Transform Specify transformation for objects Allow definitions of objects in own coordinate systems.
2D Transformations. World Coordinates Translate Rotate Scale Viewport Transforms Hierarchical Model Transforms Putting it all together.
Hierarchical Transformations and Models CSE 3541 Matt Boggus.
Important Problem Types and Fundamental Data Structures
University of Texas at Austin CS 378 – Game Technology Don Fussell CS 378: Computer Game Technology 3D Engines and Scene Graphs Spring 2012.
Hierarchical Transformations Hierarchical Models Scene Graphs
2IV60 Computer graphics set 4:3D transformations and hierarchical modeling Jack van Wijk TU/e.
Advanced Graphics (and Animation) Spring 2002
Hierarchy, Modeling, and Scene Graphs Angel: Chapter 10 OpenGL Programming and Reference Guides, other sources. ppt from Angel, AW, etc. CSCI 6360/4360.
COMP 175: Computer Graphics March 10, 2015
Objectives Review some advanced topics, including Review some advanced topics, including Chapter 8: Implementation Chapter 8: Implementation Chapter 9:
C O M P U T E R G R A P H I C S Stuff CMSC 435 / 634 Transformations 1/29 Geometric Transformations Readings: Chapters 5-6.
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Kinematic Linkages.
Demetriou/Loizidou – ACSC330 – Chapter 9 Hierarchical and Object-Oriented Modeling Dr. Giorgos A. Demetriou Dr. Stephania Loizidou Himona Computer Science.
Introduction Of Tree. Introduction A tree is a non-linear data structure in which items are arranged in sequence. It is used to represent hierarchical.
Data Structures for Scenes, The Basics of Scene Graphs Glenn G. Chappell U. of Alaska Fairbanks CS 481/681 Lecture Notes Friday,
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Kinematic Linkages.
Created on 29/10/2008yahaya.wordpress.com1 Trees Another common nonlinear data structure is the tree. We have already seen an example of a tree when we.
Week 4 Lecture 1: Hierarchical Modeling Part 1 Based on Interactive Computer Graphics (Angel) - Chapter 10 1 Angel: Interactive Computer Graphics 5E ©
Hierarchical Modeling. Instance Transformation Start with a prototype object (a symbol) Each appearance of the object in the model is an instance – Must.
C O M P U T E R G R A P H I C S Guoying Zhao 1 / 40 C O M P U T E R G R A P H I C S Guoying Zhao 1 / 40 Computer Graphics Hierarchy I.
1 Scene Graphs ©Anthony Steed Scene Graph Overview n Building Scene Structures n Traversal n Examples n Instancing and Re-Use n More Transformations.
Kinematics Jehee Lee Seoul National University. Kinematics How to animate skeletons (articulated figures) Kinematics is the study of motion without regard.
111/16/ :14 UML Instance Transformation x y z x y z x y z x y z SRT Model Coordinates.
1 12/2/2015 MATH 224 – Discrete Mathematics Formally a graph is just a collection of unordered or ordered pairs, where for example, if {a,b} G if a, b.
1 Introduction to Computer Graphics with WebGL Ed Angel Professor Emeritus of Computer Science Founding Director, Arts, Research, Technology and Science.
1 Hierarchical and Object-Oriented Graphics Construct complex models from a set of simple geometric objects Extend the use of transformations to include.
Transformations Tutorial
1/50 CS148: Introduction to Computer Graphics and Imaging Transforms CS148: Introduction to Computer Graphics and Imaging Transforms.
Computer Graphics I, Fall 2008 Hierarchical Modeling II.
Computer Graphics Matrix Hierarchies / Animation
CAP 4703 Computer Graphic Methods Prof. Roy Levow Chapter 9.
1 Introduction to Computer Graphics with WebGL Ed Angel Professor Emeritus of Computer Science Founding Director, Arts, Research, Technology and Science.
University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell Hierarchical Modeling.
University of New Mexico
Data Structures Lakshmish Ramaswamy. Tree Hierarchical data structure Several real-world systems have hierarchical concepts –Physical and biological systems.
1cs426-winter-2008 Notes. 2 Kinematics  The study of how things move  Usually boils down to describing the motion of articulated rigid figures Things.
Graph Concepts Elif Tosun 252a-aa (All graphics created by using demo/graphwin/gw*)
CS559: Computer Graphics Lecture 13: Hierarchical Modeling and Curves Li Zhang Spring 2010.
CSCE 441: Computer Graphics: Hierarchical Models Jinxiang Chai.
Hierarchical Models Chapter 9.
IAT 355 Scene Graphs Feb 23, 2017 IAT 355.
Modeling and Hierarchy
Hierarchical Modeling II
Hierarchical Transformations Hierarchical Models Scene Graphs
CHAPTER 2 FORWARD KINEMATIC 1.
Computer Graphics - Hierarchical Models-
Chapter 1.
Modeling and Hierarchy
Hierarchical and Object-Oriented Graphics
Introduction to Computer Graphics with WebGL
CSCE 441: Computer Graphics: Hierarchical Models
Computer Animation Algorithms and Techniques
Hierarchical and Object-Oriented Graphics
Hierarchical Modeling I
Hierarchical Modeling & Constructive Solid Geometry
Important Problem Types and Fundamental Data Structures
Dr. Chih-Kuo Yeh 葉智國 Computer Graphics Dr. Chih-Kuo Yeh 葉智國
Hierarchical Modeling
Computer Graphics Matrix Hierarchies / Animation
Figure 3. Converting an expression into a binary expression tree.
CSCE 441: Computer Graphics: Hierarchical Models
Presentation transcript:

Computer Graphics I, Fall 2008 Hierarchical Modeling I

Computer Graphics I, Fall 2008 Objectives Examine limitations of linear modeling ­Symbols and instances Introduce hierarchical models ­Articulated models ­Robots Introduce Tree and DAG models

Computer Graphics I, Fall 2008 Instance Transformation Start with prototype object (a symbol) Each appearance of object in model ==> instance ­Must scale, orient, position ­Defines instance transformation

Computer Graphics I, Fall 2008 Symbol-Instance Table Can store model by assigning number to each symbol and storing parameters for instance transformation

Computer Graphics I, Fall 2008 Relationships in Car Model Symbol-instance table does not show relationships between parts of model Consider model of car ­Chassis + 4 identical wheels ­Two symbols Rate of forward motion determined by rotational speed of wheels

Computer Graphics I, Fall 2008 Structure Through Function Calls car(speed) { chassis() wheel(right_front); wheel(left_front); wheel(right_rear); wheel(left_rear); } Fails to show relationships well ==> Look at problem using graph

Computer Graphics I, Fall 2008 Graphs Set of nodes and edges (links) Edge connects pair of nodes ­Directed or undirected Cycle: directed path that is a loop loop

Computer Graphics I, Fall 2008 Tree Graph in which each node (except root) has exactly one parent node ­May have multiple children ­Leaf or terminal node: no children root node leaf node

Computer Graphics I, Fall 2008 Tree Model of Car

Computer Graphics I, Fall 2008 DAG Model If use fact that all wheels identical ==> directed acyclic graph ­Not much different than dealing with tree

Computer Graphics I, Fall 2008 Modeling with Trees Must decide what information to place in nodes and what to put in edges Nodes ­What to draw ­Pointers to children Edges ­May have information on incremental changes to transformation matrices (can also store in nodes)

Computer Graphics I, Fall 2008 Robot Arm robot arm parts in their own coordinate systems

Computer Graphics I, Fall 2008 Articulated Models Robot arm = example of articulated model ­Parts connected at joints ­Can specify state of model by giving all joint angles

Computer Graphics I, Fall 2008 Relationships in Robot Arm Base rotates independently ­Single angle determines position Lower arm attached to base ­Its position depends on rotation of base ­Must also translate relative to base and rotate about connecting joint Upper arm attached to lower arm ­Its position depends on both base and lower arm ­Must translate relative to lower arm and rotate about joint connecting to lower arm

Computer Graphics I, Fall 2008 Required Matrices Rotation of base: R b ­Apply M = R b to base Translate lower arm relative to base: T lu Rotate lower arm around joint: R lu ­Apply M = R b T lu R lu to lower arm Translate upper arm relative to upper arm: T uu Rotate upper arm around joint: R uu ­Apply M = R b T lu R lu T uu R uu to upper arm

Computer Graphics I, Fall 2008 OpenGL Code for Robot robot_arm() { glRotate(theta, 0.0, 1.0, 0.0); base(); glTranslate(0.0, h1, 0.0); glRotate(phi, 0.0, 1.0, 0.0); lower_arm(); glTranslate(0.0, h2, 0.0); glRotate(psi, 0.0, 1.0, 0.0); upper_arm(); }

Computer Graphics I, Fall 2008 Tree Model of Robot Note code shows relationships between parts of model ­Can change “look” of parts easily without altering relationships Simple example of tree model Want general node structure for nodes

Computer Graphics I, Fall 2008 Possible Node Structure Code for drawing part or pointer to drawing function linked list of pointers to children matrix relating node to parent

Computer Graphics I, Fall 2008 Generalizations Need to deal with multiple children ­How represent more general tree? ­How traverse such data structure? Animation ­How to use dynamically? ­Can create and delete nodes during execution?