java实现凸包算法_JAVA语言中实现凸包算法

源码一：JarvisMarch.java

package mtn.uis.xaltin.convex;

import static java.lang.Math.abs;

import java.util.Iterator;

import java.util.LinkedList;

import java.util.List;

public class JarvisMarch {

private int count;

public int getCount() {

return count;

}

public void setCount(int count) {

this.count = count;

}

private static int MAX_ANGLE = 4;

private double currentMinAngle = 0;

private List hullPointList;

private List indexList;

private PointFactory pf;

private Point[] ps;

public Point[] getPs() {

return ps;

}

private int firstIndex;

public int getFirstIndex() {

return firstIndex;

}

public JarvisMarch() {

this(10);

}

public JarvisMarch(int count) {

pf = PointFactory.getInstance(count);

initialize();

}

public JarvisMarch(int[] x, int[] y) {

pf = PointFactory.getInstance(x, y);

initialize();

}

private void initialize() {

hullPointList = new LinkedList();

indexList = new LinkedList();

firstIndex = pf.getFirstIndex();

ps = pf.getPoints();

addToHull(firstIndex);

}

private void addToHull(int index) {

indexList.add(index);

hullPointList.add(ps[index]);

}

public int calculateHull() {

for (int i = getNextIndex(firstIndex); i != firstIndex; i = getNextIndex(i)) {

addToHull(i);

}

showHullPoints();

return 0;

}

private void showHullPoints() {

Iterator itPoint = hullPointList.iterator();

Iterator itIndex = indexList.iterator();

Point p;

int i;

int index = 0;

System.out.println("The hull points is: -> ");

while (itPoint.hasNext()) {

i = itIndex.next();

p = itPoint.next();

System.out.print(i + ":(" + p.getX() + "," + p.getY() + ")  ");

index++;

if (index % 10 == 0)

System.out.println();

}

System.out.println();

System.out.println("****************************************************************");

System.out.println("The count of all hull points is " + index);

}

public int getNextIndex(int currentIndex) {

double minAngle = MAX_ANGLE;

double pseudoAngle;

int minIndex = 0;

for (int i = 0; i < ps.length; i++) {

if (i != currentIndex) {

pseudoAngle = getPseudoAngle(ps[i].getX() - ps[currentIndex].getX(),

ps[i].getY() - ps[currentIndex].getY());

if (pseudoAngle >= currentMinAngle && pseudoAngle < minAngle) {

minAngle = pseudoAngle;

minIndex = i;

} else if (pseudoAngle == minAngle){

if((abs(ps[i].getX() - ps[currentIndex].getX()) >

abs(ps[minIndex].getX() - ps[currentIndex