Sciweavers

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

61

Voted

CORR
2008
Springer

87views Education» more CORR 2008»

Planar Visibility Counting

15 years 2 months ago

Planar Visibility Counting

Download www2.cs.upb.de

Matthias Fischer, Matthias Hilbig, Claudius Jä

Real-time Traffic

CORR 2008 | Education |

claim paper

Related Content

» Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs

» Weak Visibility of Two Objects in Planar Polygonal Scenes

» Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint

» On Computing the Distinguishing Numbers of Planar Graphs and Beyond a Counting Approach

» Cacheoblivious planar orthogonal range searching and counting

» The Complexity of Planar Counting Problems

» Bar kVisibility Graphs Bounds on the Number of Edges Chromatic Number and Thickness

» Visibility Representations of FourConnected Plane Graphs with Near Optimal Heights

» Generating Labeled Planar Graphs Uniformly at Random

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Matthias Fischer, Matthias Hilbig, Claudius Jähn, Friedhelm Meyer auf der Heide, Martin Ziegler

Comments (0)