Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I have a 2D array consisting of 0s and 1s. I have a vector originating from a 0 to any direction and I need to find the nearest 1 that intersects with the vector in that direction and its distance
So I’ve looked into ray tracing, but most materials on the subject seemed rather unintuitive and mostly talked about how to do refraction and color calculations.
Is there something simpler than the said algorithm?
Thanks.
You can adapt the Bresenham’ line algorithm to this task.