straightedge.test.demo.TargetFinder Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of straightedge Show documentation

Includes 2 main parts: - Path finding through 2D polygons using the A star algorithm and navigation-mesh generation Field of vision / shadows / line of sight / lighting. The basic polygon and point classes are the KPolygon and KPoint. KPolygon contains a list of KPoints for vertices as well as a center (centroid), area, and radius (circular bound or distance from center to furthest point). KPolygon was born out of the need for a more game-oriented and flexible polygon class than the Path2D class in the standard Java library. KPolygon implements java.awt.geom.Shape so it can be easily drawn and filled by Java2D's Graphics2D object. - This API provides path-finding and field-of-vision. For other complex geometric operations such as buffering (fattening and shrinking) and constructive area geometry (intersections and unions) it is recommended to use the excellent Java Topology Suite (JTS). The standard Java2D library also provides the Area class which can be used for some constructive area geometry operations. Note that there is a utility class PolygonConverter that can quickly convert KPolygons to JTS polygons and vice versa.

The newest version!

/*
 * Copyright (c) 2008, Keith Woodward
 *
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 * 1. Redistributions of source code must retain the above copyright notice,
 *    this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright notice,
 *    this list of conditions and the following disclaimer in the documentation
 *    and/or other materials provided with the distribution.
 * 3. Neither the name of Keith Woodward nor the names
 *    of its contributors may be used to endorse or promote products derived
 *    from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 *
 */
package straightedge.test.demo;

import straightedge.geom.KPoint;
import straightedge.geom.KPolygon;
import straightedge.geom.path.PathBlockingObstacleImpl;
import straightedge.geom.path.PathFinder;
import java.util.*;
import straightedge.geom.path.PathData;

/**
 *
 * @author Keith
 */
public class TargetFinder{
	public TargetUser targetUser;
	public World world;
	PathFinder pathFinder;
	public PathData pathData;

	public static int TARGET_FIXED = 0;
	public static int TARGET_RELATIVE = 1;
	public static int TARGET_PLAYER = 2;
	public int targetType;

	public double minRange = 50f;//getPlayer().getMaxAttackDist()*3/4f;
	public double maxRange = 60f;

	public KPoint target = new KPoint();
	public TargetUser targetPlayerToFollow = null;

	public TargetFinder(TargetUser targetUser, World world){
		this.targetUser = targetUser;
		this.world = world;
		pathFinder = new PathFinder();
		pathData = new PathData();
		respawn();
	}

	public void respawn(){
		setFixedTarget(targetUser.getPos(), false);
		pathData.reset();
	}

	public KPoint getAbsoluteTarget(){
		KPoint absoluteTarget = new KPoint();
		if (targetType == TARGET_FIXED){
			absoluteTarget.x = target.x;
			absoluteTarget.y = target.y;
		} else if (targetType == TARGET_RELATIVE){
			absoluteTarget.x = target.x + targetUser.getPos().x;
			absoluteTarget.y = target.y + targetUser.getPos().y;
			KPoint movedAbsoluteTarget = getNearestPointOutsideOfObstacles(absoluteTarget);
			absoluteTarget.setCoords(movedAbsoluteTarget);
		} else if (targetType == TARGET_PLAYER){
			double distToTarget = targetUser.getPos().distance(targetPlayerToFollow.getPos());
//			float minRange = 50;//getPlayer().getMaxAttackDist()*3/4f;
//			float maxRange = minRange/8f;//(getPlayer().getMaxAttackDist() - minRange)/2f;
			if (isWithinRangeOfTargetPlayer(distToTarget)){
				return new KPoint(targetUser.getPos());
			}
			KPoint p = targetPlayerToFollow.getPos().createPointToward(targetUser.getPos(), minRange);
			// Check that the point is not inside any allObstacles, or else the pathFinder won't work.
			for (PathBlockingObstacleImpl obst : getWorld().allObstacles){
				if (obst.getOuterPolygon().contains(p)){
					p = targetPlayerToFollow.getPos().copy();
					//System.out.println(this.getClass().getSimpleName() + ": getPlayer().getName() == "+getPlayer().getName()+", ");
					break;
				}
			}
			return p;
		}
		return absoluteTarget;
	}
	protected boolean isWithinRangeOfTargetPlayer(double distToTarget){
		if (distToTarget < maxRange){
			return true;
		}
		return false;
//		//float smallAmount = 0.01f;
//		if (targetUser.isMoving() == true){
//			//if (distToTarget < minRange + smallAmount){
//			if (distToTarget < (minRange + maxRange)/2f){
//				return true;
//			}
//		}else{
//			if (distToTarget < maxRange){
//				return true;
//			}
//		}
//		return false;
	}
	public boolean isTargetPlayer(){
		if (targetType == TARGET_PLAYER){
			return true;
		}
		return false;
	}
	public boolean isTargetFixed(){
		if (targetType == TARGET_FIXED){
			return true;
		}
		return false;
	}
	public boolean isTargetRelative(){
		if (targetType == TARGET_RELATIVE){
			return true;
		}
		return false;
	}

