0
\$\begingroup\$

I have a bunch of random vectors representing a direction and four other vectors that we can distinguish with their pyramidal arrows at their extremity, they represent a boundary

what i'd like to do is figure out which vectors are within the given boundaries, how can I do that? How can I compare them to filter them properly so the only one selected are vectors within the four boundary direction

I have as info: directional vector / XYZ Euler angle

enter image description here enter image description here

\$\endgroup\$
3
  • \$\begingroup\$ This looks similar to a frustum culling check. There we define a plane for each side of the camera's view pyramid, and use dot products to check whether a vector is on the "inside" side of each plane. Have you looked at these techniques for some inspirations? \$\endgroup\$
    – DMGregory
    Feb 8 at 18:57
  • \$\begingroup\$ That's exactly what i was trying to do! i'll check asap, if you have some article to share let me knpw \$\endgroup\$
    – DB3D
    Feb 8 at 19:17
  • \$\begingroup\$ @DB3D since there is no other answer for now, if you haven't found anything yet, this is a good place regarding frustum techniques in general (not only culling/clipping): songho.ca/opengl/gl_projectionmatrix.html although it's more about the projection of objects from inside the pyramid to a plane close to the pyramid tip, but you might get the gist \$\endgroup\$
    – PentaKon
    Feb 9 at 10:30

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.