1370 search results - page 104 / 274 » On grids in topological graphs |
173
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
This paper presents a new volumetric stereo algorithm to reconstruct the 3D shape of an arbitrary object. Our method is based on finding the minimum cut in an octahedral graph str...
178
click to vote
GD
2000
Springer
15 years 10 months ago
2000
Springer
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid w...
166
click to vote
GD
1997
Springer
15 years 10 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...
150
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
164
click to vote
ICCS
2009
Springer
16 years 28 days ago
2009
Springer
We present the living application, a method to autonomously manage applications on the grid. During its execution on the grid, the living application makes choices on the resources...