skeletons l.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Skeletons PowerPoint Presentation
Download Presentation
Skeletons

Loading in 2 Seconds...

play fullscreen
1 / 67

Skeletons - PowerPoint PPT Presentation


  • 254 Views
  • Uploaded on

Skeletons. CSE169: Computer Animation Instructor: Steve Rotenberg UCSD, Winter 2004. Linear Algebra Review. Coordinate Systems. Right handed coordinate system. Vector Arithmetic. Vector Magnitude. The magnitude (length) of a vector is: Unit vector (magnitude=1.0). Dot Product.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Skeletons' - monifa


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
skeletons

Skeletons

CSE169: Computer Animation

Instructor: Steve Rotenberg

UCSD, Winter 2004

coordinate systems
Coordinate Systems
  • Right handed coordinate system
vector magnitude
Vector Magnitude
  • The magnitude (length) of a vector is:
  • Unit vector (magnitude=1.0)
example angle between vectors
Example: Angle Between Vectors
  • How do you find the angle θ between vectors A and B?

b

θ=?

a

dot products with unit vectors
Dot Products with Unit Vectors

0 <a·b < 1

a·b = 0

a·b = 1

b

θ

a

-1 < a·b < 0

a·b = -1

dot products with non unit vectors
Dot Products with Non-Unit Vectors
  • If a and b are arbitrary (non-unit) vectors, then the following are still true:
    • If θ < 90º then a·b > 0
    • If θ = 90º then a·b = 0
    • If θ > 90º then a·b < 0
dot products with one unit vector
Dot Products with One Unit Vector
  • If |u|=1.0 then a·u is the length of the projection of a onto u

a

u

a·u

properties of the cross product
Properties of the Cross Product

area of parallelogram ab

is perpendicular to both a and b, in the direction defined by the right hand rule

example area of a triangle
Example: Area of a Triangle
  • Find the area of the triangle defined by 3D points a, b, and c

c

b

a

example alignment to target
Example: Alignment to Target
  • An object is at position p with a unit length heading of h. We want to rotate it so that the heading is facing some target t. Find a unit axis a and an angle θ to rotate around.

t

p

h

matrices
Matrices
  • Computer graphics apps commonly use 4x4 homogeneous matrices
  • A rigid 4x4 matrix transformation looks like this:
  • Where a, b, & c are orthogonal unit length vectors representing orientation, and d is a vector representing position
matrices20
Matrices
  • The right hand column can cause a projection, which we won’t use in character animation, so we leave it as 0,0,0,1
  • Some books store their matrices in a transposed form. This is fine as long as you remember that: A·B = BT·AT
transformations
Transformations
  • To transform a vector v by matrix M:

v’=v·M

  • If we want to apply several transformations, we can just multiply by several matrices:

v’=(((v·M1)·M2)·M3)·M4…

  • Or we can concatenate the transformations into a single matrix:

Mtotal=M1·M2·M3·M4…

v’=v·Mtotal

trigonometry
Trigonometry

cos2θ+ sin2θ= 1

1.0

sin θ

θ

cos θ

laws of sines and cosines
Laws of Sines and Cosines
  • Law of Sines:
  • Law of Cosines:

b

α

γ

c

a

β

kinematics
Kinematics
  • Kinematics: The analysis of motion independent of physical forces. Kinematics deals with position, velocity, acceleration, and their rotational counterparts, orientation, angular velocity, and angular acceleration.
  • Forward Kinematics: The process of computing world space geometric data from DOFs
  • Inverse Kinematics: The process of computing a set of DOFs that causes some world space goal to be met (I.e., place the hand on the door knob…)
  • Note: Kinematics is an entire branch of mathematics and there are several other aspects of kinematics that don’t fall into the ‘forward’ or ‘inverse’ description
skeletons26
Skeletons
  • Skeleton: A pose-able framework of joints arranged in a tree structure. The skeleton is used as an invisible armature to manipulate the skin and other geometric data of the character
  • Joint: A joint allows relative movement within the skeleton. Joints are essentially 4x4 matrix transformations. Joints can be rotational, translational, or some non-realistic types as well
  • Bone: Bone is really just a synonym for joint for the most part. For example, one might refer to the shoulder joint or upper arm bone (humerus) and mean the same thing
slide27
DOFs
  • Degree of Freedom (DOF): A variable φ describing a particular axis or dimension of movement within a joint
  • Joints typically have around 1-6 DOFs (φ1…φN)
  • Changing the DOF values over time results in the animation of the skeleton
  • In later weeks, we will extend the concept of a DOF to be any animatable parameter within the character rig
  • Note: in a mathematical sense, a free rigid body has 6 DOFs: 3 for position and 3 for rotation
