Sciweavers

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

8

COMPGEOM
2003
ACM

favoriteEmaildiscussreport

107views Discrete Geometry» more COMPGEOM 2003»

A tight bound for the number of different directions in three dimensions

13 years 10 months ago

A tight bound for the number of different directions in three dimensions

Download www.math.technion.ac.il

János Pach, Rom Pinchasi, Micha Sharir

Real-time Traffic

COMPGEOM 2003 |

claim paper

Related Content

» Extremal problems on triangle areas in two and three dimensions

» On the Quantum Query Complexity of Local Search in Two and Three Dimensions

» Path Layout on Tree Networks Bounds in Different Label Switching Models

» The Bichromatic Rectangle Problem in High Dimensions

» Relating Differential Distribution Tables to Other Properties of of Substitution Boxes

» Scalable Multivariate Volume Visualization and Analysis Based on Dimension Projection and ...

» On bounding the delay of a critical path

» Network Coding for Computing CutSet Bounds

» Coloring Octrees

Post Info
More Details (n/a)

Added	05 Jul 2010
Updated	05 Jul 2010
Type	Conference
Year	2003
Where	COMPGEOM
Authors	János Pach, Rom Pinchasi, Micha Sharir

Comments (0)