	public void setFixedTarget(double targetX, double targetY, boolean calcPathNow) {
		targetType = TARGET_FIXED;
		target.x = targetX;
		target.y = targetY;
		KPoint movedTarget = getNearestPointOutsideOfObstacles(target);
		target.setCoords(movedTarget);
		if (calcPathNow){
			calcPath();
		}
	}
	public void setFixedTarget(KPoint p, boolean calcPathNow) {
		setFixedTarget(p.x, p.y, calcPathNow);
	}

	public void setRelativeTarget(double targetX, double targetY, boolean calcPathNow) {
		targetType = TARGET_RELATIVE;
		target.x = targetX;
		target.y = targetY;
		if (calcPathNow){
			calcPath();
		}
	}
	public void setRelativeTarget(KPoint p, boolean calcPathNow) {
		setRelativeTarget(p.x, p.y, calcPathNow);
	}

	public void setTargetPlayer(TargetUser targetPlayerToFollow, boolean calcPathNow) {
		assert targetPlayerToFollow != null : targetPlayerToFollow;
		targetType = TARGET_PLAYER;
		this.targetPlayerToFollow = targetPlayerToFollow;
		if (calcPathNow){
			calcPath();
		}
	}
	public KPoint getNearestPointOutsideOfObstacles(KPoint point){
		// check that the target point isn't inside any allObstacles.
		// if so, move it.
		KPoint movedPoint = point.copy();
		boolean targetIsInsideObstacle = false;
		int count = 0;
		while (true){
			for (PathBlockingObstacleImpl obst : getWorld().allObstacles){
				if (obst.getOuterPolygon().contains(movedPoint)){
					targetIsInsideObstacle = true;
					KPolygon poly = obst.getOuterPolygon();
					KPoint p = poly.getBoundaryPointClosestTo(movedPoint);
					if (p != null){
						movedPoint.x = p.x;
						movedPoint.y = p.y;
					}
					assert point != null;
				}
			}
			count++;
			if (targetIsInsideObstacle == false || count >= 3){
				break;
			}
		}
		return movedPoint;
	}

	transient long time = -1;
	transient int count = 0;
	transient long oneSecond = 1000000000;
	public void calcPath(){
		if (time == -1){
			time = System.nanoTime();
		}
		count++;
		long timeNow = System.nanoTime();
		if (timeNow - time >= oneSecond){
			double calcsPerSecond = count/((timeNow - time)/oneSecond);
			//System.out.println(this.getClass().getSimpleName()+": calcsPerSecond == "+calcsPerSecond);
			count = 0;
			time = timeNow;
		}
		pathData = getPathFinder().calc(targetUser.getPos(), getAbsoluteTarget(), getWorld().maxConnectionDistance, this.getWorld().nodeConnector, world.allObstacles.getTileArray());
	}
	public TargetUser getTargetPlayerToFollow() {
		if (targetType == TARGET_PLAYER){
			return targetPlayerToFollow;
		}
		return null;
	}

	public boolean isAtTarget(){
		if (targetType == TARGET_RELATIVE){
			return false;
		}else if (targetType == TARGET_FIXED){
			if (this.getTargetUser().getPos().equals(target)){
				return true;
			}
			return false;
		}else if (targetType == TARGET_PLAYER){
			double dist = this.getTargetUser().getPos().distance(targetPlayerToFollow.getPos());
			if (isWithinRangeOfTargetPlayer(dist)){
				return true;
			}
			return false;
		}else{
			throw new RuntimeException("Unknown targetType == "+targetType);
		}
	}

	public World getWorld(){
		return world;
	}

	public PathFinder getPathFinder() {
		return pathFinder;
	}

	public TargetUser getTargetUser() {
		return targetUser;
	}

	public PathData getPathData() {
		return pathData;
	}

	public double getMinRange() {
		return minRange;
	}

	public double getMaxRange() {
		return maxRange;
	}

	public void setMinRange(double minRange) {
		this.minRange = minRange;
	}

	public void setMaxRange(double maxRange) {
		this.maxRange = maxRange;
	}
}