Sciweavers

504 search results - page 41 / 101
» Canonical Graph Shapes
Sort
View
3DPVT
2004
IEEE
188views Visualization» more  3DPVT 2004»
14 years 1 months ago
3D Shape Registration using Regularized Medial Scaffolds
This paper proposes a novel method for global registration based on matching 3D medial structures of unorganized point clouds or triangulated meshes. Most practical known methods ...
Ming-Ching Chang, Frederic F. Leymarie, Benjamin B...
GD
2009
Springer
14 years 2 months ago
Fast Edge-Routing for Large Graphs
To produce high quality drawings of graphs with nodes drawn as shapes it is important to find routes for the edges which do not intersect node boundaries. Recent work in this area...
Tim Dwyer, Lev Nachmanson
BILDMED
2006
13 years 11 months ago
Graph-Based Quantification of Astrocytes
Astroglial cells in the central nervous system (CNS) are able to change their morphology and shape after different kinds of stimuli. We have developed a method for the structural d...
Ulf-Dietrich Braumann, Heike Franke, Jan Hengstler...
CIKM
2006
Springer
14 years 1 months ago
On the structural properties of massive telecom call graphs: findings and implications
With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customers. Toward ...
Amit Anil Nanavati, Siva Gurumurthy, Gautam Das, D...
CVPR
2004
IEEE
14 years 12 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell