<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[MYIHS]]></title><description><![CDATA[我输了，输给心智。]]></description><link>https://blog.youkuaiyun.com/t163ang</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; t163ang]]></copyright><item><title><![CDATA[stl字符串分割]]></title><link>https://blog.youkuaiyun.com/t163ang/article/details/49975825</link><guid>https://blog.youkuaiyun.com/t163ang/article/details/49975825</guid><author>t163ang</author><pubDate>Sun, 22 Nov 2015 10:23:46 +0800</pubDate><description><![CDATA[string sp = "___";
    string str = "ss" + sp + "gg" + sp + "ll"+sp;
    int count = 0;
    const int nLen = sp.length();
    string::iterator lastIter = str.begin();
    string::iterator findIte...]]></description><category></category></item><item><title><![CDATA[树的非递归遍历]]></title><link>https://blog.youkuaiyun.com/t163ang/article/details/41959853</link><guid>https://blog.youkuaiyun.com/t163ang/article/details/41959853</guid><author>t163ang</author><pubDate>Tue, 16 Dec 2014 14:55:25 +0800</pubDate><description><![CDATA[非递归遍历树算法以前我一直死记书本的用栈保存，最近笔试时要求写非递归遍历，想了很久都没有写好。回家后，我回顾重新学习了这个非递归遍历算法，总结了一下于是写下来记下。

其实遍历每个节点的过程中，有三种状态是必须记录下的，1、没访问左子树。2、已访问左子树。3、没访问右子树。每种状态须要执行的操作分别是，1、左孩子节点入栈，2、访问结点信息（中序遍历），3、右孩子节点入栈。其中已访问左子树，由下图的...]]></description><category></category></item><item><title><![CDATA[utf8与ucs2互转]]></title><link>https://blog.youkuaiyun.com/t163ang/article/details/39034107</link><guid>https://blog.youkuaiyun.com/t163ang/article/details/39034107</guid><author>t163ang</author><pubDate>Wed, 03 Sep 2014 22:00:52 +0800</pubDate><description><![CDATA[int ucs2_to_utf8(char high_byte,char low_byte, char *utf8){
	if(high_byte == 0x00 &amp;&amp; low_byte &lt;= 0x7f){//00-00
		utf8[0]=low_byte&amp;0x7f;
		return 1;
	}else if((high_byte&amp;0xf8)==0){/...]]></description><category></category></item><item><title><![CDATA[网络最大流算法小结]]></title><link>https://blog.youkuaiyun.com/t163ang/article/details/24813185</link><guid>https://blog.youkuaiyun.com/t163ang/article/details/24813185</guid><author>t163ang</author><pubDate>Wed, 30 Apr 2014 21:13:23 +0800</pubDate><description><![CDATA[1. EK

编码请看：http://www.maidoupig.cn


const int MN = 400;
int que[MN];
bool visited[MN];
int head,tail;
int map[MN][MN];
int pre[MN];
int N,M;
bool bfs(){
	int i,j,k;
	memset(visited,0,sizeof(visited)...]]></description><category></category></item><item><title><![CDATA[OpenCL 错误代码]]></title><link>https://blog.youkuaiyun.com/t163ang/article/details/19756333</link><guid>https://blog.youkuaiyun.com/t163ang/article/details/19756333</guid><author>t163ang</author><pubDate>Sun, 23 Feb 2014 13:29:39 +0800</pubDate><description><![CDATA[#define CL_SUCCESS 0






#define CL_DEVICE_NOT_FOUND -1






#define CL_DEVICE_NOT_AVAILABLE -2






#define CL_COMPILER_NOT_AVAILABLE -3






#define CL_MEM_OBJECT_ALLOCATION_FAILURE -...]]></description><category></category></item><item><title><![CDATA[一个简单的2d游戏引擎]]></title><link>https://blog.youkuaiyun.com/t163ang/article/details/18217691</link><guid>https://blog.youkuaiyun.com/t163ang/article/details/18217691</guid><author>t163ang</author><pubDate>Mon, 13 Jan 2014 11:27:58 +0800</pubDate><description><![CDATA[头文件 GameEngine.h


#pragma once

#include&lt;windows.h&gt;
#include&lt;list&gt;
#include"Sprite.h"
using namespace std;

int WINAPI WINMAIN(HINSTANCE hInstance, HINSTANCE hPrevInstance, PSTR szCmdLin...]]></description><category></category></item><item><title><![CDATA[Opengl读取及渲染Obj三维模型]]></title><link>https://blog.youkuaiyun.com/t163ang/article/details/17422457</link><guid>https://blog.youkuaiyun.com/t163ang/article/details/17422457</guid><author>t163ang</author><pubDate>Thu, 19 Dec 2013 20:30:47 +0800</pubDate><description><![CDATA[声明：本文内容及源代码只能作为学习参考用，转载请注明本声明blog.youkuaiyun.com/t163ang。

