DHT-CAN/Coordinate.java at master · tammykan/DHT-CAN · GitHub

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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
package tw.nccu.edu.dht;

import java.io.Serializable;

public class Coordinate implements Serializable {

	private static final long serialVersionUID = 1L;
	private int lowerx, lowery;
	private int upperx, uppery;
	private int centerx, centery;

	public Coordinate(int lowerx,int lowery,int upperx,int uppery){
		this.lowerx = lowerx;
		this.lowery = lowery;
		this.upperx = upperx;
		this.uppery = uppery;
		this.centerx = (lowerx+upperx)/2;
		this.centery = (lowery+uppery)/2;
	}

	public Coordinate(){
		this(0,0,0,0);
	}

	public void setCoordinate(Coordinate c){
		this.lowerx = c.lowerx;
		this.lowery = c.lowery;
		this.upperx = c.upperx;
		this.uppery = c.uppery;
	}

	public void show(){
		System.out.println("Node Coordinate: ");
		System.out.println("Lower x: " + getLowerx() + " Lower y: " + getLowery());
		System.out.println("Upper x: " + getUpperx() + " Upper y: " + getUppery());
		System.out.println("Center x: " + (getLowerx() + getUpperx())/2);
		System.out.println("Center y: " + (getLowery() + getUppery())/2);
	}

	public boolean isContain(int x, int y){

		if(lowerx <= x && upperx >= x && lowery <= y && uppery >= y)
			return true;
		return false;
	}

	public boolean isLeftNeighbour(Coordinate c){
		if(c.upperx == lowerx && c.uppery > lowery
				&& c.lowery < uppery && c.lowerx < upperx)
			return true;
		return false;
	}

	public boolean isAboveNeighbour(Coordinate c){
		if(c.lowery == uppery && c.upperx > lowerx
				&& c.uppery > lowery && c.lowerx < upperx)
			return true;
		return false;
	}

	public boolean isRightNeighbour(Coordinate c){
		if(c.lowerx == upperx && c.lowery < uppery
				&& c.upperx > lowerx && c.uppery > lowery)
			return true;
		return false;
	}

	public boolean isBelowNeighbour(Coordinate c){
		if(c.uppery == lowery && c.lowerx < upperx
				&& c.lowery < uppery && c.upperx > lowerx)
			return true;
		return false;
	}

	public double area() {
		double area;
		area = (upperx-lowerx) * (uppery-lowery);
		return area;
	}

	public boolean isSameSize(Coordinate c){
		if( ((upperx-lowerx) == (c.upperx-c.lowerx)) && ((uppery-lowery) == (c.uppery-c.lowery)) )
			return true;
		return false;
	}

	public double distance(int x, int y){
		return Math.sqrt(Math.pow(centery-y, 2) + Math.pow(centerx-x, 2));
	}

	public boolean isSplitVertical(){
		if(upperx-lowerx >= uppery-lowery)
			return true;
		return false;
	}

	public Coordinate merge(Coordinate c) {
		Coordinate mergeCoordinate = new Coordinate();
		if(upperx == c.lowerx && uppery == c.uppery && lowery == c.lowery) {
			mergeCoordinate = new Coordinate(lowerx, lowery, c.upperx, uppery);
		}
		else if(lowerx == c.upperx && uppery == c.uppery && lowery == c.lowery) {
			mergeCoordinate = new Coordinate(c.lowerx, lowery, upperx, uppery);
		}
		else if(lowerx == c.lowerx && upperx == c.upperx && uppery == c.lowery) {
			mergeCoordinate = new Coordinate(lowerx, lowery, upperx, c.uppery);
		}
		else if(lowerx == c.lowerx && upperx == c.upperx && lowery == c.uppery) {
			mergeCoordinate = new Coordinate(lowerx, c.lowery, upperx, uppery);
		}
		return mergeCoordinate;
	}

	public void splitVertical(){
		upperx = (lowerx+upperx)/2;
		centerx = (lowerx+upperx)/2;
		centery = (lowery+uppery)/2;
	}

	public void splitHorizontal(){
		uppery = (lowery+uppery)/2;
		centerx = (lowerx+upperx)/2;
		centery = (lowery+uppery)/2;
	}

	public int getLowerx(){
		return lowerx;
	}

	public int getLowery(){
		return lowery;
	}

	public int getUpperx(){
		return upperx;
	}

	public int getUppery(){
		return uppery;
	}
}