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 am looking for any good sources for geometric algorithms specifically;
The simple stuff like when two lines cross and so on is easy enough (and easy to find), but I would like to find somewhere with algorithms for the more tricky things, such as finding the shape formed by expanding a given polygon by some amount; fast algorithms for shapes with curved sides, etc.
Any good tips? Thanks!
In the end, I did find exactly what I was looking for: Real-Time Collision Detection by Christer Ericson. This is wonderful, and I recommend it strongly. Not so much on curved sides etc, but for the essential stuff on how to actually program geometrical hit testing and so on properly, it seems hard to beat.