01-05-2010 03:14 PM - edited 01-05-2010 03:16 PM
Here's my version (LV 8.0 VI and 2009 snippet). Could be buggy 😉
(Of course you can change the array datatype to anything else.)
01-05-2010
03:38 PM
- last edited on
01-05-2010
04:57 PM
by
Support
falkpl wrote:Definitly using the subset would speed up the algorithm if the circle is a small sublet of the overall area.
Taking the subset first is a bad idea, because it does not handle negative indices as needed. (for example a subset of index=-3, size=10 is the same as index=0, size=10.
It is better to work on the entire original array, so negative indices give you a zero in case we are clipping the circle at the array boundary.
aeastet wrote:
aeastet, yes, the code is way too complicated, but there are also some general problems with coding style.
01-05-2010 03:57 PM
01-05-2010 04:34 PM
01-06-2010 01:34 AM
Wow, you guys are great. Just returned to the office to see all your great replies! Kudos are given.
The solution of Altenbach worked perfectly!
Thank you!