예제 #1
0
 /// <summary>
 /// Minimum Width Algorithm
 /// </summary>
 /// <param name="sender"></param>
 /// <param name="e"></param>
 private void minWidthButton_Click(object sender, EventArgs e)
 {
     cb = new MinimumWidthAlgorithm(this);
     cb.StartAlgorithm();
 }
예제 #2
0
 /// <summary>
 /// Smllest Perimeter
 /// </summary>
 /// <param name="sender"></param>
 /// <param name="e"></param>
 private void minimumPermButton_Click(object sender, EventArgs e)
 {
     cb = new MinimumPerimeterAlgorithm(this);
     cb.StartAlgorithm();
 }
예제 #3
0
 /// <summary>
 /// Intersection of two convex polygons
 /// </summary>
 /// <param name="sender"></param>
 /// <param name="e"></param>
 private void intersectionButton_Click(object sender, EventArgs e)
 {
     cb = new IntersectionAlgorithm(this);
     cb.StartAlgorithm();
 }
예제 #4
0
 /// <summary>
 /// Merge the convex hull of the two polygons
 /// </summary>
 /// <param name="sender"></param>
 /// <param name="e"></param>
 private void mergeConvexHullButton_Click(object sender, EventArgs e)
 {
     cb = new ConvexHullAlgorithm(this);
     cb.StartAlgorithm();
 }
예제 #5
0
 /// <summary>
 /// Smallest Rectangle event handler
 /// </summary>
 /// <param name="sender"></param>
 /// <param name="e"></param>
 private void smallestRectangleButton_Click(object sender, EventArgs e)
 {
     cb = new MinimumAreaAlgorithm(this);
     cb.StartAlgorithm();
 }
예제 #6
0
 /// <summary>
 /// Computes the maximum diameter in O(n) time using Shamox rotating calipers
 /// Use max and min Y values as first pair of support lines
 /// </summary>
 /// <param name="sender"></param>
 /// <param name="e"></param>
 private void maxDiameterButton_Click(object sender, EventArgs e)
 {
     cb = new DiametersAlgorithm(this);
     cb.StartAlgorithm();
 }
예제 #7
0
 /// <summary>
 /// Max distance between two two polygons
 /// </summary>
 /// <param name="sender"></param>
 /// <param name="e"></param>
 private void maxDist2PolyButton_Click(object sender, EventArgs e)
 {
     cb = new MaxDistance2PAlgorithm(this);
     cb.StartAlgorithm();
 }
예제 #8
0
 /// <summary>
 /// Minimum Width Algorithm
 /// </summary>
 /// <param name="sender"></param>
 /// <param name="e"></param>
 private void minWidthButton_Click(object sender, EventArgs e)
 {
     cb = new MinimumWidthAlgorithm(this);
     cb.StartAlgorithm();
 }
예제 #9
0
 /// <summary>
 /// Smallest Rectangle event handler
 /// </summary>
 /// <param name="sender"></param>
 /// <param name="e"></param>
 private void smallestRectangleButton_Click(object sender, EventArgs e)
 {
     cb = new MinimumAreaAlgorithm(this);
     cb.StartAlgorithm();
 }
예제 #10
0
 /// <summary>
 /// Smllest Perimeter
 /// </summary>
 /// <param name="sender"></param>
 /// <param name="e"></param>
 private void minimumPermButton_Click(object sender, EventArgs e)
 {
     cb = new MinimumPerimeterAlgorithm(this);
     cb.StartAlgorithm();
 }
예제 #11
0
 /// <summary>
 /// Merge the convex hull of the two polygons
 /// </summary>
 /// <param name="sender"></param>
 /// <param name="e"></param>
 private void mergeConvexHullButton_Click(object sender, EventArgs e)
 {
     cb = new ConvexHullAlgorithm(this);
     cb.StartAlgorithm();
 }
예제 #12
0
 /// <summary>
 /// Max distance between two two polygons
 /// </summary>
 /// <param name="sender"></param>
 /// <param name="e"></param>
 private void maxDist2PolyButton_Click(object sender, EventArgs e)
 {
     cb = new MaxDistance2PAlgorithm(this);
     cb.StartAlgorithm();
 }
예제 #13
0
 /// <summary>
 /// Computes the maximum diameter in O(n) time using Shamox rotating calipers
 /// Use max and min Y values as first pair of support lines
 /// </summary>
 /// <param name="sender"></param>
 /// <param name="e"></param>
 private void maxDiameterButton_Click(object sender, EventArgs e)
 {
     cb = new DiametersAlgorithm(this);
     cb.StartAlgorithm();
 }
예제 #14
0
 /// <summary>
 /// Intersection of two convex polygons
 /// </summary>
 /// <param name="sender"></param>
 /// <param name="e"></param>
 private void intersectionButton_Click(object sender, EventArgs e)
 {
     cb = new IntersectionAlgorithm(this);
     cb.StartAlgorithm();
 }