Sciweavers

470 search results - page 11 / 94
» Local properties of geometric graphs
Sort
View
ICIP
2009
IEEE
16 years 24 days ago
Exploiting Local Structure For Tracking Plant Cells In Noisy Images
In this paper, we present a local graph matching based method for tracking cells and cell divisions in noisy images. We work with plant cells, where the cells are tightly clustere...
INFOCOM
2012
IEEE
13 years 2 months ago
Low-stretch greedy embedding heuristics
—Greedy embedding is a graph embedding that makes the simple greedy packet forwarding scheme successful for every source-destination pair. It is desirable that graph embeddings a...
Andrej Cvetkovski, Mark Crovella
91
Voted
CVIU
2007
120views more  CVIU 2007»
14 years 11 months ago
A comparison of Gaussian and mean curvature estimation methods on triangular meshes of range image data
Estimating intrinsic geometric properties of a surface from a polygonal mesh obtained from range data is an important stage of numerous algorithms in computer and robot vision, co...
Evgeni Magid, Octavian Soldea, Ehud Rivlin
EJC
2010
14 years 11 months ago
Connectivity of chamber graphs of buildings and related complexes
Let be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(), whose edges are the pairs of adjacent chambers in , is known t...
Anders Björner, Kathrin Vorwerk
ICALP
1992
Springer
15 years 3 months ago
On Nearest-Neighbor Graphs
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
Mike Paterson, F. Frances Yao