Computer Animation. Rick Parent

Transcription

1 Algorithms and Techniques Interpolating Values

2 Animation Animator specified interpolation key frame Algorithmically controlled Physics-based Behavioral Data-driven motion capture

3 Motivation Common problem: given a set of points Smoothly (in time and space) move an object through the set of points Example additional temporal constraints: t From zero velocity at first point, smoothly accelerate until time t1, hold a constant velocity until time t2, then smoothly decelerate to a stop at the last point at time t3

4 Motivation solution steps 1C 1. Construct ta space curve tht that interpolates the given points with piecewise first order continuity p=p(u) 2. Construct an arc-length-parametric- value function for the curve 3. Construct time-arc-length function according to given constraints u=u(s) s=s(t) p=p(u(s(t)))

5 Interpolating function Interpolation v. approximation Complexity: cubic Continuity: first degree (tangential) Local v. global control: local Information requirements: tangents needed?

6 Interpolation v. Approximation

7 Complexity Low complexity reduced computational cost Point of Inflection Can match arbitrary tangents at end points CUBIC polynomial

8 Continuity

9 Local v. Global l Control

10 Information requirements just the points tangents interior control points just beginning and ending tangents

11 Curve Formulations Lagrange Polynomial Piecewise cubic polynomials Hermite Catmull-Rom Blended Parabolas Bezier B-spline Tension-Continuity-Bias 4-Point Form

12 Lagrange Polynomial P j ( x) = y x x j k = 1 x j k j x x k k

13 Lagrange Polynomial P j ( x) = y x x j k = 1 x j k j x x k k

14 Polynomial Curve Formulations Need to match real-world data v. design from scratch Information requirements: just points? tangents? Qualities of final curve? Intuitive enough? Blending Other shape controls? Functions T P = U MB = FB = U T A [ 1] 3 2 u u u Coefficient matrix Geometric information Algebraic coefficient matrix

15 Hermite p 3 2 i+ 1 P = [ u u u 1] p p p i i ' +11 i '

16 Cubic Bezier pi+1 P = [ u u u 1] Interior control points play the same role as the tangents of the Hermite formulation p 0.0 p i p i +33 p i

17 Blended Parabolas/Catmull-Rom* p pi P = [ u u u 1] p p i 1 i p i * End conditions are handled differently

18 Controlling Motion along p=p(u) Step 2. Reparameterization by arc length u = U(s) where s is distance along the curve Step 3. Speed control for example, ease-in / ease-out s = ease(t) where t is time

19 Reparameterizing by Arc Length Analytic Forward differencing Supersampling Adaptive approach Numerically Adaptive Gaussian

20 Reparameterizing by Arc Length - analytic 3 2 P ( u) = au + bu + cu + d dp s u = 2 u 1 dp / du du / du = ( dx ( u ) / du dy ( u ) / du dz ( u ) / du ) ( dx ( u ) / du ) 2 + ( dy ( u ) / du ) 2 ( dx ( u ) / ) 2 dp / du = + du Can t always be solved analytically yfor our curves

21 Reparameterizing i by Arc Length - supersample 1.Calculate a bunch of points at small increments in u 2.Compute summed linear distances as approximation to arc length 3.Build table of (parametric value, arc length) pairs Notes 1.Often useful to normalize total distance to Often useful to normalize parametric value for multi-segment curve to 1.0

22 index u Arc Length Build table of approx. lengths

23 Adaptive Approach How fine to sample? Compare successive approximations and see if they agree within some tolerance Test can fail subdivide to predefined level, then start testing

24 Reparameterizing by Arc Length - quadrature + 1 ( u) du = 1 f w f ( ) i i u i 3 2 P ( u) = au + bu + cu + d Au 4 + Bu 3 + Cu 2 + Du + E Lookup tables of weights and parametric values Can also take adaptive approach here

25 Reparameterizing by Arc Length Analytic Forward differencing Supersampling Adaptive approach Numerically Adaptive Gaussian Sufficient for many problems

26 Speed Control distance Time-distance function Ease-in Cubic polynomial Sinusoidal segment Segmented sinusoidal Constant acceleration General distance-time functions time

27 Time Distance Function s S s = S(t) t

28 Ease-in/Ease-out Function s 1.0 S s = S(t) t Normalize distance and time to 1.0 to facilitate reuse

29 Ease-in: Sinusoidalid s ( sin( tπ / 2) 1) / 2 = ease( t) = π +

30 Ease-in: Piecewise cws Sinusoidal Snuso

