Sciweavers

Share
JGT
2006
73views more  JGT 2006»
9 years 1 months ago
Nearly light cycles in embedded graphs and crossing-critical graphs
We find a lower bound for the proportion of face boundaries of an embedded graph that are nearly
Mario Lomelí, Gelasio Salazar
DM
2007
103views more  DM 2007»
9 years 1 months ago
Minimum cycle bases of graphs on surfaces
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a sufficient and necessary condition for a set of facial cycles to be contained in ...
Han Ren, Mo Deng
CATS
2008
9 years 3 months ago
An ILP for the metro-line crossing problem
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
Matthew Asquith, Joachim Gudmundsson, Damian Merri...
CVPR
2006
IEEE
10 years 3 months ago
Hierarchical Volumetric Multi-view Stereo Reconstruction of Manifold Surfaces based on Dual Graph Embedding
This paper presents a new volumetric stereo algorithm to reconstruct the 3D shape of an arbitrary object. Our method is based on finding the minimum cut in an octahedral graph str...
Alexander Hornung, Leif Kobbelt
books