Click here to Skip to main content
15,891,905 members

Comments by PGT (Top 14 by date)

PGT 22-Oct-15 10:56am View    
Well i use this in a vertical filter on 3d depth data for Robotic control.
points[] only exist in the filter area of the code, not globally outside

Its inside an x row calculations and its not allowed to be on x-n or x+n, strictly only the current x. As to compare x,y against x-n,y or x+n, y strict horizontal filters are used.

The whole routine would never be called to fast, of which i can be sure since the robot that i control simply cant move that fast. A next robotic task comes after 2400ms. Cuyrrently I am fast enough (my math takes 120ms maximum). My math wouldnt work that fast without parallelism, I depend a lot on parallel code; and preferably i'd love to make it even faster. Because then i could make the behaviour of the robot smarter with some extra math.
There for i wonder this.
PGT 22-Oct-15 2:38am View    
Well the math never uses the same point[] data in another threat, that i am sure.
Its only that i wonder since its an array if each threat would lock the whole array to write its result too, or only lock the specific array element.
PGT 29-Oct-12 10:59am View    
Reason for my vote of 5
great code samples
PGT 27-Oct-12 15:11pm View    
on seccond thought this is to much, i think i have to split the task between 2 computers and 2 cams deviding the task in 2, still it need to be fast, but it would allow the code to do some more actions
PGT 27-Oct-12 15:03pm View    
i need it to fastly count certain pixels that fall into a heu range (or RGB with a work around). needles to say each frame is a new picture and a new count