Fri, 18 Jul 2008 11:44:00 GMT数学，算法，三维，游戏http://blog.csdn.net/happy__888/http://blog.csdn.net/happy__888/archive/2008/07/18/2670573.aspxhttp://blog.csdn.net/happy__888/comments/2670573.aspx0http://blog.csdn.net/happy__888/comments/commentRss/2670573.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=2670573如何判断两个矩形是否相交， 以及提取相交的矩形，或者计算相交面积<img src ="http://blog.csdn.net/happy__888/aggbug/2670573.aspx" width = "1" height = "1" />Fri, 18 Jul 2008 19:44:00 +0800happy__888http://blog.csdn.net/happy__888/archive/2008/07/18/2670573.aspx#Feedbackhttp://blog.csdn.net/happy__888/archive/2008/07/18/2670573.aspxhappy__888http://blog.csdn.net/happy__888/archive/2008/03/05/2151692.aspxhttp://blog.csdn.net/happy__888/comments/2151692.aspx0http://blog.csdn.net/happy__888/comments/commentRss/2151692.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=2151692空间当中围绕任意转轴旋转得到的两个向量之间的夹角关系<img src ="http://blog.csdn.net/happy__888/aggbug/2151692.aspx" width = "1" height = "1" />Thu, 06 Mar 2008 03:47:00 +0800happy__888http://blog.csdn.net/happy__888/archive/2008/03/05/2151692.aspx#Feedbackhttp://blog.csdn.net/happy__888/archive/2008/03/05/2151692.aspxhappy__888http://blog.csdn.net/happy__888/archive/2007/09/06/1775138.aspxhttp://blog.csdn.net/happy__888/comments/1775138.aspx0http://blog.csdn.net/happy__888/comments/commentRss/1775138.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1775138颐家IDO－是以DirectX－D3D技术为显示核心的，集成网络即时通讯（IM）， 在线选材功能，和交互设计功能于一身的，以网络游戏引擎为基础的大众软件。最显著的特点是参与设计的双方三维场景即时同步。<img src ="http://blog.csdn.net/happy__888/aggbug/1775138.aspx" width = "1" height = "1" />Fri, 07 Sep 2007 03:25:00 +0800happy__888http://blog.csdn.net/happy__888/archive/2007/09/06/1775138.aspx#Feedbackhttp://blog.csdn.net/happy__888/archive/2007/09/06/1775138.aspxhappy__888http://blog.csdn.net/happy__888/archive/2007/09/06/1775130.aspxhttp://blog.csdn.net/happy__888/comments/1775130.aspx0http://blog.csdn.net/happy__888/comments/commentRss/1775130.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1775130颐家IDO－在线互动软件，上线了。 第一次实现业主和设计师之间的互动设计<img src ="http://blog.csdn.net/happy__888/aggbug/1775130.aspx" width = "1" height = "1" />Fri, 07 Sep 2007 03:20:00 +0800happy__888http://blog.csdn.net/happy__888/archive/2007/09/06/1775130.aspx#Feedbackhttp://blog.csdn.net/happy__888/archive/2007/09/06/1775130.aspxhappy__888http://blog.csdn.net/happy__888/archive/2007/03/29/1545432.aspxhttp://blog.csdn.net/happy__888/comments/1545432.aspx0http://blog.csdn.net/happy__888/comments/commentRss/1545432.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1545432一个向量V, 在法向量为N的平面上产生的反射向量V‘的计算的问题。<img src ="http://blog.csdn.net/happy__888/aggbug/1545432.aspx" width = "1" height = "1" />Thu, 29 Mar 2007 23:41:00 +0800happy__888http://blog.csdn.net/happy__888/archive/2007/03/29/1545432.aspx#Feedbackhttp://blog.csdn.net/happy__888/archive/2007/03/29/1545432.aspxhappy__888http://blog.csdn.net/happy__888/archive/2007/03/29/1545349.aspxhttp://blog.csdn.net/happy__888/comments/1545349.aspx1http://blog.csdn.net/happy__888/comments/commentRss/1545349.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1545349装修第一要务是确定装修方案, 推荐一款装修设计软件<img src ="http://blog.csdn.net/happy__888/aggbug/1545349.aspx" width = "1" height = "1" />Thu, 29 Mar 2007 22:50:00 +0800happy__888http://blog.csdn.net/happy__888/archive/2007/03/29/1545349.aspx#Feedbackhttp://blog.csdn.net/happy__888/archive/2007/03/29/1545349.aspxhappy__888http://blog.csdn.net/happy__888/archive/2007/02/13/1508966.aspxhttp://blog.csdn.net/happy__888/comments/1508966.aspx0http://blog.csdn.net/happy__888/comments/commentRss/1508966.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1508966微软的测试题目: 只有两个XBOX盒子, 在100层楼上寻找最高的没有摔坏的层数<img src ="http://blog.csdn.net/happy__888/aggbug/1508966.aspx" width = "1" height = "1" />Tue, 13 Feb 2007 18:44:00 +0800happy__888http://blog.csdn.net/happy__888/archive/2007/02/13/1508966.aspx#Feedbackhttp://blog.csdn.net/happy__888/archive/2007/02/13/1508966.aspxhappy__888http://blog.csdn.net/happy__888/archive/2007/02/13/1508959.aspxhttp://blog.csdn.net/happy__888/comments/1508959.aspx0http://blog.csdn.net/happy__888/comments/commentRss/1508959.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1508959纪念在csdn的日子, 发了4000多个贴子.<img src ="http://blog.csdn.net/happy__888/aggbug/1508959.aspx" width = "1" height = "1" />Tue, 13 Feb 2007 18:38:00 +0800happy__888http://blog.csdn.net/happy__888/archive/2007/02/13/1508959.aspx#Feedbackhttp://blog.csdn.net/happy__888/archive/2007/02/13/1508959.aspxhappy__888http://blog.csdn.net/happy__888/archive/2006/04/22/672836.aspxhttp://blog.csdn.net/happy__888/comments/672836.aspx0http://blog.csdn.net/happy__888/comments/commentRss/672836.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=672836一次扫描，若干次填充完成图像的分区计算<img src ="http://blog.csdn.net/happy__888/aggbug/672836.aspx" width = "1" height = "1" />Sat, 22 Apr 2006 19:32:00 +0800happy__888http://blog.csdn.net/happy__888/archive/2006/04/22/672836.aspx#Feedbackhttp://blog.csdn.net/happy__888/archive/2006/04/22/672836.aspxhappy__888http://blog.csdn.net/happy__888/archive/2005/12/21/558356.aspxhttp://blog.csdn.net/happy__888/comments/558356.aspx5http://blog.csdn.net/happy__888/comments/commentRss/558356.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=558356单向链表当中的有无环路的判定，以及有环路情况下，环路入口点的判定方法，以及例子代码<img src ="http://blog.csdn.net/happy__888/aggbug/558356.aspx" width = "1" height = "1" />Thu, 22 Dec 2005 00:49:00 +0800happy__888http://blog.csdn.net/happy__888/archive/2005/12/21/558356.aspx#Feedbackhttp://blog.csdn.net/happy__888/archive/2005/12/21/558356.aspxhappy__888