<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>{顾问团｝寻开心 www.e-jjj.com</title><link>http://blog.csdn.net/happy__888/</link><description>数学，算法，三维，游戏</description><dc:language>zh-CN</dc:language><lastUpdateTime>Fri, 18 Jul 2008 11:51:00 GMT</lastUpdateTime><ttl>60</ttl><item><dc:creator>happy__888</dc:creator><title>如何判断两个矩形相交</title><link>http://blog.csdn.net/happy__888/archive/2008/07/18/2670573.aspx</link><pubDate>Fri, 18 Jul 2008 11:44:00 GMT</pubDate><guid>http://blog.csdn.net/happy__888/archive/2008/07/18/2670573.aspx</guid><wfw:comment>http://blog.csdn.net/happy__888/comments/2670573.aspx</wfw:comment><comments>http://blog.csdn.net/happy__888/archive/2008/07/18/2670573.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/happy__888/comments/commentRss/2670573.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2670573</trackback:ping><description>如何判断两个矩形是否相交， 以及提取相交的矩形，或者计算相交面积&lt;img src ="http://blog.csdn.net/happy__888/aggbug/2670573.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>happy__888</dc:creator><title>再谈空间向量之间的夹角问题</title><link>http://blog.csdn.net/happy__888/archive/2008/03/05/2151692.aspx</link><pubDate>Wed, 05 Mar 2008 19:47:00 GMT</pubDate><guid>http://blog.csdn.net/happy__888/archive/2008/03/05/2151692.aspx</guid><wfw:comment>http://blog.csdn.net/happy__888/comments/2151692.aspx</wfw:comment><comments>http://blog.csdn.net/happy__888/archive/2008/03/05/2151692.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/happy__888/comments/commentRss/2151692.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2151692</trackback:ping><description>空间当中围绕任意转轴旋转得到的两个向量之间的夹角关系&lt;img src ="http://blog.csdn.net/happy__888/aggbug/2151692.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>happy__888</dc:creator><title>颐家IDO－技术特点说明</title><link>http://blog.csdn.net/happy__888/archive/2007/09/06/1775138.aspx</link><pubDate>Thu, 06 Sep 2007 19:25:00 GMT</pubDate><guid>http://blog.csdn.net/happy__888/archive/2007/09/06/1775138.aspx</guid><wfw:comment>http://blog.csdn.net/happy__888/comments/1775138.aspx</wfw:comment><comments>http://blog.csdn.net/happy__888/archive/2007/09/06/1775138.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/happy__888/comments/commentRss/1775138.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1775138</trackback:ping><description>颐家IDO－是以DirectX－D3D技术为显示核心的，集成网络即时通讯（IM）， 在线选材功能，和交互设计功能于一身的，以网络游戏引擎为基础的大众软件。最显著的特点是参与设计的双方三维场景即时同步。&lt;img src ="http://blog.csdn.net/happy__888/aggbug/1775138.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>happy__888</dc:creator><title>颐家IDO－在线互动设计软件推出啦！</title><link>http://blog.csdn.net/happy__888/archive/2007/09/06/1775130.aspx</link><pubDate>Thu, 06 Sep 2007 19:20:00 GMT</pubDate><guid>http://blog.csdn.net/happy__888/archive/2007/09/06/1775130.aspx</guid><wfw:comment>http://blog.csdn.net/happy__888/comments/1775130.aspx</wfw:comment><comments>http://blog.csdn.net/happy__888/archive/2007/09/06/1775130.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/happy__888/comments/commentRss/1775130.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1775130</trackback:ping><description>颐家IDO－在线互动软件，上线了。
第一次实现业主和设计师之间的互动设计&lt;img src ="http://blog.csdn.net/happy__888/aggbug/1775130.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>happy__888</dc:creator><title>反射向量的计算</title><link>http://blog.csdn.net/happy__888/archive/2007/03/29/1545432.aspx</link><pubDate>Thu, 29 Mar 2007 15:41:00 GMT</pubDate><guid>http://blog.csdn.net/happy__888/archive/2007/03/29/1545432.aspx</guid><wfw:comment>http://blog.csdn.net/happy__888/comments/1545432.aspx</wfw:comment><comments>http://blog.csdn.net/happy__888/archive/2007/03/29/1545432.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/happy__888/comments/commentRss/1545432.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1545432</trackback:ping><description>一个向量V, 在法向量为N的平面上产生的反射向量V‘的计算的问题。&lt;img src ="http://blog.csdn.net/happy__888/aggbug/1545432.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>happy__888</dc:creator><title>装修设计软件</title><link>http://blog.csdn.net/happy__888/archive/2007/03/29/1545349.aspx</link><pubDate>Thu, 29 Mar 2007 14:50:00 GMT</pubDate><guid>http://blog.csdn.net/happy__888/archive/2007/03/29/1545349.aspx</guid><wfw:comment>http://blog.csdn.net/happy__888/comments/1545349.aspx</wfw:comment><comments>http://blog.csdn.net/happy__888/archive/2007/03/29/1545349.aspx#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://blog.csdn.net/happy__888/comments/commentRss/1545349.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1545349</trackback:ping><description>装修第一要务是确定装修方案, 推荐一款装修设计软件&lt;img src ="http://blog.csdn.net/happy__888/aggbug/1545349.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>happy__888</dc:creator><title>关于微软的摔XBOX的问题</title><link>http://blog.csdn.net/happy__888/archive/2007/02/13/1508966.aspx</link><pubDate>Tue, 13 Feb 2007 10:44:00 GMT</pubDate><guid>http://blog.csdn.net/happy__888/archive/2007/02/13/1508966.aspx</guid><wfw:comment>http://blog.csdn.net/happy__888/comments/1508966.aspx</wfw:comment><comments>http://blog.csdn.net/happy__888/archive/2007/02/13/1508966.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/happy__888/comments/commentRss/1508966.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1508966</trackback:ping><description>微软的测试题目: 只有两个XBOX盒子,  在100层楼上寻找最高的没有摔坏的层数&lt;img src ="http://blog.csdn.net/happy__888/aggbug/1508966.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>happy__888</dc:creator><title>突然发现,我给csdn的贡献很大啊! </title><link>http://blog.csdn.net/happy__888/archive/2007/02/13/1508959.aspx</link><pubDate>Tue, 13 Feb 2007 10:38:00 GMT</pubDate><guid>http://blog.csdn.net/happy__888/archive/2007/02/13/1508959.aspx</guid><wfw:comment>http://blog.csdn.net/happy__888/comments/1508959.aspx</wfw:comment><comments>http://blog.csdn.net/happy__888/archive/2007/02/13/1508959.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/happy__888/comments/commentRss/1508959.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1508959</trackback:ping><description>纪念在csdn的日子, 发了4000多个贴子.&lt;img src ="http://blog.csdn.net/happy__888/aggbug/1508959.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>happy__888</dc:creator><title>图像分区算法</title><link>http://blog.csdn.net/happy__888/archive/2006/04/22/672836.aspx</link><pubDate>Sat, 22 Apr 2006 11:32:00 GMT</pubDate><guid>http://blog.csdn.net/happy__888/archive/2006/04/22/672836.aspx</guid><wfw:comment>http://blog.csdn.net/happy__888/comments/672836.aspx</wfw:comment><comments>http://blog.csdn.net/happy__888/archive/2006/04/22/672836.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/happy__888/comments/commentRss/672836.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=672836</trackback:ping><description>一次扫描，若干次填充完成图像的分区计算&lt;img src ="http://blog.csdn.net/happy__888/aggbug/672836.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>happy__888</dc:creator><title>单向链表当中的环路判别问题</title><link>http://blog.csdn.net/happy__888/archive/2005/12/21/558356.aspx</link><pubDate>Wed, 21 Dec 2005 16:49:00 GMT</pubDate><guid>http://blog.csdn.net/happy__888/archive/2005/12/21/558356.aspx</guid><wfw:comment>http://blog.csdn.net/happy__888/comments/558356.aspx</wfw:comment><comments>http://blog.csdn.net/happy__888/archive/2005/12/21/558356.aspx#Feedback</comments><slash:comments>5</slash:comments><wfw:commentRss>http://blog.csdn.net/happy__888/comments/commentRss/558356.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=558356</trackback:ping><description>单向链表当中的有无环路的判定，以及有环路情况下，环路入口点的判定方法，以及例子代码&lt;img src ="http://blog.csdn.net/happy__888/aggbug/558356.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>happy__888</dc:creator><title>DirectX 下面的多窗口</title><link>http://blog.csdn.net/happy__888/archive/2005/11/17/531590.aspx</link><pubDate>Thu, 17 Nov 2005 14:10:00 GMT</pubDate><guid>http://blog.csdn.net/happy__888/archive/2005/11/17/531590.aspx</guid><wfw:comment>http://blog.csdn.net/happy__888/comments/531590.aspx</wfw:comment><comments>http://blog.csdn.net/happy__888/archive/2005/11/17/531590.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/happy__888/comments/commentRss/531590.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=531590</trackback:ping><description>DirectX下面的多窗口&lt;img src ="http://blog.csdn.net/happy__888/aggbug/531590.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>happy__888</dc:creator><title>如何计算点到线段的最近距离</title><link>http://blog.csdn.net/happy__888/archive/2005/11/09/526154.aspx</link><pubDate>Wed, 09 Nov 2005 15:55:00 GMT</pubDate><guid>http://blog.csdn.net/happy__888/archive/2005/11/09/526154.aspx</guid><wfw:comment>http://blog.csdn.net/happy__888/comments/526154.aspx</wfw:comment><comments>http://blog.csdn.net/happy__888/archive/2005/11/09/526154.aspx#Feedback</comments><slash:comments>3</slash:comments><wfw:commentRss>http://blog.csdn.net/happy__888/comments/commentRss/526154.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=526154</trackback:ping><description>计算二维或者三维图形学系统当中，点和线段之间的最短距离&lt;img src ="http://blog.csdn.net/happy__888/aggbug/526154.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>happy__888</dc:creator><title>如何用查表替代运算</title><link>http://blog.csdn.net/happy__888/archive/2005/08/30/468075.aspx</link><pubDate>Tue, 30 Aug 2005 18:35:00 GMT</pubDate><guid>http://blog.csdn.net/happy__888/archive/2005/08/30/468075.aspx</guid><wfw:comment>http://blog.csdn.net/happy__888/comments/468075.aspx</wfw:comment><comments>http://blog.csdn.net/happy__888/archive/2005/08/30/468075.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/happy__888/comments/commentRss/468075.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=468075</trackback:ping><description>如何用查表法替代函数运算&lt;img src ="http://blog.csdn.net/happy__888/aggbug/468075.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>happy__888</dc:creator><title>如何计算平面n个圆相交的公共部分的面积</title><link>http://blog.csdn.net/happy__888/archive/2005/06/21/399467.aspx</link><pubDate>Tue, 21 Jun 2005 16:21:00 GMT</pubDate><guid>http://blog.csdn.net/happy__888/archive/2005/06/21/399467.aspx</guid><wfw:comment>http://blog.csdn.net/happy__888/comments/399467.aspx</wfw:comment><comments>http://blog.csdn.net/happy__888/archive/2005/06/21/399467.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/happy__888/comments/commentRss/399467.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=399467</trackback:ping><description>通过新的圆弧的表示方法，以及建立连接关系表来计算多个平面圆的公共相交部分边界表达，从而计算出公共相交部分的面积。&lt;img src ="http://blog.csdn.net/happy__888/aggbug/399467.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>happy__888</dc:creator><title>如何计算两个空间向量之间的转角</title><link>http://blog.csdn.net/happy__888/archive/2005/04/28/367008.aspx</link><pubDate>Thu, 28 Apr 2005 18:16:00 GMT</pubDate><guid>http://blog.csdn.net/happy__888/archive/2005/04/28/367008.aspx</guid><wfw:comment>http://blog.csdn.net/happy__888/comments/367008.aspx</wfw:comment><comments>http://blog.csdn.net/happy__888/archive/2005/04/28/367008.aspx#Feedback</comments><slash:comments>9</slash:comments><wfw:commentRss>http://blog.csdn.net/happy__888/comments/commentRss/367008.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=367008</trackback:ping><description>如何计算空间向量之间的夹角&lt;img src ="http://blog.csdn.net/happy__888/aggbug/367008.aspx" width = "1" height = "1" /&gt;</description></item></channel></rss>