1949 search results - page 32 / 390 » Random graphs on surfaces |
126
click to vote
VISUALIZATION
2000
IEEE
15 years 8 months ago
2000
IEEE
We present a new approach to surface reconstruction based on the Delaunay complex. First we give a simple and fast algorithm that picks locally a surface at each vertex. For that,...
168
click to vote
EMMCVPR
2005
Springer
15 years 9 months ago
2005
Springer
We consider the use of medial surfaces to represent symmetries of cts. This allows for a qualitative abstraction based on a directed acyclic graph of components and also a degree o...
151
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
In this paper, we propose a high-order graph matching formulation to address non-rigid surface matching. The singleton terms capture the geometric and appearance similarities (e.g...
136
click to vote
CAAN
2007
Springer
15 years 10 months ago
2007
Springer
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...
123
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...