To get started: Clone this repository and all its submodule dependencies using:
git clone --recursive https://github.com/dilevin/CSC417-a2-mass-spring-3d.git
Do not fork: Clicking "Fork" will create a public repository. If you'd like to use GitHub while you work on your assignment, then mirror this repo as a new private repository: https://stackoverflow.com/questions/10065526/github-how-to-make-a-fork-of-public-repository-private
The second assignment has two purposes is really where we start doing Computer Graphics. The main focus will be on pushing the ideas we explored in 1D (the previous assignment) to larger scale examples (bunnies!) in 3D.
On all platforms, we will assume you have installed cmake and a modern c++ compiler on Mac OS X¹, Linux², or Windows³.
We also assume that you have cloned this repository using the --recursive
flag (if not then issue git submodule update --init --recursive).
Note: We only officially support these assignments on Ubuntu Linux 18.04 (the OS the teaching labs are running) and OSX 10.13 (the OS I use on my personal laptop). While they should work on other operating systems, we make no guarantees.
All grading of assignments is done on Linux 18.04
All assignments will have a similar directory and file layout:
README.md
CMakeLists.txt
main.cpp
include/
function1.h
function2.h
...
src/
function1.cpp
function2.cpp
...
data/
...
...
The README.md file will describe the background, contents and tasks of the
assignment.
The CMakeLists.txt file setups up the cmake build routine for this
assignment.
The main.cpp file will include the headers in the include/ directory and
link to the functions compiled in the src/ directory. This file contains the
main function that is executed when the program is run from the command line.
The include/ directory contains one file for each function that you will
implement as part of the assignment.
The src/ directory contains empty implementations of the functions
specified in the include/ directory. This is where you will implement the
parts of the assignment.
The data/ directory contains sample input data for your program. Keep in
mind you should create your own test data to verify your program as you write
it. It is not necessarily sufficient that your program only works on the given
sample data.
This and all following assignments will follow a typical cmake/make build routine. Starting in this directory, issue:
mkdir build
cd build
cmake ..
If you are using Mac or Linux, then issue:
make
Compiling the code in the above manner will yield working, but very slow executables. To run the code at full speed, you should compile it in release mode. Starting in the build directory, do the following:
cmake .. -DCMAKE_BUILD_TYPE=Release
Followed by:
make
Your code should now run significantly (sometimes as much as ten times) faster.
If you are using Windows, then running cmake .. should have created a Visual Studio solution file
called a2-mass-spring-3d.sln that you can open and build from there. Building the project will generate an .exe file.
Why don't you try this right now?
Once built, you can execute the assignment from inside the build/ using
./a2-mass-spring-3d
Its happening! We are finally doing some computer graphics ! You can tell because this assignment has a bunny in it (their name is Terry).
The goal of this assignment is to take what you've learned about 1D mass-spring systems and move it to 3D. While much of what we previously covered on variational mechanics and time integration still applies, you will soon see that implementations in 3D become much more complicated. Crucially, this assignment will tackle three concepts which will be important for the remainder of the course
- the potential energy of a 3D, non-zero rest length spring
- the notion of assembly. Assembly is a process which builds global linear algebra operations describing the motion of a whole object (bunny) from smaller operators describing the behaviour of individual pieces (in this case springs).
- The linearly implicit time integrator in 3D -- arguably the most popular time integration scheme in computer graphics.
Github does not render the math in this Markdown. Please look at README.html to see the equations in their proper form
The previous assignment had you implement a simple simulation of a coupled mass and spring in one-dimension. In this assignment we are going to level that up to three dimensions. Specifically, the assignment 2 code reads in a a 3D tetrahedral mesh (created using TetWild) and interprets all the edges of this tetrahedral mesh as springs. The user (you!!) will be able to poke and prod this bunny by clicking on vertices, in order to elicit, springy wobbly motion.
In 1D, we used the one-dimensional position of the mass particle as our generalized coordinate. In 3D we will use the obvious extension, which is that the generalized coordinate of each mass particle will be its 3D position. For the simple case of a spring connecting two masses we will define the 
vector
where subscripts are used to denote the particle each variable is associated with. Analogous with the 1D case, 
, where the time derivative is taken component-wise.
The first important difference between the 1D and 3D cases, is the nature of our spring itself. in 1D we assumed the spring has zero rest-length -- in other words, it has zero potential energy when the distance between the 1D particle, and the wall to which it is affixed, is zero. This won't work for 3D shapes since it will cause them to collapse to a point (like a bunny in a blackhole). So we need to define a new potential energy, one which encourages the spring to maintain its original length.
We are going to define a way to measure the deformation of our spring, relative to its rest, or undeformed, length -- such a measure is called a strain measure.
Lets define 
to be the original length of of our spring. Then we can define a simple strain measure as 
. This has all the properties we want in an effective strain measure:
- It's
when the spring has length 
(rather than being when length is ) - It's invariant to rigid body transformations (i.e the strain isn't effected by translating or rotating the spring)
Now in keeping with the variational approach to mechanics, we can use this strain to define a potential energy which we can use to construct our equations of motion.
Let's define the potential energy for a single spring to be
where 
is the mechanical stiffness of the spring, like in 1D.
Let's express 
in terms of 
, which stores the current positions of the end-points of the spring. We are going to do this by introducing some useful matrices that will come in handy later when we need to take derivatives of the potential energy.
We can compute the vector 
which points from one end of the spring to the other as
so that means the length of the spring can be written as
Thus 
which gives us the potential energy as a function of the generalized coordinates.
The kinetic energy, 
is defined analogously to the 1D case. In 1D, the kinetic energy was 
where 
was the scalar, 1D velocity. We can interpret this as the magnitude squared of the 1D velocity and thus, a reasonable 3D substitute would be
Because is only a function of the generalized velocity and is just a function of the generalized coordinate, you should be able to convince yourself that the equations of motion for a single, 3D spring are
Now that we've seen the basics of how a single spring can be simulated, let's see what happens when we consider a whole system consisting of many springs!
Now let's consider the case where we have 
springs and 
particles (like in the case of the tetrahedral mesh representing Terry the bunny).
Whereas in the previous section, our generalized coordinate was 
scalar values for two particles, in the general case, it becomes an 
vector
We'll start with the kinetic energy of a mass-spring system because its the same formula as for a single spring ! However, because it will be convenient later on, we will replace the scalar mass with an 
diagonal matrix 
(with the diagonal entries set to ) which gives us the slightly modified kinetic energy
where is called the mass matrix or inertia tensor. We'll see later in the course that mass matrices can get a lot more complicated than just diagonal.
It's really the force computation that gets effected most by the presence of multiple springs, but its easiest to see this by starting with the potential energy.
The potential energy of our entire mass spring system, is the sum of the potential energy of all the springs
where 
and 
are the generalized coordinates (the world space positions) of the two end points of the 
spring.
To make things a little easier conceptually, we are going to introduce another set of convenience matrices 
. Each performs the following useful function
An matrix (
) selects, from all the particle positions, the end-point positions of the spring. Why is this convenient ? Because we can now rewrite the potential energy of the mass-spring system in terms of .
So we can express the potential energy of the mass-spring system like this
and now we can take derivatives of this in order to compute, say the forces. Let's see what happens if we compute the gradient of this energy with respect to the generalized coordinates. Then we get
and because we know that the energy, in this case, only depends on the end points of the spring ( and ) we can make one final modification:
Let's unpack this a bit. First, you should be convinced that 
is just computing the potential energy gradient of one spring with respect to its end-points, exactly like what we discussed in the previous section. The only mysterious piece is our 
. That matrix is distributing the local end-point forces into the global force vector, so that they they act on the proper mass particles in the system. This summation and distribution of local forces is called assembly because it assembles the global force vector from local contributions. Assembly of local quantities comes up all the time in simulation, in fact we are going to see it used one more time in the next section.
Implementation Note: You could implement assembly by mirroring the formula above. In other words, instantiate a sparse matrix for each spring. However that is a waste of space and resources. Instead it's better to implement the action of by indexing directly into the global force vector.
As we discussed in the previous assignment, making the right choice of time integrator is crucial for the stability, appearance and performance of a simulation. In this assignment we are going to implement one of the most famous time integrators in computer graphics, the Linearly-Implicit Time Integrator. This integrator is not fully-implicit like backward Euler, but it is efficient to compute and reasonably stable, thus it is a good initial place to start when integrating an elastic system like these mass-springs.
You should be able to convince yourself that, given the potential and kinetic energies above, that the backward Euler update for a 3D, mass-spring system is
Our big problem is estimating the effect of the forces at 
. Rather than do this fully, the linearly-implicit integrator linearizes the system around the current state via Taylor expansion and uses this approximation to update the velocity.
We proceed by exploiting the fact that 
and making the assumption that \Delta t is sufficiently small (i.e we try and find a \Delta t so that the simulation doesn't explode). Then we can replace the above update equations with
Importantly we see the appearance of the force gradient, 
, called the Stiffness matrix (this will come up again and again :) ) which encodes the change in the forcing behaviour of the object, in a local region around the current state. Because our generalized forces are the negative gradient of the potential energy function, the Stiffness matrix is given by
or is the negative Hessian of the potential energy. Warning: missing negative signs are the number one affliction for otherwise happy physics simulators.
Ok, let's do one more rearrangement of these update equations to get them in their final, solvable form:
Now we see where linearly-implicit time integration gets its performance, it requires solving a single, sparse, symmetric linear system. Note: A fun game is to convince yourself that is both sparse (argue from the connectivity of the mass spring system) and symmetric (argue from Newton's 3rd law).
In practice, once we have assembled (there's that word again) and we can form 
and solve this linear system using off-the-shelf tools. For this assignment you can use the Simplicial LDLT solver built into the Eigen library.
Let's end this section by talking about the assembly of . In the same way as for the forces, we can directly compute the second derivative of our energy
Where 
is the local spring energy Hessian (so the Hessian of the spring energy wrt to its end points).
WARNING: to assemble the stiffness matrix replace with 
, the per-spring stiffness matrix.
Again, you could implement this using a whole bunch of matrices, but instead its better to implement it via direct indexing. In particular, in Eigen, you can construct a list of Eigen::Triplet objects that can be used to directly initialize a sparse matrix.
Hint: a good test for any integrator is to test that your object doesn't move when no forces are exerted on it.
A Mass-Spring system acting purely under gravity is very boring, it just falls straight down (a rigid motion!). What's the point of doing all this work of we don't get a wiggly bunny out of it? In order to generate wiggliness, we need to, at a minimum, fix parts of our object to the environment. These are the boundary conditions for the physics simulation. Because we are fixing the position of particles, these are Dirichlet boundary conditions. There are a few ways to go about this, but we are going to take a projection approach -- we will express our generalized coordinates using a smaller set of variables.
Given that a fixed vertex, by definition, does not move, it makes sense to choose all other vertex positions as our subspace variables. We can now construct a linear subspace which rebuilds all the positions of our particles from this subspace --
Let's say we have 
fixed vertices. Then 
is an 
length vector which includes the positions of all our non-fixed particles. 
is a 
vector which stores a 
's in the positions of our non-fixed particles and the fixed position of fixed particles. It's the matrix 
that performs the magic of stitching these things together.
is a bit like the selection matrices, the 's used to explain assembly. It selects out non-fixed vertex positions from and places them in the correct position in the global vector. Fixed positions are then filled in with values from . If we take as the generalized coordinates of our physical system, we will directly encode these fixed boundary conditions into the simulator.
This is exactly what the assignment 2 simulator does. In practice, it is useful to implement as a sparse matrix, and you will get the chance to do just that in assignment 2.
Implementations of nearly any task you're asked to implemented in this course can be found online. Do not copy these and avoid googling for code; instead, search the internet for explanations. Many topics have relevant wikipedia articles. Use these as references. Always remember to cite any references in your comments.
For this course most functions will be implemented in .cpp files. In this assignment the only exception is that time integrators are implemented in .h files. This is due to the use of lambda functions to pass force data to the time integration algorithms.
Compute the kinetic energy of a single mass particle.
Compute the gravitational potental energy of a single mass particle.
Compute the potential energy of a spring which connects two particles.
Compute the gradient of the gravitational potential energy for a single particle.
Compute the forces exerted by a single spring on its end-points.
Compute the per-spring hessian of the spring potential energy.
Compute the sparse, diagonal mass matrix that stores the mass of each particle in the mass-spring on its diagonal.
Iterate through each spring in the mesh, compute the per-spring forces and assemble the global force vector.
Iterate through each spring in the mesh, compute the per-spring stiffness matrix and assemble the global, sparse stiffness matrix. To do this, you should construct a list of Eigen::Triplet objects and then set your sparse matrix using these triplets.
Compute the sparse projection matrix which projects out fixed point vertices.
Given a point on the screen (i.e a mouse position clicked by the user), find all vertices within a given radius. For this method, and this method alone you are allowed to use the igl::unproject and igl::ray_mesh_intersect functions. I have provided the appropriate ray shooting function for you to use in the code as well.
Implement the linearly implicit Euler time integrator.