﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>C++博客-T9的空间 -随笔分类-计算几何</title><link>http://www.cppblog.com/xieshuo/category/8202.html</link><description>YOU WILL NEVER WALK ALONE!</description><language>zh-cn</language><lastBuildDate>Sat, 25 Oct 2008 08:35:11 GMT</lastBuildDate><pubDate>Sat, 25 Oct 2008 08:35:11 GMT</pubDate><ttl>60</ttl><item><title>pku 1269 (平面两直线的位置关系)</title><link>http://www.cppblog.com/xieshuo/archive/2008/09/24/62711.html</link><dc:creator> Torres</dc:creator><author> Torres</author><pubDate>Wed, 24 Sep 2008 13:29:00 GMT</pubDate><guid>http://www.cppblog.com/xieshuo/archive/2008/09/24/62711.html</guid><wfw:comment>http://www.cppblog.com/xieshuo/comments/62711.html</wfw:comment><comments>http://www.cppblog.com/xieshuo/archive/2008/09/24/62711.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xieshuo/comments/commentRss/62711.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xieshuo/services/trackbacks/62711.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 几何题，高中数学，告诫自己细心一点儿，耐心一点儿！&nbsp;&nbsp;<a href='http://www.cppblog.com/xieshuo/archive/2008/09/24/62711.html'>阅读全文</a><img src ="http://www.cppblog.com/xieshuo/aggbug/62711.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xieshuo/" target="_blank"> Torres</a> 2008-09-24 21:29 <a href="http://www.cppblog.com/xieshuo/archive/2008/09/24/62711.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>判断点是否在多边形中</title><link>http://www.cppblog.com/xieshuo/archive/2008/09/23/62625.html</link><dc:creator> Torres</dc:creator><author> Torres</author><pubDate>Tue, 23 Sep 2008 12:51:00 GMT</pubDate><guid>http://www.cppblog.com/xieshuo/archive/2008/09/23/62625.html</guid><wfw:comment>http://www.cppblog.com/xieshuo/comments/62625.html</wfw:comment><comments>http://www.cppblog.com/xieshuo/archive/2008/09/23/62625.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xieshuo/comments/commentRss/62625.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xieshuo/services/trackbacks/62625.html</trackback:ping><description><![CDATA[<p>我就叫他射线法吧<br>基本步骤：</p>
<p>１，过ｐ点垂直向上作一条射线</p>
<p>２，判断此射线与ｎ边形ｎ条边的交点</p>
<p>３，把所有交点相加，如果是奇数则说明在多边形内，否则在多边形外</p>
<p>思路非常的简单，另外说明一下几种特殊的情况：</p>
<p>１，射线与多边形的顶点相交；比如射线过多边形的Pi点，则如果Pi-1和Pi+1在此射线的异侧，此交点可以算一个，如果此两点在射线的同侧，则此交点不计。此结论非常简单，画个图应该就能明白了</p>
<p>２，ｐ点在多边形的某一条边上；也认为ｐ在多边形中</p>
<p>３，ｐ不在多边形的边上，但ｐ的射线与多边形的某一条边重合；比如与Pi,Pi+1线段重合，则如果Pi-1和Pi+2在射线的两侧，此情况也算一个交点，否则此情况不计交点</p>
<img src ="http://www.cppblog.com/xieshuo/aggbug/62625.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xieshuo/" target="_blank"> Torres</a> 2008-09-23 20:51 <a href="http://www.cppblog.com/xieshuo/archive/2008/09/23/62625.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>pku1113（凸包的周长）</title><link>http://www.cppblog.com/xieshuo/archive/2008/09/07/61207.html</link><dc:creator> Torres</dc:creator><author> Torres</author><pubDate>Sun, 07 Sep 2008 04:57:00 GMT</pubDate><guid>http://www.cppblog.com/xieshuo/archive/2008/09/07/61207.html</guid><wfw:comment>http://www.cppblog.com/xieshuo/comments/61207.html</wfw:comment><comments>http://www.cppblog.com/xieshuo/archive/2008/09/07/61207.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xieshuo/comments/commentRss/61207.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xieshuo/services/trackbacks/61207.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 多想想吧，凸包的周长+圆的周长&nbsp;&nbsp;<a href='http://www.cppblog.com/xieshuo/archive/2008/09/07/61207.html'>阅读全文</a><img src ="http://www.cppblog.com/xieshuo/aggbug/61207.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xieshuo/" target="_blank"> Torres</a> 2008-09-07 12:57 <a href="http://www.cppblog.com/xieshuo/archive/2008/09/07/61207.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>pku2187（凸包）</title><link>http://www.cppblog.com/xieshuo/archive/2008/09/07/61204.html</link><dc:creator> Torres</dc:creator><author> Torres</author><pubDate>Sun, 07 Sep 2008 04:54:00 GMT</pubDate><guid>http://www.cppblog.com/xieshuo/archive/2008/09/07/61204.html</guid><wfw:comment>http://www.cppblog.com/xieshuo/comments/61204.html</wfw:comment><comments>http://www.cppblog.com/xieshuo/archive/2008/09/07/61204.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xieshuo/comments/commentRss/61204.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xieshuo/services/trackbacks/61204.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 凸包求最大距离&nbsp;&nbsp;<a href='http://www.cppblog.com/xieshuo/archive/2008/09/07/61204.html'>阅读全文</a><img src ="http://www.cppblog.com/xieshuo/aggbug/61204.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xieshuo/" target="_blank"> Torres</a> 2008-09-07 12:54 <a href="http://www.cppblog.com/xieshuo/archive/2008/09/07/61204.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>HUST1175（多边形相交模板）</title><link>http://www.cppblog.com/xieshuo/archive/2008/09/07/61202.html</link><dc:creator> Torres</dc:creator><author> Torres</author><pubDate>Sun, 07 Sep 2008 04:51:00 GMT</pubDate><guid>http://www.cppblog.com/xieshuo/archive/2008/09/07/61202.html</guid><wfw:comment>http://www.cppblog.com/xieshuo/comments/61202.html</wfw:comment><comments>http://www.cppblog.com/xieshuo/archive/2008/09/07/61202.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xieshuo/comments/commentRss/61202.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xieshuo/services/trackbacks/61202.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 判断两个凸多边形是否相交。做比赛的时候没有判断是否两个多边形可以包含，wa！贴上去当作模板吧&nbsp;&nbsp;1#include&lt;iostream&gt;&nbsp;&nbsp;2#include&lt;algorithm&gt;&nbsp;&nbsp;3#include&lt;cmath&gt;&nbsp;&nbsp;4using&nbsp;namespace&nbsp;std;...&nbsp;&nbsp;<a href='http://www.cppblog.com/xieshuo/archive/2008/09/07/61202.html'>阅读全文</a><img src ="http://www.cppblog.com/xieshuo/aggbug/61202.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xieshuo/" target="_blank"> Torres</a> 2008-09-07 12:51 <a href="http://www.cppblog.com/xieshuo/archive/2008/09/07/61202.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>