Java种子填充算法 四向和八向

其他 2018-11-26 12:17:17 阅读次数: 0

种子填充算法多用于计算机对图形的处理。例如ps中填充区域一样。当我们要填充某一块区域，首先我们要让电脑识别出你要填充的每个像素点，种子算法通过给定种子的坐标获取该像素的颜色值，通过对比颜色信息来判断周围的像素是否是我们要选择的。

接下来我们用一个字符数组来代表我们的图片，*号的点则是我们要选中的像素，选择后我们则将他改成#。

第一种：四向填充         

我们没给定一个种子，我们则只获取左、上、右、下四个点。通过递归或循环处理所有的点。但是用递归会存在递归的深度问题，当我们的图片足够大时，Java虚拟机就会报出栈溢出的错误！

所以我们选取循环+队列的方式。我们都知道队列有个特性：先进先出！当我们根据种子点获取周围四个点加入队列，下一次循环则从队列头部去除一个点作为下一次的种子，并删除他，依次这样循环直到队列大小为零则停止。

Demo1.COL、Demo1.ROW为定义字符数组的行列

/**
	 * 四向
	 * @param seed
	 */
	public void DemoFill4(Point se) {
		Point seed = se;
		do {
			//左
			if(0<=(seed.x-1)&&(seed.x-1)<Demo1.ROW&&0<=(seed.y)&&(seed.y)<Demo1.COL&&!point[seed.x-1][seed.y].equals(c)) {
				point[seed.x-1][seed.y] = c;
				queue.offer(new Point(seed.x-1,seed.y));
				
			}
			//上
			if(0<=(seed.x)&&(seed.x)<Demo1.ROW&&0<=(seed.y-1)&&(seed.y-1)<Demo1.COL&&!point[seed.x][seed.y-1].equals(c)) {
				point[seed.x][seed.y-1] = c;
				queue.offer(new Point(seed.x,seed.y-1));
				
			}
			//右
			if(0<=(seed.x+1)&&(seed.x+1)<Demo1.ROW&&0<=(seed.y)&&(seed.y)<Demo1.COL&&!point[seed.x+1][seed.y].equals(c)) {
				point[seed.x+1][seed.y] = c;
				queue.offer(new Point(seed.x+1,seed.y));
				
			}
			//下
			if(0<=(seed.x)&&(seed.x)<Demo1.ROW&&0<=(seed.y+1)&&(seed.y+1)<Demo1.COL&&!point[seed.x][seed.y+1].equals(c)) {
				point[seed.x][seed.y+1] = c;
				queue.offer(new Point(seed.x,seed.y+1));
				
			}

			if(queue.size()>0) {
				point[seed.x][seed.y] = c;
				Point s = (Point) queue.poll();
				point[s.x][s.y] = c;
				seed = s;
				
				
			}else {
				return;
			}

		}while(true);

	}

为了提高算法的性能，则可以在加入周围点的同时也改变周围点。

第二种：八向填充       八向填充和四向不同的地方就是他选取了八个方向的点主要是解决边角问题。

