this is for holding javascript data
Xavier Holt added Line_of_Maximum_Points_This__.md
about 8 years ago
Commit id: a05f4ac43be3780eed3870df2fa6b51d8e751cf9
deletions | additions
diff --git a/Line_of_Maximum_Points_This__.md b/Line_of_Maximum_Points_This__.md
new file mode 100644
index 0000000..9206c42
--- /dev/null
+++ b/Line_of_Maximum_Points_This__.md
...
# Line of Maximum Points
This problem reduces to finding the point in the dual that has the maximum number of intersecting lines. This requires \(O(n)\) to transform the problem into the dual and then \(O(n^2)\) to find all points of intersection and keep track of the maximum number of lines. Once we have found the point we return its dual -- a line in the original space. \(O(n^2)\) run-time total.
## Correctedness
- duality
