203 search results - page 2 / 41 » Incremental computation of planar maps |
BMVC
2010
13 years 5 months ago
2010
Mapping planar structure in vision-based SLAM can increase robustness and significantly improve efficiency of map representation. However, previous systems have implemented planar...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
A vertex k-labeling of graph G is distinguishing if the only automorphism that preserves the labels of G is the identity map. The distinguishing number of G, D(G), is the smallest...
GD
2007
Springer
14 years 1 months ago
2007
Springer
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this ...
GD
1999
Springer
13 years 11 months ago
1999
Springer
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...
BMVC
1998
13 years 8 months ago
1998
In this paper, we discuss a method for representing and matching planar curves. The technique is based on using calculations from concentric circles to represent each curve by two...