joints
Joints
  • Core Joint Data
    • DOFs (N floats)
    • Local matrix: L
    • World matrix: W
  • Additional Data
    • Joint offset vector: r
    • DOF limits (min & max value per DOF)
    • Type-specific data (rotation/translation axes, constants…)
    • Tree data (pointers to children, siblings, parent…)
skeleton posing process
Skeleton Posing Process
  • Specify all DOF values for the skeleton (done by higher level animation system)
  • Recursively traverse through the hierarchy starting at the root and use forward kinematics to compute the world matrices (done by skeleton system)
  • Use world matrices to deform skin & render (done by skin system)

Note: the matrices can also be used for other things such as collision detection, FX, etc.

forward kinematics
Forward Kinematics
  • In the recursive tree traversal, each joint first computes its local matrix L based on the values of its DOFs and some formula representative of the joint type:

Local matrix L = Ljoint(φ1,φ2,…,φN)

  • Then, world matrix W is computed by concatenating L with the world matrix of the parent joint

World matrix W = L · Wparent

joint offsets
Joint Offsets
  • It is convenient to have a 3D offset vector r for every joint which represents its pivot point relative to its parent’s matrix
dof limits
DOF Limits
  • It is nice to be able to limit a DOF to some range (for example, the elbow could be limited from 0º to 150º)
  • Usually, in a realistic character, all DOFs will be limited except the ones controlling the root
skeleton rigging
Skeleton Rigging
  • Setting up the skeleton is an important and early part of the rigging process
  • Sometimes, character skeletons are built before the skin, while other times, it is the opposite
  • To set up a skeleton, an artist uses an interactive tool to:
    • Construct the tree
    • Place joint offsets
    • Configure joint types
    • Specify joint limits
    • Possibly more…
poses
Poses
  • Once the skeleton is set up, one can then adjust each of the DOFs to specify the pose of the skeleton
  • We can define a pose Φ more formally as a vector of N numbers that maps to a set of DOFs in the skeleton

Φ = [φ1 φ2 … φN]

  • A pose is a convenient unit that can be manipulated by a higher level animation system and then handed down to the skeleton
  • Usually, each joint will have around 1-6 DOFs, but an entire character might have 100+ DOFs in the skeleton
  • Keep in mind that DOFs can be also used for things other than joints, as we will learn later…
joint types37
Rotational

Hinge: 1-DOF

Universal: 2-DOF

Ball & Socket: 3-DOF

Euler Angles

Quaternions

Translational

Prismatic: 1-DOF

Translational: 3-DOF (or any number)

Compound

Free

Screw

Constraint

Etc.

Non-Rigid

Scale

Shear

Etc.

Design your own...

Joint Types
hinge joints 1 dof rotational
Hinge Joints (1-DOF Rotational)
  • Rotation around the x-axis:
hinge joints 1 dof rotational39
Hinge Joints (1-DOF Rotational)
  • Rotation around the y-axis:
hinge joints 1 dof rotational40
Hinge Joints (1-DOF Rotational)
  • Rotation around the z-axis:
hinge joints 1 dof rotational41
Hinge Joints (1-DOF Rotational)
  • Rotation around an arbitrary axis a:
universal joints 2 dof
Universal Joints (2-DOF)
  • For a 2-DOF joint that first rotates around x and then around y:
  • Different matrices can be formed for different axis combinations
ball socket 3 dof
Ball & Socket (3-DOF)
  • For a 3-DOF joint that first rotates around x, y, then z:
  • Different matrices can be formed for different axis combinations
prismatic joints 1 dof translation
Prismatic Joints (1-DOF Translation)
  • 1-DOF translation along an arbitrary axis a:
translational joints 3 dof
Translational Joints (3-DOF)
  • For a more general 3-DOF translation:
other joints
Other Joints
  • Compound
    • Free
    • Screw
    • Constraint
    • Etc.
  • Non-Rigid
    • Scale (1 axis, 3 axis, volume preserving…)
    • Shear
    • Etc.
software architecture
Software Architecture
  • Object oriented
  • Make objects for things that should be objects
  • Avoid global data & functions
  • Encapsulate information
  • Provide useful interfaces
  • Put different objects in different files
sample code
Sample Code
  • Some sample code is provided on the course web page listed as ‘project0’
  • It is an object oriented demo of a spinning cube
  • Classes:
    • Vector3
    • Matrix34
    • Tokenizer
    • Camera
    • SpinningCube
    • Tester
