<p> DeCasteljauNDP(ndp,p) </p>

4a4db73a-765b-45c2-8bae-410141cee6ff 2 4 5 decimal

&[DATE] &[TIME] - &[FILENAME]

DeCasteljau SVG algorithm chained style

ndp =  number of discretization points (> 1) in the prescribed range  0..1
p = control points ... each segment is populated 'ndp'... modules from Davide Carpi ndp p DeCasteljauNDP t p DeCasteljau M 1 t - (p 1 row * t p 2 row * + : p rows 2 > i 2 p rows 1 - range M M 1 t - (p i row * t p i 1 + row * + stack : for t M DeCasteljau 21 line M if 21 line : --------------------------------------------------- t p DeCasteljauRange M t 1 el p DeCasteljau : i 2 t length range M M t i el p DeCasteljau stack : for M 31 line : ---------------------- t 011 ndp 1 - / range : M t 1 el p DeCasteljau : i 2 t length range M M t i el p DeCasteljau stack : for M 81 line :

scale factor [B, p] svg 0.75 :

The all thing is about the construction of the 5 nest-vectors: join straight or join curved [Bézier/DeCasteljau].

B svg 600603003006021560350603502035010 - 28550 - 92 mat * :

p svg 606000303023 mat 00030306023 mat 0021560606023 mat 21535035060602023 mat 3503502852010 - 50 - 23 mat 15 mat transpose * :

NDP 100 : bezier NDP p 1 el DeCasteljauNDP : i 2 p length range bezier bezier NDP p i el DeCasteljauNDP stack : for 31 line

plot B bezier p 31 sys :

plot

svg 34 /