1370 search results - page 87 / 274 » On grids in topological graphs |
176
click to vote
DGCI
2003
Springer
15 years 11 months ago
2003
Springer
In order to make image analysis methods more reliable it is important to analyse to what extend shape information is preserved during image digitization. Most existing approaches t...
133
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this paper, we present the first snap-stabilizing message forwarding protocol that uses a number of buffers per node being independent of any global parameter, that is 4 buffers...
140
click to vote
TIP
2008
15 years 6 months ago
2008
Abstract--This correspondence addresses the inversion of 3-D transformation fields, which is a problem that typically arises in image warping problems. A topology preserving parame...
171
click to vote
COMPGEOM
1996
ACM
15 years 10 months ago
1996
ACM
We provideO(n)-timealgorithmsfor constructingthe following types of drawings of n-vertex 3-connectedplanar graphs: 2D convex grid drawings with (3n) (3n=2) area under the edge L1-...
158
click to vote
PAMI
2010
15 years 1 months ago
2010
We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, our main contribution is a thinning paradigm from which we derive three alg...