Algorithms/JavaAlgorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update SkylineAlgorithm.java

Browse Source
This commit is contained in:
Libin Yang 2019-01-15 19:54:43 +08:00 committed by GitHub
parent 8f78a3fe6c
commit 0a3717957c
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 74 additions and 79 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

121
divideconquer/SkylineAlgorithm.java
View File

@ -1,24 +1,20 @@
package skylinealgorithm;
import java.util.ArrayList;
import java.util.Comparator;
/**
*
* @author dimgrichr
*
* <p>
* Space complexity: O(n)
* Time complexity: O(nlogn), because it is a divide and conquer algorithm
*/
public class SkylineAlgorithm {
private ArrayList<Point> points;
/**
* Main constructor of the application.
* ArrayList points gets created, which represents the sum of all edges.
*/
public SkylineAlgorithm(){
public SkylineAlgorithm() {
points = new ArrayList<>();
}
@ -26,7 +22,7 @@ public class SkylineAlgorithm {
/**
* @return points, the ArrayList that includes all points.
*/
public ArrayList<Point> getPoints(){
public ArrayList<Point> getPoints() {
return points;
}
@ -42,48 +38,44 @@ public class SkylineAlgorithm {
* with arguments the corresponding half of the initial ArrayList each time.
* Once the flashback has ended, the function produceFinalSkyLine gets called,
* in order to produce the final skyline, and return it.
*
* @param list, the initial list of points
* @return leftSkyLine, the combination of first half's and second half's skyline
* @see Point
* @see produceFinalSkyLine
*/
public ArrayList<Point> produceSubSkyLines(ArrayList<Point> list){
public ArrayList<Point> produceSubSkyLines(ArrayList<Point> list) {
//part where function exits flashback
// part where function exits flashback
int size = list.size();
if(size == 1){
if (size == 1) {
return list;
}
else if(size==2){
if(list.get(0).dominates(list.get(1))){
} else if (size == 2) {
if (list.get(0).dominates(list.get(1))) {
list.remove(1);
}
else{
if(list.get(1).dominates(list.get(0))){
} else {
if (list.get(1).dominates(list.get(0))) {
list.remove(0);
}
}
return list;
}
//recursive part of the function
ArrayList<Point> leftHalf=new ArrayList<>();
ArrayList<Point> rightHalf=new ArrayList<>();
for (int i=0;i<list.size();i++){
if(i<list.size()/2){
// recursive part of the function
ArrayList<Point> leftHalf = new ArrayList<>();
ArrayList<Point> rightHalf = new ArrayList<>();
for (int i = 0; i < list.size(); i++) {
if (i < list.size() / 2) {
leftHalf.add(list.get(i));
}
else{
} else {
rightHalf.add(list.get(i));
}
}
ArrayList<Point> leftSubSkyLine=new ArrayList<>();
ArrayList<Point> rightSubSkyLine=new ArrayList<>();
leftSubSkyLine=produceSubSkyLines(leftHalf);
rightSubSkyLine=produceSubSkyLines(rightHalf);
ArrayList<Point> leftSubSkyLine = produceSubSkyLines(leftHalf);
ArrayList<Point> rightSubSkyLine= produceSubSkyLines(rightHalf);
//skyline is produced
return produceFinalSkyLine(leftSubSkyLine,rightSubSkyLine);
// skyline is produced
return produceFinalSkyLine(leftSubSkyLine, rightSubSkyLine);
}
@ -97,94 +89,97 @@ public class SkylineAlgorithm {
* are dominated, so they are not part of the final skyline.
* Finally, the "cleaned" first half's and second half's skylines, are combined,
* producing the final skyline, which is returned.
* @param left the skyline of the left part of points
*
* @param left the skyline of the left part of points
* @param right the skyline of the right part of points
* @return left the final skyline
*/
public ArrayList<Point> produceFinalSkyLine(ArrayList<Point> left, ArrayList<Point> right){
public ArrayList<Point> produceFinalSkyLine(ArrayList<Point> left, ArrayList<Point> right) {
//dominated points of ArrayList left are removed
for(int i=0;i<left.size()-1;i++){
if(left.get(i).x==left.get(i+1).x && left.get(i).y>left.get(i+1).y){
// dominated points of ArrayList left are removed
for (int i = 0; i < left.size() - 1; i++) {
if (left.get(i).x == left.get(i + 1).x && left.get(i).y > left.get(i + 1).y) {
left.remove(i);
i--;
}
}
//minimum y-value is found
int min=left.get(0).y;
for(int i=1;i<left.size();i++){
if(min>left.get(i).y){
// minimum y-value is found
int min = left.get(0).y;
for (int i = 1; i < left.size(); i++) {
if (min > left.get(i).y) {
min = left.get(i).y;
if(min==1){
i=left.size();
if (min == 1) {
i = left.size();
}
}
}
//dominated points of ArrayList right are removed
for(int i=0;i<right.size();i++){
if(right.get(i).y>=min){
// dominated points of ArrayList right are removed
for (int i = 0; i < right.size(); i++) {
if (right.get(i).y >= min) {
right.remove(i);
i--;
}
}
//final skyline found and returned
// final skyline found and returned
left.addAll(right);
return left;
}
public static class Point{
public static class Point {
private int x;
private int y;
/**
* The main constructor of Point Class, used to represent the 2 Dimension points.
*
* @param x the point's x-value.
* @param y the point's y-value.
*/
public Point(int x, int y){
this.x=x;
this.y=y;
public Point(int x, int y) {
this.x = x;
this.y = y;
}
/**
* @return x, the x-value
*/
public int getX(){
public int getX() {
return x;
}
/**
* @return y, the y-value
*/
public int getY(){
public int getY() {
return y;
}
/**
* Based on the skyline theory,
* it checks if the point that calls the function dominates the argument point.
*
* @param p1 the point that is compared
* @return true if the point wich calls the function dominates p1
* false otherwise.
* false otherwise.
*/
public boolean dominates(Point p1){
//checks if p1 is dominated
if((this.x<p1.x && this.y<=p1.y) || (this.x<=p1.x && this.y<p1.y)){
return true;
}
return false;
public boolean dominates(Point p1) {
// checks if p1 is dominated
return (this.x < p1.x && this.y <= p1.y) || (this.x <= p1.x && this.y < p1.y);
}
}
/**
* It is used to compare the 2 Dimension points,
* based on their x-values, in order get sorted later.
*/
class XComparator implements Comparator<Point> {
@Override
public int compare(Point a, Point b) {
return a.x < b.x ? -1 : a.x == b.x ? 0 : 1;
}
@Override
public int compare(Point a, Point b) {
return Integer.compare(a.x, b.x);
}
}
}