/**
	 * 八向
	 * @param seed
	 */
	public void DemoFill8(Point se) {
		Point seed = se;
		do {
			//左
			if(0<=(seed.x-1)&&(seed.x-1)<Demo1.ROW&&0<=(seed.y)&&(seed.y)<Demo1.COL&&!point[seed.x-1][seed.y].equals(c)) {
				point[seed.x-1][seed.y] = c;
				queue.offer(new Point(seed.x-1,seed.y));
				
			}
			//左上
			if(0<=(seed.x-1)&&(seed.x-1)<Demo1.ROW&&0<=(seed.y-1)&&(seed.y-1)<Demo1.COL&&!point[seed.x-1][seed.y-1].equals(c)) {
				point[seed.x-1][seed.y-1] = c;
				queue.offer(new Point(seed.x-1,seed.y-1));
				
			}
			//上
			if(0<=(seed.x)&&(seed.x)<Demo1.ROW&&0<=(seed.y-1)&&(seed.y-1)<Demo1.COL&&!point[seed.x][seed.y-1].equals(c)) {
				point[seed.x][seed.y-1] = c;
				queue.offer(new Point(seed.x,seed.y-1));
				
			}
			//右上
			if(0<=(seed.x+1)&&(seed.x+1)<Demo1.ROW&&0<=(seed.y-1)&&(seed.y-1)<Demo1.COL&&!point[seed.x+1][seed.y-1].equals(c)) {
				point[seed.x+1][seed.y-1] = c;
				queue.offer(new Point(seed.x+1,seed.y-1));
				
			}
			//右
			if(0<=(seed.x+1)&&(seed.x+1)<Demo1.ROW&&0<=(seed.y)&&(seed.y)<Demo1.COL&&!point[seed.x+1][seed.y].equals(c)) {
				point[seed.x+1][seed.y] = c;
				queue.offer(new Point(seed.x+1,seed.y));
				
			}
			//右下
			if(0<=(seed.x+1)&&(seed.x+1)<Demo1.ROW&&0<=(seed.y+1)&&(seed.y+1)<Demo1.COL&&!point[seed.x+1][seed.y+1].equals(c)) {
				point[seed.x+1][seed.y+1] = c;
				queue.offer(new Point(seed.x+1,seed.y+1));
				
			}
			//下
			if(0<=(seed.x)&&(seed.x)<Demo1.ROW&&0<=(seed.y+1)&&(seed.y+1)<Demo1.COL&&!point[seed.x][seed.y+1].equals(c)) {
				point[seed.x][seed.y+1] = c;
				queue.offer(new Point(seed.x,seed.y+1));
				
			}
			//左下
			if(0<=(seed.x-1)&&(seed.x-1)<Demo1.ROW&&0<=(seed.y+1)&&(seed.y+1)<Demo1.COL&&!point[seed.x-1][seed.y+1].equals(c)) {
				point[seed.x-1][seed.y+1] = c;
				queue.offer(new Point(seed.x-1,seed.y+1));
				
			}

			if(queue.size()>0) {
				point[seed.x][seed.y] = c;
				Point s = (Point) queue.poll();
				point[s.x][s.y] = c;
				seed = s;

			}else {
				return;
			}
		}while(true);

	}

完整样例如下：

Point.java

package com.lb.test;
/**
 * 对象点
 * @author lanbing
 * @date 2018年9月17日
 *
 */
public class Point {
	public int x;
	public int y;
	
	public Point(int x, int y) {
		super();
		this.x = x;
		this.y = y;
	}
	
}

Fill.java

package com.lb.test;

import java.util.LinkedList;
import java.util.Queue;
/**
 * 四向，八向
 * @author lanbing
 * @date 2018年9月17日
 *
 */
public class Fill {
	public String[][] point;
	public String c;
	Queue<Point> queue = new LinkedList<Point>();

	public Fill(String[][] point, String c) {
		super();
		this.point = point;
		this.c = c;

	}

	/**
	 * 四向
	 * @param seed
	 */
	public void DemoFill4(Point se) {
		Point seed = se;
		do {
			//左
			if(0<=(seed.x-1)&&(seed.x-1)<Demo1.ROW&&0<=(seed.y)&&(seed.y)<Demo1.COL&&!point[seed.x-1][seed.y].equals(c)) {
				point[seed.x-1][seed.y] = c;
				queue.offer(new Point(seed.x-1,seed.y));
				
			}
			//上
			if(0<=(seed.x)&&(seed.x)<Demo1.ROW&&0<=(seed.y-1)&&(seed.y-1)<Demo1.COL&&!point[seed.x][seed.y-1].equals(c)) {
				point[seed.x][seed.y-1] = c;
				queue.offer(new Point(seed.x,seed.y-1));
				
			}
			//右
			if(0<=(seed.x+1)&&(seed.x+1)<Demo1.ROW&&0<=(seed.y)&&(seed.y)<Demo1.COL&&!point[seed.x+1][seed.y].equals(c)) {
				point[seed.x+1][seed.y] = c;
				queue.offer(new Point(seed.x+1,seed.y));
				
			}
			//下
			if(0<=(seed.x)&&(seed.x)<Demo1.ROW&&0<=(seed.y+1)&&(seed.y+1)<Demo1.COL&&!point[seed.x][seed.y+1].equals(c)) {
				point[seed.x][seed.y+1] = c;
				queue.offer(new Point(seed.x,seed.y+1));
				
			}

			if(queue.size()>0) {
				point[seed.x][seed.y] = c;
				Point s = (Point) queue.poll();
				point[s.x][s.y] = c;
				seed = s;
				
				
			}else {
				return;
			}

		}while(true);

	}

