Sciweavers

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

8

FOCS
2000
IEEE

favoriteEmaildiscussreport

102views Theoretical Computer Science» more FOCS 2000»

On the boundary complexity of the union of fat triangles

13 years 8 months ago

On the boundary complexity of the union of fat triangles

Download www.math.nyu.edu

János Pach, Gábor Tardos

Real-time Traffic

FOCS 2000 | Theoretical Computer Science |

claim paper

Related Content

» Epsilon nets and union complexity

» Better bounds on the union complexity of locally fat objects

» The complexity of flow on fat terrains and its ioefficient computation

» Between umbra and penumbra

» Extension of a theorem of Whitney

Post Info
More Details (n/a)

Added	31 Jul 2010
Updated	31 Jul 2010
Type	Conference
Year	2000
Where	FOCS
Authors	János Pach, Gábor Tardos

Comments (0)