-
Notifications
You must be signed in to change notification settings - Fork 0
/
JarvisMarch.java
53 lines (51 loc) · 1.1 KB
/
JarvisMarch.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
import java.awt.*;
/**
* Created by hepstev on 03.02.16.
*/
public class JarvisMarch {
public static void main(String[] args){
JarvisMarch c=new JarvisMarch();
}
private Point[] p;
private int n;
private int h;
public int computerHull(Point[] p){
this.p =p;
n=p.length;
h=0;
jarvisMarch();
return h;
}
private void jarvisMarch(){
int i =lowestPoint();
do{
exchange(h, i);
i=mostPoint(p[h]);
h++;
}
while(i>0);
}
private int lowestPoint() {
int i, min = 0;
for(i = 1; i<n; i++){
if(p[i].y <p[min].y || p[i].y ==p[min].y && p[i].x < p[min].x){
min=i;
}
}
return min;
}
private int mostPoint(Point q){
int i=0, j;
for(j=1;j<n;j++){
if(p[j] != (p[i])){
i=j;
}
}
return i;
}
private void exchange(int i, int j){
Point t=p[i];
p[i]=p[j];
p[j]=t;
}
}