Enclosing Circle Algorithm (Rework) - Revision history

Ed at 17:47, 21 September 2020

2020-09-21T17:47:36Z

Ed at 17:34, 21 September 2020

2020-09-21T17:34:31Z

Ed at 17:19, 20 September 2020

2020-09-20T17:19:58Z

Ed at 17:12, 20 September 2020

2020-09-20T17:12:11Z

MichelleH at 16:38, 28 November 2017

2017-11-28T16:38:43Z

MichelleH at 16:05, 16 November 2017

2017-11-16T16:05:56Z

MichelleH at 16:21, 14 November 2017

2017-11-14T16:21:45Z

MichelleH at 15:01, 31 October 2017

2017-10-31T15:01:00Z

MichelleH at 15:00, 31 October 2017

2017-10-31T15:00:12Z

Ed at 19:17, 21 August 2017

2017-08-21T19:17:45Z

@@ Line 1: / Line 1: @@
 {{Project
-|Has project output=
+|Has project output=Tool
 |Has sponsor=McNair Center
 |Has title=Enclosing Circle Algorithm (Rework)

@@ Line 1: / Line 1: @@
 {{Project
 |Has sponsor=McNair Center
 |Has title=Enclosing Circle Algorithm (Rework)

@@ Line 1: / Line 1: @@
 {{Project
 |Has title=Enclosing Circle Algorithm (Rework)
 |Has owner=Abhijit Brahme,

@@ Line 1: / Line 1: @@
-{{McNair Projects
+{{Project
 |Has title=Enclosing Circle Algorithm (Rework)
 |Has owner=Abhijit Brahme,

@@ Line 48: / Line 48: @@
 The K-Means based algorithm returns the optimal solution (left), and faster. <br>
 [[File:houstonk.png]] [[File:houstonp.png]]
 == Benefits ==

@@ Line 4: / Line 4: @@
 |Has keywords=Tool
 |Has project status=Active
-|Does subsume=Enclosing Circle Algorithm,
+|Does subsume=Enclosing Circle Algorithm, Enclosing Circle Algorithm (Plotting),
 }}
 =K-Means Based Algorithm=

@@ Line 1: / Line 1: @@
 =K-Means Based Algorithm=
 ==Location==
@@ Line 5: / Line 11: @@
 ==Explanation==
-The algorithm relies on an object oriented implementation of a "cluster". <br>
+The algorithm relies on an object-oriented implementation of a "cluster". <br>
 Each "cluster" has the following associated with it: <br>
 . area of minimum circle enclosing points in the cluster
@@ Line 33: / Line 39: @@
 '''Runtime:'''
 The runtime of the minimum enclosing circle is O(n), and the runtime of constrained k-means depends on k itself. Here, the value of k is proportional to the total number of points. <br>
-We would expect the algorithm to slow as the number of points increase. For reference, a set of 80 points with n =3, took about 30 minutes, with number of iterations at 100. <br>
+We would expect the algorithm to slow as the number of points increase. For reference, a set of 80 points with n =3, took about 30 minutes, with the number of iterations at 100. <br>
-Further improvements could implement an early-stopping method to converge to a local optima. <br>
+Further improvements could implement an early-stopping method to converge to a local optimum. <br>
 [[File:runtime.png]]
@@ Line 43: / Line 49: @@
 == Step By Step Use==
 . The file "vc_circles.py" contains the main script, "master_circles", which takes in the following
-    a. "textfile", which is the filepath of the text data to read in. It must have fields "lattitude',"longitude","city","datefirstinv"
+    a. "textfile", which is the filepath of the text data to read in. It must have fields "latitude',"longitude","city","datefirstinv"
     b. "n", which is the number of points to include in each circle
-    c. "iterations", the number of iterations to try and find a local optimum. Large numbers will slow the run time.
+    c. "iterations", the number of iterations to try and find a local optimum. Large numbers will slow the runtime.
-    d. "basefn", the base file path of where to store the circles and points for each city,year pair <br>
+    d. "basefn", the base file path of where to store the circles and points for each city, year pair <br>
          an example: "C:\\Users\\Name\\Documents" <br>
          the function will add on the city,year to this base file name and save it to this file directory <br>
@@ Line 65: / Line 71: @@
 Is more accurate than Logical Enclosing Circle. <br>
 Can plot to google maps. <br>
-Will return a tab delim text file of the following fields: city,year,total area <br>
+Will return a tab delim text file of the following fields: city, year, total area <br>
 Good for a large number of points <br>
@@ Line 113: / Line 119: @@
 For a small number of points (i.e., <7), this is OKAY to use. <br>
 However, it becomes extremely slow as the number of points increases. <br>
-The Julia/Python code does not have the capability to plot to google maps, but will plot to a normal figure. <br>
+The Julia/Python code does not have the capability to plot to google maps but will plot to a normal figure. <br>
 (will work on adding this implementation, if the need arises)
 [[Category:Internal]]

← Older revision		Revision as of 19:17, 21 August 2017
Line 115:		Line 115:
	The Julia/Python code does not have the capability to plot to google maps, but will plot to a normal figure. <br>		The Julia/Python code does not have the capability to plot to google maps, but will plot to a normal figure. <br>
	(will work on adding this implementation, if the need arises)		(will work on adding this implementation, if the need arises)
		+
		+	[[Category:Internal]]