Point on 3 Lines (Geometric Incidence Problems)

From Algorithm Wiki
Revision as of 11:28, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Point on 3 Lines (Geometric Incidence Problems)}} == Description == Given a set of lines in the plane, is there a point that lies on at least three of them? == Related Problems == Related: 3 Points on Line == Parameters == <pre>n: number of lines</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="100%"...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Description

Given a set of lines in the plane, is there a point that lies on at least three of them?

Related Problems

Related: 3 Points on Line

Parameters

n: number of lines

Table of Algorithms

Currently no algorithms in our database for the given problem.

Reductions TO Problem

Problem Implication Year Citation Reduction
3 Points on Line 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
3 Points on Line 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