<div dir="ltr">hello all, <div>Given a 3D scalar volume.</div><div>A particular grid point say P</div><div>A direction say V1 ( a unit vector)</div><div>A direction say V2 ( an orthogonal unit vector to v1)<br></div><div>
<br></div><div>I wish to find all grid points which are within a 'cylinder' defined by the point P the direction V1 </div><div>a length L and a breadth B along v2</div><div><br></div><div>I have added a <a href="https://dl.dropboxusercontent.com/u/2989703/Note%20Aug%201%2C%202013.pdf">link </a> to show how it might look in 2D </div>
<div><div><br></div><div>i am currently doing this by first finding all the neighbors of the point P in a region RxRxR</div><div>and going through each point and finding the projection on the normal given by V1</div><div>
and the orthogonal plane given by v2 which is very slow, </div><div>is there a faster approach ?</div><div><br></div><div>thanks</div>-- <br><div dir="ltr">Arindam Bhattacharya<br>Graduate Student<br><div><br></div></div>
</div></div>