131 search results - page 4 / 27 » Orthogonal thickness of graphs |
EJC
2010
13 years 7 months ago
2010
Let be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(), whose edges are the pairs of adjacent chambers in , is known t...
COMBINATORICS
2006
13 years 7 months ago
2006
We prove that n+h 4 vertex guards are always sufficient to see the entire interior of an n-vertex orthogonal polygon P with an arbitrary number h of holes provided that there exis...
ISAAC
2005
Springer
14 years 26 days ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
GD
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. In this paper we introduce two novel algorithms for drawing sequences of orthogonal and hierarchical graphs while preserving the mental map. Both algorithms can be parame...
PPL
2000
13 years 7 months ago
2000
In this paper we consider the problem of constructing planar orthogonal grid drawings or more simply, layouts of graphs, with the goal of minimizing the number of bends along the ...