57 search results - page 2 / 12 » Minimum Depth Graph Embedding |
SCIA
2007
Springer
13 years 11 months ago
2007
Springer
This paper proposes a fast 3D reconstruction approach for efficiently generating watertight 3D models from multiple short baseline views. Our method is based on the combination of...
SIAMDM
2010
12 years 11 months ago
2010
Abstract. The conjecture of Bollob
CORR
2010
Springer
12 years 11 months ago
2010
Springer
For p 1, we prove that every forest with p trees whose sizes are a1, . . . , ap can be embedded in any graph containing at least p i=1(ai + 1) vertices and having minimum degree ...
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
Let S be a set of points in the plane. What is the minimum possible dilation of all plane graphs that contain S? Even for a set S as simple as five points evenly placed on the ci...
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...