26 search results - page 1 / 6 » Shifting Strategy for Geometric Graphs without Geometry |
88
Voted
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
SIAMDM
2010
14 years 4 months ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
ICRA
2007
IEEE
15 years 3 months ago
2007
IEEE
— The paper focuses on leader-follower formations of nonholonomic mobile robots. A formation control alternative to those existing in the literature is introduced. We show that t...
COMPGEOM
2004
ACM
15 years 2 months ago
2004
ACM
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
ESA
1998
Springer
15 years 1 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...