1370 search results - page 140 / 274 » On grids in topological graphs |
173
click to vote
GD
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our ...
159
click to vote
GD
1999
Springer
15 years 10 months ago
1999
Springer
In this paper we address the problem of drawing planar graphs with circular arcs while maintaining good angular resolution and small drawing area. We present a lower bound on the a...
170
click to vote
SCIA
2007
Springer
16 years 17 days ago
2007
Springer
This paper proposes a fast 3D reconstruction approach for efficiently generating watertight 3D models from multiple short baseline views. Our method is based on the combination of...
213
click to vote
IPPS
2007
IEEE
16 years 23 days ago
2007
IEEE
Parallel applications based on irregular meshes make use of mesh partitioners for efficient execution. Some mesh partitioners can map a mesh to a heterogeneous computational plat...
159
click to vote
ICCAD
1999
IEEE
15 years 10 months ago
1999
IEEE
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...