504 search results - page 42 / 101 » Canonical Graph Shapes |
DSSCV
2005
Springer
14 years 3 months ago
2005
Springer
We show that the pre-symmetry set of a smooth surface in 3-space has the structure of the graph of a function from R2 to R2 in many cases of interest, generalising known results fo...
CVPR
2009
IEEE
15 years 5 months ago
2009
IEEE
We present a fast graph cut algorithm for planar graphs.
It is based on the graph theoretical work [2] and leads to an
efficient method that we apply on shape matching and im-
a...
CVPR
2000
IEEE
14 years 12 months ago
2000
IEEE
There has recently been significant interest in using repions based on abstractions of Blum's skeleton into a graph, for qualitative shape matching. The application of these ...
DAWAK
2007
Springer
14 years 4 months ago
2007
Springer
Representative-based clustering algorithms are quite popular due to their relative high speed and because of their sound theoretical foundation. On the other hand, the clusters the...
DAGSTUHL
2003
13 years 11 months ago
2003
One way to visualize large time-dependent data sets, is by visualization of the evolution of features in these data. The process consists of four steps: feature extraction, featur...