Sciweavers

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

30

COMPGEOM
2004
ACM

favoriteEmaildiscussreport

97views Discrete Geometry» more COMPGEOM 2004»

Solution of Scott's problem on the number of directions determined by a point set in 3-space

14 years 4 months ago

Solution of Scott's problem on the number of directions determined by a point set in 3-space

Download www.math.nyu.edu

Let P be a set of n points in Ê3 , not all in a common plane. We solve a problem of Scott (1970) by showing that the connecting lines of P assume at least 2n − 7 diﬀerent directions if n is even and at least 2n − 5 if n is odd. The bound for odd n is sharp.

János Pach, Rom Pinchasi, Micha Sharir

Real-time Traffic

Common Plane | COMPGEOM 2004 |

claim paper

Related Content

» Direct Solutions for Computing Cylinders from Minimal Sets of 3D Points

» Extremal problems on triangle areas in two and three dimensions

» A Novel Parametrization of the PerspectiveThreePoint Problem for a Direct Computation of A...

» Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints

» Online point location in planar arrangements and its applications

» Computing Envelopes in Four Dimensions with Applications

» InteroperabilityCentric Problems New Challenges and Legal Solutions

» On Finding Compromise Solutions in Multiobjective Markov Decision Processes

» Interactive evolutionary multiobjective optimization and decisionmaking using reference di...

Post Info
More Details (n/a)

Added	30 Jun 2010
Updated	30 Jun 2010
Type	Conference
Year	2004
Where	COMPGEOM
Authors	János Pach, Rom Pinchasi, Micha Sharir

Comments (0)