索引表细化算法对索引表依赖很大
下面是细化代码
注：函数输入的是二值图，1 为边缘，0 为背景；
///************************************************
public void xihua(ref byte [,]tu,int hang,int lie )
{
// byte[] deletemark = { // 这个即为前人据8领域总结的是否可以被删除的
256种情况
//0,0,1,1,0,0,1,1,1,1,0,1,1,1,0,1,
//1,1,0,0,1,1,1,1,0,0,0,0,0,0,0,1,
//0,0,1,1,0,0,1,1,1,1,0,1,1,1,0,1,
//1,1,0,0,1,1,1,1,0,0,0,0,0,0,0,1,
//1,1,0,0,1,1,0,0,0,0,0,0,0,0,0,0,
//0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
//1,1,0,0,1,1,0,0,1,1,0,1,1,1,0,1,
//0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
//0,0,1,1,0,0,1,1,1,1,0,1,1,1,0,1,
//1,1,0,0,1,1,1,1,0,0,0,0,0,0,0,1,
//0,0,1,1,0,0,1,1,1,1,0,1,1,1,0,1,
//1,1,0,0,1,1,1,1,0,0,0,0,0,0,0,0,
//1,1,0,0,1,1,0,0,0,0,0,0,0,0,0,0,
//1,1,0,0,1,1,1,1,0,0,0,0,0,0,0,0,
//1,1,0,0,1,1,0,0,1,1,0,1,1,1,0,0,
//1,1,0,0,1,1,1,0,1,1,0,0,1,0,0,0
// };//索引表
// byte[] biaojima = { 1, 2, 4, 8, 0, 16, 32, 64, 128 };
// //与8领域对应关系如下
// // a1 a2 a3
// // a4 a5 a6
// // a7 a8 a9
byte[] deletemark = {0,0,0,0,0,0,0,1,0,0,1,1,0,0,1,1,
0,0,0,0,0,0,0,0,0,0,1,1,1,0,1,1,
0,0,0,0,0,0,0,0,1,0,0,0,1,0,1,1,
0,0,0,0,0,0,0,0,1,0,1,1,1,0,1,1,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,1,0,0,0,1,0,1,1,
1,0,0,0,0,0,0,0,1,0,1,1,1,0,1,1,
0,0,1,1,0,0,1,1,0,0,0,1,0,0,1,1,
0,0,0,0,0,0,0,0,0,0,0,1,0,0,1,1,
1,1,0,1,0,0,0,1,0,0,0,0,0,0,0,0,