project 1 assignment
Project 1 Assignment
  • Load a skeleton from a ‘.skel’ file and display it in 3D
  • All joints in the skeleton should be 3-DOF rotational joints
  • Compute world matrices yourself and use glLoadMatrixf()
  • Due: Monday, Jan 19, 11:59pm
sample skel file
Sample Skel File

balljoint root {

[data for root]

balljoint head {

[data for head]

[children of head]

}

balljoint leg_l {

[data for leg]

[children of leg]

}

[more children of root]

}

skel file data tokens
Skel File Data Tokens

offset x y z (joint offset vector)

boxmin x y z (min corner of box to draw)

boxmax x y z (max corner of box to draw)

rotxlimit min max (x rotation DOF limits)

rotylimit min max (y rotation DOF limits)

rotzlimit min max (z rotation DOF limits)

pose x y z (values to pose DOFs)

balljoint name { } (child joint)

possible object breakdown
Possible Object Breakdown
  • One should consider making objects (classes) for the following:
    • DOF
    • Joint
    • Skeleton
common routines
Common Routines
  • Many classes will need functions for some or all of the following:
    • Constructor / destructor
    • Initialize
    • Load
    • Update (move things, pose, animate…)
    • Draw
    • Reset
what is a dof
What is a DOF?
  • Data
    • Value
    • Min, max
  • Functions
    • SetValue() (can clamp value at the time of setting)
    • GetValue()
    • SetMinMax()…
what is a joint
What is a Joint?
  • Data
    • Local & World matrices
    • Array of DOFs
    • Tree data (child/sibling/parent pointers, etc.)
  • Functions
    • Update() (recursively generate local matrix & concatenate)
    • Load()
    • AddChild()
    • Draw()
  • Note: One could also make a Joint base class and derive various specific joint types. In this case, it would be a good idea to make a virtual function for MakeLocalMatrix() that the base traversal routine calls
what is a skeleton
What is a Skeleton?
  • Data
    • Joint tree (might only need a pointer to the root joint)
  • Functions
    • Load
    • Update (traverses tree & computes joint matrices)
    • Draw
tree data structures
Tree Data Structures
  • The skeleton requires only the most basic N-tree data structure
  • The main things the tree needs:
    • An easy way to add a new child to a node
    • A way for each node to iterate through its children
  • There are several options:
    • Use STL
    • Implement a tree data structure
    • Store sibling & first child pointers in the Joint itself
sibling child pointers
Sibling & Child Pointers

class Joint {

Joint *Sibling,*Child;

… // other data

public:

bool Load(Tokenizer &t);

bool AddChild(Joint &c);

void Update(Matrix &parent);

void Draw();

… // other functions

};

addchild
AddChild()

bool Joint::AddChild(Joint &c) {

c.Sibling=Child;

Child=&c;

return true;

}

  • Ideally, it should do some error checking as well (such as verifying that c isn’t already a child of another node)
  • Note that Child & Sibling must be set to 0 initially in the constructor!
  • Also, notice that this routine adds c as the first child on the list (essentially adding them in reverse order)
update draw
Update & Draw

void Joint::Update(Matrix &parent) {

… // Compute LocalMatrix

… // Compute WorldMatrix

if(Sibling) Sibling->Update(parent);

if(Child) Child->Update(WorldMatrix);

}

void Joint::Draw() {

.. // Do some OpenGL

if(Sibling) Sibling->Draw();

if(Child) Child->Draw();

}

slide65
Load

bool Skeleton::Load(const char *file) {

Tokenizer token;

token.Open(file,"skel"));

token.FindToken("balljoint"));

// Parse tree

Root=new Joint;

Root->Load(token);

// Finish

token.Close();

return true;

}

slide66
bool Joint::Load(Tokenizer &t) {

token.FindToken("{"));

while(1) {

char temp[256];

token.GetToken(temp);

if(strcmp(temp,"offset")==0) {

Offset.x=token.GetFloat();

Offset.y=token.GetFloat();

Offset.z=token.GetFloat();

}

else // Check for other tokens

else if(strcmp(temp,"balljoint")==0) {

Joint *jnt=new Joint;

jnt->Load(token);

AddChild(*jnt);

}

else if(strcmp(temp,"}")==0) return true;

else token.SkipLine(); // Unrecognized token

}

}

notes about sibling child trees
Notes About Sibling/Child Trees
  • Hard to implement a tree with less code
  • A bit on the ‘quick and dirty’ side though
  • Not abstracting the tree structure away means that code will be duplicated if other classes need to be in their own trees
  • The double recursion in the traversal routines can tend to lead to unnecessarily deep runtime stacks (stack overflows)