Thursday Code Puzzler: Ray Casting
Thursday Code Puzzler: Ray Casting
Join the DZone community and get the full member experience.
Join For FreeDownload Microservices for Java Developers: A hands-on introduction to frameworks and containers. Brought to you in partnership with Red Hat.
Thursday is code puzzler day here at DZone. The idea is simple: solve the coding problem as efficiently as you can, in any language or framework that you find suitable.
Note: Even though there really is nothing stopping you from finding a solution to this on the internet, try to keep honest, and come up with your own answer. It's all about the participation!
Ray Casting Algorithm
A ray casting algorithm checks if a point is inside or outside a polygon. It's called Ray Casting because the typical solution for such a problem is to to create a horizontal ray starting at the given point and checking if it intersects the side of the polygon. Check out the Wikipedia page for more details.
Catch up on all our previous puzzlers here
Download Building Reactive Microservices in Java: Asynchronous and Event-Based Application Design. Brought to you in partnership with Red Hat.
Like This Article? Read More From DZone
Opinions expressed by DZone contributors are their own.
{{ parent.title || parent.header.title}}
{{ parent.tldr }}
{{ parent.linkDescription }}
{{ parent.urlSource.name }}