Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

CORR
2011
Springer

favoriteEmaildiscussreport

138views Education» more CORR 2011»

Many collinear k-tuples with no k+1 collinear points

13 years 2 months ago

Many collinear k-tuples with no k+1 collinear points

Download www.inf.ethz.ch

For every k > 3, we give a construction of planar point sets with many collinear k-tuples and no collinear (k + 1)-tuples.

József Solymosi, Milos Stojakovic

Real-time Traffic

CORR 2011 | Education | Planar Point |

claim paper

Related Content

» Every Large Point Set contains Many Collinear Points or an Empty Pentagon

» Egomotion Estimation Using Quadruples of Collinear Image Points

» On distinct distances among points in general position and other related problems

» Approximation Algorithms for the Minimum Bends Traveling Salesman Problem

Post Info
More Details (n/a)

Added	20 Aug 2011
Updated	20 Aug 2011
Type	Journal
Year	2011
Where	CORR
Authors	József Solymosi, Milos Stojakovic

Comments (0)