06-17-2016 12:04 PM
Hexagon,
As an instructive example, could you please implement the Fibonacci algorithm as a Spatial Recipe?
More generaly, I'm interested in how variables of type lists, matrices, and kernels are defined, initialized and updated (without the use of auxiliary products, e.g., ERDAS.IMAGINE, etc.).
Regards
Solved! Go to Solution.
06-23-2016
09:32 AM
- last edited
Monday
by
fcaelen
Well, I was able to knock out Binet's formula pretty easily using Add/Subtract/Multiply/Divide/Sqrt/Power:
I don't reckon there's any way to do a recursive implementation directly in Spatial Workshop, but then the recursive definition isn't what you'd use practically anyway.
06-23-2016 09:41 AM
Awesome, thank you. Would you happen to know how variables of type lists, matrices, and kernels are defined, initialized and updated?
Regards