3 Points on Line: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:3 Points on Line (Geometric Incidence Problems)}} == Description == Given a set of points in the plane, is there a line that contains at least three of the points? == Related Problems == Related: Point on 3 Lines == Parameters == <pre>n: number of points</pre> == Table of Algorithms == Currently no algorithms in our database for the given problem. == Reductions TO Problem == {| class="wikitable sortable" style="text-align:center;" width=...") |
No edit summary |
||
Line 10: | Line 10: | ||
== Parameters == | == Parameters == | ||
n: number of points | |||
== Table of Algorithms == | == Table of Algorithms == |
Revision as of 12:04, 15 February 2023
Description
Given a set of points in the plane, is there a line that contains at least three of the points?
Related Problems
Related: Point on 3 Lines
Parameters
n: number of points
Table of Algorithms
Currently no algorithms in our database for the given problem.
Reductions TO Problem
Problem | Implication | Year | Citation | Reduction |
---|---|---|---|---|
Point on 3 Lines | if: to-time $N^{2-\epsilon}$ for some $\epsilon > {0}$ then: from-time: $N^{2-\epsilon'}$ for some $\epsilon' > {0}$ |
1995 | https://doi-org.ezproxy.canberra.edu.au/10.1016/0925-7721(95)00022-2 | link |
Reductions FROM Problem
Problem | Implication | Year | Citation | Reduction |
---|---|---|---|---|
3SUM | if: to-time $N^{2-\epsilon}$ for some $\epsilon > {0}$ then: from-time: $N^{2-\epsilon'}$ for some $\epsilon' > {0}$ |
1995 | https://doi-org.ezproxy.canberra.edu.au/10.1016/0925-7721(95)00022-2 | link |
Point on 3 Lines | if: to-time $N^{2-\epsilon}$ for some $\epsilon > {0}$ then: from-time: $N^{2-\epsilon'}$ for some $\epsilon' > {0}$ |
1995 | https://doi-org.ezproxy.canberra.edu.au/10.1016/0925-7721(95)00022-2 | link |