Sciweavers

138 search results - page 4 / 28
» K-Guarding Polygons on the Plane
Sort
View
ESA
2009
Springer
139views Algorithms» more  ESA 2009»
14 years 2 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
ICRA
2007
IEEE
132views Robotics» more  ICRA 2007»
14 years 1 months ago
Smooth Feedback for Car-Like Vehicles in Polygonal Environments
— We introduce a method for constructing provably safe smooth feedback laws for car-like robots in obstaclecluttered polygonal environments. The robot is taken to be a point with...
Stephen R. Lindemann, Steven M. LaValle
ESA
2009
Springer
74views Algorithms» more  ESA 2009»
14 years 2 months ago
On Inducing Polygons and Related Problems
Bose et al. [2] asked whether for every simple arrangement A of n lines in the plane there exists a simple n-gon P that induces A by extending every edge of P into a line. We prov...
Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc ...
COCOA
2010
Springer
13 years 5 months ago
Coverage with k-Transmitters in the Presence of Obstacles
Abstract. For a fixed integer k 0, a k-transmitter is an omnidirectional wireless transmitter with an infinite broadcast range that is able to penetrate up to k "walls",...
Brad Ballinger, Nadia Benbernou, Prosenjit Bose, M...
COMGEO
1998
ACM
13 years 7 months ago
The union of moving polygonal pseudodiscs - Combinatorial bounds and applications
Let P be a set of polygonal pseudodiscs in the plane with n edges in total translating with xed velocities in xed directions. We prove that the maximumnumber of combinatorial chan...
Mark de Berg, Hazel Everett, Leonidas J. Guibas