Sciweavers

203 search results - page 1 / 41
» Incremental computation of planar maps
Sort
View
SIGGRAPH
1989
ACM
13 years 11 months ago
Incremental computation of planar maps
Michel Gangnet, Jean-Claude Hervé, Thierry ...
WG
2004
Springer
14 years 9 days ago
Planar Graphs, via Well-Orderly Maps and Trees
The family of well-orderly maps is a family of planar maps with the property that every connected planar graph has at least one plane embedding which is a well-orderly map. We show...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...
IROS
2009
IEEE
212views Robotics» more  IROS 2009»
14 years 1 months ago
3D feature based mapping towards mobile robots' enhanced performance in rescue missions
— This paper presents a feature based 3D mapping approach with regard to obtaining compact models of semistructured environments such as partially destroyed buildings where mobil...
Paloma de la Puente, Diego Rodríguez-Losada...
GC
2010
Springer
13 years 5 months ago
Enumerative Properties of Rooted Circuit Maps
In 1966 Barnette introduced a set of graphs, called circuit graphs, which are obtained from 3-connected planar graphs by deleting a vertex. Circuit graphs and 3-connected planar g...
Zhicheng Gao, Han Ren
BMVC
2010
13 years 5 months ago
Incremental Model Selection for Detection and Tracking of Planar Surfaces
Man-made environments are abundant with planar surfaces which have attractive properties and are a prerequisite for a variety of vision tasks. This paper presents an incremental m...
Johann Prankl, Michael Zillich, Bastian Leibe, Mar...