7,649
edits
Changes
Jump to navigation
Jump to search
no edit summary
}}
The objective of this project is come up with a fast, reliable algorithm that finds the smallest circle area that can drawn around N Cartesian points such that each circle contains at least M<N points. This algorithm will be used in an academic paper on [[Urban Start-up Agglomeration]], where the points will represent venture capital backed firms within cities.
=To-Do=
1) Cleanup of geocoding
