Sciweavers

CORR
2011
Springer
174views Education» more  CORR 2011»
12 years 11 months ago
Lower bounds on the obstacle number of graphs
Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices ...
Padmini Mukkamala, János Pach, Döm&oum...
WG
2010
Springer
13 years 2 months ago
Graphs with Large Obstacle Numbers
Motivated by questions in computer vision and sensor networks, Alpert et al. [3] introduced the following definitions. Given a graph G, an obstacle representation of G is a set of...
Padmini Mukkamala, János Pach, Deniz Sari&o...
EUROCAST
2005
Springer
104views Hardware» more  EUROCAST 2005»
13 years 10 months ago
A Mathematical Formalism for the Evaluation of C-Space for Redundant Robots
Abstract. This paper presents a new general method for obstacle representation in the configuration space (C-space) for redundant robots. The method is based on the analytical dec...
Roberto Therón, Vidal Moreno, Belén ...