Sciweavers

31 search results - page 6 / 7
» Degree-constrained orientations of embedded graphs
Sort
View
IJRR
2011
159views more  IJRR 2011»
13 years 23 days ago
Visual-inertial navigation, mapping and localization: A scalable real-time causal approach
We present a model to estimate motion from monocular visual and inertial measurements. We analyze the model and characterize the conditions under which its state is observable, an...
Eagle Jones, Stefano Soatto
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 5 months ago
Complexity dichotomy on partial grid recognition
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
Vinícius G. P. de Sá, Guilherme Dias...
COMPGEOM
2010
ACM
13 years 11 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
EM
2010
155views Management» more  EM 2010»
13 years 5 months ago
Hyperbolic Graphs of Small Complexity
In this paper we enumerate and classify the "simplest" pairs (M, G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the p...
Damian Heard, Craig Hodgson, Bruno Martelli, Carlo...
ENDM
2007
106views more  ENDM 2007»
13 years 5 months ago
Removing Even Crossings on Surfaces
In this paper we investigate how certain results related to the HananiTutte theorem can be extended from the plane to surfaces. We give a simple topological proof that the weak Ha...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...