100 search results - page 2 / 20 » Planar Visibility Counting |
COMPGEOM
2005
ACM
14 years 24 days ago
2005
ACM
CORR
1998
Springer
13 years 10 months ago
1998
Springer
GD
2005
Springer
14 years 4 months ago
2005
Springer
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one co...
GD
2008
Springer
13 years 12 months ago
2008
Springer
A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adja...
ICALP
2003
Springer
14 years 4 months ago
2003
Springer
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...