矩形交集算法的Java实现..？
I am interested in this algorithm: Algorithm to detect intersection of two rectangles?
but unable to implement it myself lacking even basic mathematical skills. I think I could understand it better once I can read the code. Does somebody perhaps have already an implementation or can quickly write one?
Thanks!
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（1）
来自 检测两个矩形相交的算法？
< a href="http://download.oracle.com/javase/6/docs/api/java/awt/Shape.html#intersects(double,%20double,%20double,%20double)" rel="nofollow noreferrer" >Java文档
from Algorithm to detect intersection of two rectangles?
Java doc