470 search results - page 51 / 94 » Local properties of geometric graphs |
DAGSTUHL
2006
13 years 9 months ago
2006
Assessing the similarity among 3D shapes is a challenging research topic, and effective shape descriptions have to be devised in order to support the matching process. There is a ...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Edge detection in images has been a fundamental problem
in computer vision from its early days. Edge detection
on surfaces, on the other hand, has received much less attention.
...
CG
2004
Springer
13 years 7 months ago
2004
Springer
We present a framework for processing point-based surfaces via partial differential equations (PDEs). Our framework efficiently and effectively brings well-known PDE-based process...
WWW
2004
ACM
14 years 8 months ago
2004
ACM
In this paper, we present a localized Shortest Path Tree (SPT) based algorithm for constructing a sub-network with the minimum-energy property for a given wireless ad hoc network....
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...