37 search results - page 2 / 8 » Orthogonal Connector Routing |
ICNP
2006
IEEE
13 years 11 months ago
2006
IEEE
— Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts such as coordinate space embedding help reduce the number ...
ICDCSW
2005
IEEE
13 years 11 months ago
2005
IEEE
Smart antennas are expected to enhance scalability in ad hoc networks. This paper at first evaluates three directional MAC protocols, DMAC, MMAC and SWAMP as well as the omni-dir...
DAC
1995
ACM
13 years 8 months ago
1995
ACM
We propose a novel optimization scheme that can improve the routing by reducing a newly observed router decaying effect. A pair of greedy-grow algorithms, each emphasizing a diffe...
GD
1997
Springer
13 years 9 months ago
1997
Springer
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, in particular Kn, with vertices drawn as boxes. It establishes asymptotic lower bounds for the volu...
GD
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. In this paper we present an algorithm for 3-dimensional orthogonal graph drawing based on the movement of vertices from an initial layout along the main diagonal of a cub...