reflection paths between points in2d

Posted by Chris H on Stack Overflow See other posts from Stack Overflow or by Chris H
Published on 2010-04-20T00:42:27Z Indexed on 2010/04/20 1:33 UTC
Read the original article Hit count: 338

Filed under:
|
|
|

Just wondering if there was a nice (already implemented/documented) algorithm to do the following
boo!
Given any shape (without crossing edges) and two points inside that shape, compute all the paths between the two points such that all reflections are perfect reflections. The path lengths should be limited to a certain length otherwise there are infinite solutions. I'm not interested in just shooting out rays to try to guess how close I can get, I'm interested in algorithms that can do it perfectly. Search based, not guess/improvement based.

© Stack Overflow or respective owner

Related posts about geometry

Related posts about search