31 Ease-in: Piecewise cws Sinusoidal Snuso 2 tπ π ( k (sin( )) 2k 2 / 1 π 1 f t <= k 1 ease(t) = k ( 1 + t k 1) / π / 2 f k < t <= 1 k 2 k ( π / 2 2 π ( t k ) k 2 k 1 + (1 k 2 ) sin( )) / π 2(1 k ) 2 ( f k < t 2 where f = 2 k1 + k2 k1 + (1 k π ( 2 2 ) π Provides linear (constant t velocity) middle segment

32 Ease-in: Single Cubic s = ease( t) = 2t + 3t 3 2

33 Ease-in: Constant t Acceleration

34 Ease-in: Constant t Acceleration

35 Ease-in: Constant t Acceleration

36 Ease-in: Constant t Acceleration

37 Constant Acceleration 2 t d = v 0 2t < t t 1 d t1 = v0 + v0( t t1) t1 < t t2 2 d t1 ( t t2 ) = v0 + v0( t2 t1) + v0(1 )( t t2) t2 < t (1 t ) 2

38 Motivation solution steps 1C 1. Construct ta space curve tht that interpolates the given points with piecewise first order continuity p=p(u) 2. Construct an arc-length-parametric- value function for the curve 3. Construct time-arc-length function according to given constraints u=u(s) s=s(t) p=p(u(s(t)))

39 Arbitrary Speed Control Animators can work in: Distance-time space curves Velocity-time space curves Acceleration-time space curves Set time-distance t constraints t etc.

40 Curve fitting to distance-time pairs

41 Working with time-distance curves

42 Interpolating distance-time time pairs

43 Frenet Frame control orientation

44 Frenet Frame tangent & curvature vector

45 Frenet Frame tangent & curvature vector P( u) = UMB P '( u ) = P''( u) = [ 1] 3 2 U = u u u

46 Frenet Frame tangent & curvature vector P( u) = UMB P '( u ) = U ' MB P''( u) = U '' MB [ ] 3 2 U = u u u 1 [ 2 U ' = 3u 2u 1 0 ] U '' = [ 6u 2 0 0]

47 Frenet Frame local coordinate system Directly control orientation of object/camera Use for direction and bank into turn, especially for ground-planar curves (e.g. roads) v is perpendicular to w if curve is parameterized by arclength; otherwise probably not perpendicular For general curve must v = wxu

48 Frenet Frame - undefined

49 Frenet Frame - discontinuity

50 Other ways to control orientation Use auxiliary curve to define direction or up vector Use point P(s+ds) for direction

51 Direction & Up vector v = u x w To keep head up, use y-axis to compute over and up vectors perpendicular to direction vector u=w x y-axis w Direction vector If up vector supplied, use that instead of y-axis

52 Orientation interpolation Preliminary note: 1. Remember that Rotq ( v) Rotkq( v) 2. Affects of scale are divided out by the inverse appearing in quaternion rotation 3.When interpolating quaternions, use UNIT quaternions otherwise magnitudes can interfere with spacing of results of interpolation

53 Orientation interpolation Quaternions can be interpolated to produce in-between orientations: ti q = ( 1 k) q + kq 2 problems analogous to issues when interpolating positions: 1. How to take equi-distant steps along orientation path? 2. How to pass through orientations smoothly (1 st order continuous) 1 3. And another particular to quaternions: with dual unit quaternion representations, which h to use? 2

54 Dual representation Rot ( v) Rot ( v) q = kq Dual unit quaternion representations For Interpolation between q1 and q2, compute cosine between q1 and q2 and between q1 and q2; choose smallest angle

55 Interpolating quaternions Unit quaternions form set of points on 4D sphere Linearly interpolating unit quaternions: not equally spaced

56 Interpolating quaternions in great arc => equal spacing

57 Interpolating quaternions with equal spacing slerp( q 1, q 2, u) = sin(1 u) θ q sinθ 1 + sin uθ q sinθ 2 where q 1 q2 = cosθ slerp, sphereical linear interpolation is a function of the beginning quaternion orientation, q1 the ending quaternion orientation, q2 the interpolant, u

58 Smooth Orientation interpolation Use quaternions Interpolate along great arc (in 4-space) using cubic Bezier on sphere 1S 1. Select representation to use from duals 2. Construct interior control points for cubic Bezier 3. use DeCastelajue construction of cubic Bezier

59 Smooth quaternion interpolation ti Similar to first order continuity desires with positional interpolation How to smoothly interpolate through orientations q 1, q 2, q 3, q n Bezier interpolation geometric construction

60 Bezier interpolation ti

61 Bezier interpolation ti Construct interior control points t n b n p n p n-1 a n p n p p n 1 n+2 p n-1 p n a a n p n+2 p n+1 p n+1 p n-1 p n p a n p n+2 a pn+1 0 b n+1 a n+1 t n+1 p 0 p 1 p2

62 Quaternion operators q 2 bisect(q 1, q 2 ) q b Similar to forming a vector between 2 points, form the rotation between 2 orientations q b q 1 double(q 1, q 2 ) Given 2 orientations, form result of applying rotation ti between the two to 2 nd orientation q 2 q d q 1

63 Quaternion operators: double ( p, q) = r Double where q is the midorientation between p and the yetto-be-determined r If p and q are unit quaternions, Then q = cos(θ)q and cos(θ)= q ' = cos( θ ) q = ( p q)q p q Given p and q, form r p q q θ θ θ r double( p, q) bisect( p, r) = q Bisect 2 orientations: if p and r are unit length = r = q' + ( q' p) = 2( p q) q p p + r bisect( p, r ) = = p + r Given p and r, form q q

64 Bezier interpolation ti Need quaternion-friendly operators to form interior control points

65 Bezier interpolation ti Construct interior control points t n p n p n-1 a n p n+2 a n = n bisect(double( pn 1, pn), p + 1) b n b = double( a, q n p n+1 p n-1 ( n n ) p n a n p n+2 p n+1 p 1 p n a p n-1 a n pn+1 b n+1 p n+2 a n+1 Bezier segment: q n, a n, b n+1, q n+1 t n+1

66 Bezier construction using quaternion operators Need quaternion-friendly operations to interpolate cubic Bezier curve using quaternion points de Casteljau geometric construction algorithm

67 Bezier construction using quaternion operators For p(1/3) t 1 =slerp(q n, a n,1/3) t 2 =slerp(a n, b n+1,1/3) t 3 =slerp(b n+1, q n+1,1/3) t 12 =slerp(t 1, t 2,1/3) t 23 =slerp(t 12, t 23,1/3) q=slerp(t 12, t 23,1/3)

68 Working with paths Smoothing a path Determining a path along a surface Finding downhill direction

69 Smoothing data

70 Smoothing data

71 Smoothing data

72 Smoothing data

73 Smoothing data

74 Smoothing data

75 Smoothing data

76 Smoothing data

77 Smoothing data

78 Smoothing data

79 Smoothing data

80 Smoothing data

81 Path finding

82 Path finding -downhill hll