计算几何的常用算法（Common algorithms for computational geometry）.docVIP

下载本文档

12
0
约1.92万字
约 22页
2017-09-20 发布于河南
举报
版权申诉

计算几何的常用算法（Common algorithms for computational geometry）.doc

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

计算几何的常用算法（Common algorithms for computational geometry）

计算几何的常用算法（Common algorithms for computational geometry） Common algorithms for computational geometry 1. vector subtraction Let the two-dimensional vector P = (x1, Y1), Q = (X2, Y2) Vector subtraction is defined as: P - Q = (x1 - X2, Y1 - Y2) Obviously there is a property of P - Q = - - (Q - P) If not explained, all of the following points are treated as vectors, and the subtraction of two points is vector subtraction; 2. vector cross product Let vector P = (x1, Y1), Q = (X2, Y2) The vector cross product is defined as: P * Q = x1*y2 - x2*y1 is a scalar quantity Obviously there is a property of P * Q = - (Q * P) P * (- Q) = - (P * Q) If not specified, all of the following points are treated as vectors, and the multiplication of points is regarded as vector cross product; The important properties of the product: if P * Q 0, then P is in the clockwise direction of Q if P x Q 0, then P is in the counterclockwise direction of Q if P * Q = 0, then P is collinear with Q, but may be the same direction or reverse 3. the judgment point is on the line segment Set up Q, line P1P2, Q line in the judgment basis is: (Q - P1) * (P2 - P1) = 0, and Q is in the rectangle with P1 and P2 as diagonal vertices 4. determine whether the two lines intersect We have two steps to determine whether the two lines intersect: (1) rapid rejection test With the line P1P2 for diagonal rectangular R with diagonal line Q1Q2 for rectangular T, if R and T do not intersect, and obviously the two line segment will not intersect; (2) straddle test If the two line segments intersect, then the two line segments must straddle each other, as shown in figure 1. In Figure 1, the P1P2 straddle Q1Q2, the vectors (P1 - Q1) and (P2 - Q1) lie on both sides of the vector (Q2 - Q1), i.e. (P1 - Q1) * (Q2 - Q1) * (P2 - Q1) * (Q2 - Q1) 0 Upper form can be rewritten as (P1 - Q1) * (Q2 - Q1) * (Q2 - Q1) * (P2 - Q1) 0 When (P1 - Q1) x (Q2 - Q1) = 0, the descriptions (P1 - Q1) and (Q2 - Q1) are collinear, But because of