多边形交点
Possible Duplicate:
A simple algorithm for polygon intersection
How to find out intersection points of cutting polygon and polygon to be cut with their line segments in clock-wise or counter clock-wise in C#.
Any suggestions are appreciated.
Thanks in advance.
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（1）
听起来更像是家庭作业或面试问题。
没有 C# API 来表示直线、多边形或查找交点。您需要实现这些类。
请参阅一些向量代数文本，了解如何将线段表示为向量以及使用向量代数计算交点。
请参阅任何计算机图形学以获得更好的算法来计算多边形交点。< /p>
Sounds more like a homework or an interview problem.
There is no C# api either to represent lines, polygons or to find points of intersection. You need to implement these classes.
Refer to some vector algebra text on how to represent line segments as vectors and using vector algebra to compute points of intersection.
refer to any computer graphics for better algorithms to compute polygon intersections.