private void dcHullForUpperHull(List<Point> list, Point p, Point q) {
List<Point> upperH = new ArrayList<Point>();
List<Point> lowerH = new ArrayList<Point>();
int low = 0;
int high = list.size()-1;
System.out.println(list);
if(low<high) {
Point pivot = list.get((low+high)/2);
for (Point point : list) {
boolean bool = Determinate.isPointLeftSide(q, pivot, point);
if (bool == true ) {
upperH.add(point);
}
}
for (Point point : list) {
boolean bool = Determinate.isPointLeftSide(pivot, p, point);
boolean bool1 = Determinate.isPointOnLine(pivot, p, point);
if (bool == true || bool1==true) {
lowerH.add(point);
}
}
System.out.println(pivot.toString());
System.out.println(upperH.toString());
System.out.println(lowerH.toString());
dcHullForUpperHull(upperH, pivot, q);
dcHullForUpperHull(lowerH, p, pivot);
}
}
and it prints:
[X :132.0 Y: 140.0angle0.0, X :162.0 Y: 116.0angle0.0, X :210.0 Y: 112.0angle0.0, `enter code here`X:258.0 Y: 117.0angle0.0]
X :162.0 Y: 116.0angle0.0
[X :210.0 Y: 112.0angle0.0, X :258.0 Y: 117.0angle0.0]
[X :132.0 Y: 140.0angle0.0, X :162.0 Y: 116.0angle0.0]
[X :210.0 Y: 112.0angle0.0, X :258.0 Y: 117.0angle0.0]
X :210.0 Y: 112.0angle0.0
[X :258.0 Y: 117.0angle0.0]
[X :210.0 Y: 112.0angle0.0]
[X :258.0 Y: 117.0angle0.0]
[X :210.0 Y: 112.0angle0.0]
[X :132.0 Y: 140.0angle0.0, X :162.0 Y: 116.0angle0.0]
X :132.0 Y: 140.0angle0.0
[]
[X :132.0 Y: 140.0angle0.0]
[]
[X :132.0 Y: 140.0angle0.0]
And it is clear that my binary tree is not OK!! also a method "isPointLeftSide" will say that the point is left of one line with its determinate.But my main problem is that : the binary tree is not OK.and I will have some empty external nodes.
please help me
thanks
This code doesn’t make a binary tree. It is almost quicksorting (well, you do the pivot, the partition and the recursive call, but don’t put the sorted list together again; hence almost) the original list. Can you specify what you actually are thinking of doing?