	/**
	 * 八向
	 * @param seed
	 */
	public void DemoFill8(Point se) {
		Point seed = se;
		do {
			//左
			if(0<=(seed.x-1)&&(seed.x-1)<Demo1.ROW&&0<=(seed.y)&&(seed.y)<Demo1.COL&&!point[seed.x-1][seed.y].equals(c)) {
				point[seed.x-1][seed.y] = c;
				queue.offer(new Point(seed.x-1,seed.y));
				
			}
			//左上
			if(0<=(seed.x-1)&&(seed.x-1)<Demo1.ROW&&0<=(seed.y-1)&&(seed.y-1)<Demo1.COL&&!point[seed.x-1][seed.y-1].equals(c)) {
				point[seed.x-1][seed.y-1] = c;
				queue.offer(new Point(seed.x-1,seed.y-1));
				
			}
			//上
			if(0<=(seed.x)&&(seed.x)<Demo1.ROW&&0<=(seed.y-1)&&(seed.y-1)<Demo1.COL&&!point[seed.x][seed.y-1].equals(c)) {
				point[seed.x][seed.y-1] = c;
				queue.offer(new Point(seed.x,seed.y-1));
				
			}
			//右上
			if(0<=(seed.x+1)&&(seed.x+1)<Demo1.ROW&&0<=(seed.y-1)&&(seed.y-1)<Demo1.COL&&!point[seed.x+1][seed.y-1].equals(c)) {
				point[seed.x+1][seed.y-1] = c;
				queue.offer(new Point(seed.x+1,seed.y-1));
				
			}
			//右
			if(0<=(seed.x+1)&&(seed.x+1)<Demo1.ROW&&0<=(seed.y)&&(seed.y)<Demo1.COL&&!point[seed.x+1][seed.y].equals(c)) {
				point[seed.x+1][seed.y] = c;
				queue.offer(new Point(seed.x+1,seed.y));
				
			}
			//右下
			if(0<=(seed.x+1)&&(seed.x+1)<Demo1.ROW&&0<=(seed.y+1)&&(seed.y+1)<Demo1.COL&&!point[seed.x+1][seed.y+1].equals(c)) {
				point[seed.x+1][seed.y+1] = c;
				queue.offer(new Point(seed.x+1,seed.y+1));
				
			}
			//下
			if(0<=(seed.x)&&(seed.x)<Demo1.ROW&&0<=(seed.y+1)&&(seed.y+1)<Demo1.COL&&!point[seed.x][seed.y+1].equals(c)) {
				point[seed.x][seed.y+1] = c;
				queue.offer(new Point(seed.x,seed.y+1));
				
			}
			//左下
			if(0<=(seed.x-1)&&(seed.x-1)<Demo1.ROW&&0<=(seed.y+1)&&(seed.y+1)<Demo1.COL&&!point[seed.x-1][seed.y+1].equals(c)) {
				point[seed.x-1][seed.y+1] = c;
				queue.offer(new Point(seed.x-1,seed.y+1));
				
			}

			if(queue.size()>0) {
				point[seed.x][seed.y] = c;
				Point s = (Point) queue.poll();
				point[s.x][s.y] = c;
				seed = s;

			}else {
				return;
			}
		}while(true);

	}

}

Demo.java

package com.lb.test;

import java.util.LinkedList;
/**
 * 种子填充算法
 * @author lanbing
 * @date 2018年9月17日
 *
 */
public class Demo1 {
	//矩阵的行列
	public final static int ROW = 19;
	public final static int COL = 19;

