什么是一个很好的来源，几何算法？ [英] What is a good source for geometric algorithms?

问题描述

我要寻找的几何算法专门任何的良好来源;

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.

这篇关于什么是一个很好的来源，几何算法？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！