[Insight-users] (no subject)

[Arindam Bhattacharya]

hello all,
Given a 3D  scalar volume.
A particular grid point say P
A direction say V1 ( a unit vector)
A direction say V2 ( an orthogonal  unit vector to v1)

I wish to find all grid points which are within a 'cylinder' defined by the
point P the direction V1
a length L and a breadth B along v2

I have added a link
<https://dl.dropboxusercontent.com/u/2989703/Note%20Aug%201%2C%202013.pdf> to
show how it might look in  2D

i am currently doing this by first finding all the neighbors of the point P
in a region RxRxR
and going through each point and finding the projection on the normal given
by V1
and the orthogonal plane given by v2 which is very slow,
is there a faster approach ?

thanks
-- 
Arindam Bhattacharya
Graduate Student
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.itk.org/pipermail/insight-users/attachments/20130801/f6bf8db5/attachment.htm>