Sciweavers

1633 search results - page 76 / 327
» Planar Map Graphs
Sort
View
IJRA
2011
101views more  IJRA 2011»
13 years 5 months ago
Information Surfing for Radiation Map Building
We develop a control scheme for a group of mobile sensors to map radiation over a given planar polygonal region. The advantage of this methodology is that it provides quick situat...
R. Andres Cortez, Herbert G. Tanner, Ron Lumia, Ch...
ISAAC
2007
Springer
124views Algorithms» more  ISAAC 2007»
14 years 4 months ago
Approximating the Crossing Number of Toroidal Graphs
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
Petr Hlinený, Gelasio Salazar
GD
2008
Springer
13 years 11 months ago
Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights
A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adja...
Chieh-Yu Chen, Ya-Fei Hung, Hsueh-I Lu
ICRA
2010
IEEE
101views Robotics» more  ICRA 2010»
13 years 8 months ago
Distributed pursuit-evasion with limited-visibility sensors via frontier-based exploration
— This paper addresses a novel visibility-based pursuit-evasion problem in which a team of searchers with limited range sensors must coordinate to clear any evaders from an unkno...
Joseph W. Durham, Antonio Franchi, Francesco Bullo
CORR
2008
Springer
72views Education» more  CORR 2008»
13 years 10 months ago
Longest paths in Planar DAGs in Unambiguous Logspace
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...
Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar