Sciweavers

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

99

Voted

COMPGEOM
1993
ACM

111views Discrete Geometry» more COMPGEOM 1993»

Can Visibility Graphs be Represented Compactly?

15 years 6 months ago

Can Visibility Graphs be Represented Compactly?

Download www.math.tau.ac.il

Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhas

Real-time Traffic

COMPGEOM 1993 | Discrete Geometry |

claim paper

Related Content

» Characterization of 1 kBar Visibility Trees

» On effective presentation of graph patterns a structural representative approach

» Compact Representation of Sets of Binary Constraints

» Extending Graphical Representations for Compact Closed Categories with Applications to Sym...

» Compact graph representations and parallel connectivity algorithms for massive dynamic net...

» HEXA Compact Data Structures for Faster Packet Processing

» Analytic Variations on the Common Subexpression Problem

» Cost effective dynamic program slicing

» Face Recognition Using a MultiManifold Discriminant Analysis Method

Post Info
More Details (n/a)

Added	09 Aug 2010
Updated	09 Aug 2010
Type	Conference
Year	1993
Where	COMPGEOM
Authors	Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri

Comments (0)