Previous | Next --- Slide 24 of 32
Back to Lecture Thumbnails

Are there any other applications in Computer Graphics using GD besides the IK algorithm?


Can we sample to initialize the parameters in different places such that we can find the global minimum with a high probability?


I remember from high school calculus that to find a global minima/maxima you just need to find all the local max/mins and calculate the boundaries. From all of these points, whichever one is the largest/smallest is the global min/max. Can a similar logic be applied here or is this too simplified to even consider.


What is the best way to check for global vs local min/max?


Is there a similar way to approach the problem when we need to find the global min/max instead of a local one? Is it practical to run this algorithm a bunch of times and take the min or max of all the local min/maxs found?


how to look for local/global min and max in this situation