-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
9 changed files
with
116 additions
and
319 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,33 +1,36 @@ | ||
package Control; | ||
|
||
import Model.SmallestEnclosingCirlceAlgorithm1; | ||
import Model.FarthestNeighborVoronoiAlgorithm2; | ||
import Model.NearestNeighborVoronoiAlgorithm3; | ||
import Model.VoronoiAlgorithm2and3; | ||
import Model.DataBase; | ||
import Model.GrahamScan; | ||
|
||
public class AlgorithmsHandler | ||
{ | ||
private GrahamScan grahamScan; | ||
private SmallestEnclosingCirlceAlgorithm1 algorithm1; | ||
private FarthestNeighborVoronoiAlgorithm2 algorithm2; | ||
private NearestNeighborVoronoiAlgorithm3 algorithm3; | ||
private VoronoiAlgorithm2and3 nearestNeighbor; | ||
private VoronoiAlgorithm2and3 farthestNeighbor; | ||
private DataBase dataBase; | ||
|
||
public AlgorithmsHandler() | ||
{ | ||
dataBase = DataBase.getInstance(); | ||
dataBase.createListOfKandE(); | ||
|
||
grahamScan = new GrahamScan(); | ||
grahamScan = new GrahamScan(); | ||
grahamScan.initialize(); | ||
|
||
algorithm1 = new SmallestEnclosingCirlceAlgorithm1(); | ||
dataBase.prepareForAlgorithm(0); | ||
algorithm1.computeSmallestEnclosingCircle(); | ||
|
||
// algorithm2 = new FarthestNeighborVoronoiAlgorithm2(); | ||
// algorithm2.computeFarthestNeighborVoronoiDiagram(); | ||
nearestNeighbor = new VoronoiAlgorithm2and3(); | ||
dataBase.prepareForAlgorithm(1); | ||
nearestNeighbor.computeVoronoiDiagram(); | ||
|
||
algorithm3 = new NearestNeighborVoronoiAlgorithm3(); | ||
algorithm3.computeNearestNeighborVoronoiDiagram(); | ||
farthestNeighbor = new VoronoiAlgorithm2and3(); | ||
dataBase.prepareForAlgorithm(2); | ||
farthestNeighbor.computeVoronoiDiagram(); | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.