﻿<?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++博客-coding is a rhythm game</title><link>http://www.cppblog.com/staryjy/</link><description>algorithm is crying</description><language>zh-cn</language><lastBuildDate>Sun, 05 Apr 2026 21:17:26 GMT</lastBuildDate><pubDate>Sun, 05 Apr 2026 21:17:26 GMT</pubDate><ttl>60</ttl><item><title>旋转卡壳算法 poj2187 poj3608</title><link>http://www.cppblog.com/staryjy/archive/2009/11/19/101412.html</link><dc:creator>liam</dc:creator><author>liam</author><pubDate>Thu, 19 Nov 2009 12:28:00 GMT</pubDate><guid>http://www.cppblog.com/staryjy/archive/2009/11/19/101412.html</guid><wfw:comment>http://www.cppblog.com/staryjy/comments/101412.html</wfw:comment><comments>http://www.cppblog.com/staryjy/archive/2009/11/19/101412.html#Feedback</comments><slash:comments>19</slash:comments><wfw:commentRss>http://www.cppblog.com/staryjy/comments/commentRss/101412.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/staryjy/services/trackbacks/101412.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;&nbsp;&nbsp;旋转卡壳可以用于求凸包的直径、宽度，两个不相交凸包间的最大距离和最小距离等。虽然算法的思想不难理解，但是实现起来真的很容易让人&#8220;卡壳&#8221;。&nbsp;&nbsp;&nbsp;拿凸包直径(也就是凸包上最远的两点的距离）为例，原始的算法是这样子：&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&n...&nbsp;&nbsp;<a href='http://www.cppblog.com/staryjy/archive/2009/11/19/101412.html'>阅读全文</a><img src ="http://www.cppblog.com/staryjy/aggbug/101412.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/staryjy/" target="_blank">liam</a> 2009-11-19 20:28 <a href="http://www.cppblog.com/staryjy/archive/2009/11/19/101412.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>