	//生成三列分割点
	public final static int[] COL1 = new int[] {4,8,12};

	//生成三行分割点
	public final static int[] ROW1 = new int[] {4,8,12};

	//填充的字符
	public final static String FILLCHAR = "#";

	//生成的随机点
	public final static int SUM = 50;


	public static void main(String[] args) {

		String[][] point = new String[ROW][COL];

		//初始化矩阵
		for(int i=0;i<ROW;i++) {
			for(int j=0;j<COL;j++) {
				if(i==0){
					point[i][j] = FILLCHAR;
				}else if(i==ROW-1){
					point[i][j] = FILLCHAR;
				}else if(j==0){
					point[i][j] = FILLCHAR;
				}else if(j==COL-1){
					point[i][j] = FILLCHAR;
				}else {
					point[i][j] = "*";
				}
			}
		}

		//显示矩阵
		ShowPoint(point);
		System.out.println();

//		//添加纵向分隔
//		AddColPoint(point);
//
//		ShowPoint(point);
//		System.out.println();
//
//		//添加横向分隔
//		AddRowPoint(point);
//
//		ShowPoint(point);
//		System.out.println();
//
//		
//		point[4][4] = "*";
//
//
//		ShowPoint(point);
//		System.out.println();
//		
//		
//		//生成随机点
//		GetRandom(50,point);
//		ShowPoint(point);

		
		Point seed = new Point(3, 3);
		Fill f = new Fill(point, FILLCHAR);
		f.DemoFill8(seed);
		
		ShowPoint(f.point);

	}

	/**
	 * 展示矩阵
	 * @param point
	 */
	public static void ShowPoint(String[][] point) {
		for(int i=0;i<ROW;i++) {
			for(int j=0;j<COL;j++) {
				System.out.print(point[i][j]);
			}
			System.out.println();
		}
	}

	/**
	 * 随机生成干扰点
	 * @param n
	 * @return
	 */
	public static void GetRandom(int n,String[][] point){
		LinkedList<Point> p = new LinkedList<Point>();

		do {
			if(p.size()>=n) {
				break;
			}else {
				Point po = new Point((int)Math.floor(Math.random()*ROW),(int)Math.floor(Math.random()*COL));
				if(!p.contains(po)) {
					p.add(po);
				}
			}
		}while(true);

		for(int i=0;i<p.size();i++) {
			point[p.get(i).x][p.get(i).y] = "#";
		}
	}

	/**
	 * 三列分割点
	 * @return
	 */
	public static void AddColPoint(String[][] point) {
		for(int i=0;i<ROW;i++) {
			for(int j=0;j<COL;j++) {
				for(int k=0;k<COL1.length;k++) {
					if(j==COL1[k]) {
						point[i][j] = FILLCHAR;
					}
				}
			}
		}
	}

	/**
	 * 三横分割点
	 * @return
	 */
	public static void AddRowPoint(String[][] point) {
		for(int i=0;i<ROW;i++) {
			for(int j=0;j<COL;j++) {
				for(int k=0;k<ROW1.length;k++) {
					if(i==ROW1[k]) {
						point[i][j] = FILLCHAR;
					}
				}
			}
		}
	}
}

有不对的地方请多多指教！

猜你喜欢

转载自blog.csdn.net/qq_34042417/article/details/82760666
今日推荐
周排行
成为C++高手之宏与枚举
在CAD二次开发中使用进度条
Js插件ECharts，HighCharts学习网址整理
Celery提交任务出错(on windows.)
cephfs内核客户端性能追踪
thinkphp中PHPExcel用法
EntityFramework动态组合多排序字段
汇编语言（八）实验9 根据材料编程
安装ubuntu后必须做的事情（对我而言）
JS函数式编程
每日归档
更多
2024-10-22(0)
2024-10-21(0)
2024-10-20(0)
2024-10-19(0)
2024-10-18(0)
2024-10-17(0)
2024-10-16(0)
2024-10-15(0)
2024-10-14(0)
2024-10-13(0)

代码天地 © 2018 codetd.com

境外服务器   最新电视剧2022