Christopher Overstreet

I want a matrix that is 2 planes (1D) that contains the cell addresses (x/Y) of all of the white pixels of the previous matrix. The dimension should adapt per frame according to how many pixels there are.

I am not sure how to go about this. It needs to be fast.

Any suggestions, especially to an external that is optimized for this.

I want a matrix that is 2 planes (1D) that contains the cell addresses (x/Y) of all of the white pixels of the previous matrix.  The dimension should adapt per frame according to how many pixels there are.

I am not sure how to go about this.  It needs to be fast.

get-co-ordinates-from-2d-1-plane-matrix

could be a start. The approach to use will really depend on how big your input is and how many points you need to get out of it.

could be a start.  The approach to use will really depend on how big your input is and how many points you need to get out of it.

I wasn't sure where to go with your suggestion. Attached is a patch demonstrating what I am trying to do with your suggestion on the right. The number of points, etc. is pretty realistic for my application.

I wasn't sure where to go with your suggestion.  Attached is a patch demonstrating what I am trying to do with your suggestion on the right.  The number of points, etc. is pretty realistic for my application.

OK, I tweaked what you started to show what I had in mind. Your way ends up being many times faster however. Blame the jit.bsort object. Really, your solution looks pretty good (40fps on my old compy). You could go Java or C for more speed. Someone should write a jit.qsort object.

OK, I tweaked what you started to show what I had in mind.  Your way ends up being many times faster however.  Blame the jit.bsort object.  Really, your solution looks pretty good (40fps on my old compy).  You could go Java or C for more speed.  Someone should write a jit.qsort object.

get co-ordinates from 2D 1 plane matrix