最近为了测试我的碰撞检测代码，需要使用Opengl来导入模型及渲染出来做碰撞，之前我发表一篇文章是对斯坦福模型ply文件渲染的，ply模型资源有限，所以今天看了其它三维模型，发现Obj模型网上有丰富的资源，且表达能力更强，但解析其就相对来讲复杂一些，我看网上一些代码，不是过于简单就是过于复杂，...]]></description><category></category></item><item><title><![CDATA[Opengl读取及渲染斯坦福三维ply模型]]></title><link>https://blog.youkuaiyun.com/t163ang/article/details/17354473</link><guid>https://blog.youkuaiyun.com/t163ang/article/details/17354473</guid><author>t163ang</author><pubDate>Mon, 16 Dec 2013 16:23:07 +0800</pubDate><description><![CDATA[声明：本文内容及源代码只能作为学习参考用，转载请注明本声明blog.youkuaiyun.com/t163ang。

搞图形学的童鞋经常需要用斯坦福三维模型来做实验的，模型ply文件下载地址：http://www.cc.gatech.edu/projects/large_models/index.html及http://graphics.stanford.edu/data/

因此需要将ply文件解析出来...]]></description><category></category></item><item><title><![CDATA[ural1486_二维hash匹配]]></title><link>https://blog.youkuaiyun.com/t163ang/article/details/12280889</link><guid>https://blog.youkuaiyun.com/t163ang/article/details/12280889</guid><author>t163ang</author><pubDate>Fri, 04 Oct 2013 15:31:45 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;map&gt;
#include&lt;string&gt;
#include&lt;algorithm&gt;
#include&lt;bitset&gt;
#include&lt;cassert&gt;
#include&lt;cstring&gt;
#include&lt;cmath&gt;
#include&lt;...]]></description><category></category></item><item><title><![CDATA[计算机图形学图书推荐]]></title><link>https://blog.youkuaiyun.com/t163ang/article/details/8873006</link><guid>https://blog.youkuaiyun.com/t163ang/article/details/8873006</guid><author>t163ang</author><pubDate>Wed, 01 May 2013 21:10:40 +0800</pubDate><description><![CDATA[编码请看：http://www.maidoupig.cn
关于Radiosity的好书有4本：Radiosity and Realistic Image Synthesis. Michael Cohen
Cohen获得 SIGGRAPH 1998 计算机图形学成就奖，他把 Radiosity 变成实际可用，现在 Cohen 在 MSR 图形组。Radiosity and Global Illumi...]]></description><category></category></item><item><title><![CDATA[二分图总结]]></title><link>https://blog.youkuaiyun.com/t163ang/article/details/8863190</link><guid>https://blog.youkuaiyun.com/t163ang/article/details/8863190</guid><author>t163ang</author><pubDate>Sun, 28 Apr 2013 13:54:39 +0800</pubDate><description><![CDATA[最大权闭合图

	闭合图G(V‘，E')：有向图G(V，E）存在(u,v)属于E，若u属于V'，则v属于V'。
	构图：源点向正权点集U连有向边，负权点集向汇点连有向边（容量取负权的绝对值）,求最小割。闭合图最大权=总权-最小割。
	
	
	最小点覆盖集

	最小点覆盖集G(V'，E')：无向图G(V，E）对于所有(u,v)属于E，u或v属于V‘。
	构图：源点S向所有u连有向边，所有v向汇点...]]></description><category></category></item><item><title><![CDATA[24位彩图直方图均衡化处理_opengl]]></title><link>https://blog.youkuaiyun.com/t163ang/article/details/8725161</link><guid>https://blog.youkuaiyun.com/t163ang/article/details/8725161</guid><author>t163ang</author><pubDate>Wed, 27 Mar 2013 10:15:01 +0800</pubDate><description><![CDATA[#include&lt;cstdio&gt;
#include&lt;cassert&gt;
#include&lt;cstring&gt;
#include&lt;math.h&gt;
#include&lt;time.h&gt;
#include&lt;Windows.h&gt;
#include&lt;GL/gl.h&gt;
#include&lt;GL/glu.h&gt;
#includ...]]></description><category></category></item><item><title><![CDATA[KM算法(3)poj3565]]></title><link>https://blog.youkuaiyun.com/t163ang/article/details/8680986</link><guid>https://blog.youkuaiyun.com/t163ang/article/details/8680986</guid><author>t163ang</author><pubDate>Sat, 16 Mar 2013 13:38:50 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;map&gt;
#include&lt;string&gt;
#include&lt;algorithm&gt;
#include&lt;bitset&gt;
#include&lt;cassert&gt;
#include&lt;cstring&gt;
#include&lt;cmath&gt;
#include&lt;...]]></description><category></category></item></channel></rss>