Sciweavers

92 search results - page 19 / 19
» Stabbers of line segments in the plane
Sort
View
DAM
2011
12 years 11 months ago
Untangling planar graphs from a specified vertex position - Hard cases
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an ...
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Math...
ESA
2009
Springer
139views Algorithms» more  ESA 2009»
13 years 11 months ago
Optimality and Competitiveness of Exploring Polygons by Mobile Robots
Abstract. A mobile robot, represented by a point moving along a polygonal line in the plane, has to explore an unknown polygon and return to the starting point. The robot has a sen...
Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc