3471 search results - page 1 / 695 » Obstacle Numbers of Graphs |
CORR
2011
Springer
13 years 9 days ago
2011
Springer
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 ...
WG
2010
Springer
13 years 3 months ago
2010
Springer
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...
DCG
2010
13 years 5 months ago
2010
es of Statistics (2); Calculus 2; Multivariable Calculus; Abstract Algebra 1 (2) Research with undergraduate students:
WADS
2007
Springer
13 years 11 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
COMPGEOM
1990
ACM
13 years 9 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...