Sciweavers

721 search results - page 1 / 145
» Graphs with Large Obstacle Numbers
Sort
View
WG
2010
Springer
13 years 3 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...
CORR
2011
Springer
174views Education» more  CORR 2011»
12 years 12 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...
DCG
2010
101views more  DCG 2010»
13 years 5 months ago
Obstacle Numbers of Graphs
es of Statistics (2); Calculus 2; Multivariable Calculus; Abstract Algebra 1 (2) Research with undergraduate students:
Hannah Alpert, Christina Koch, Joshua D. Laison
IWCMC
2006
ACM
13 years 11 months ago
Distributed obstacle localization in large wireless sensor networks
Obstacles are but pleasing for many aspects of large realworld sensor networks. Among other things, the presence of obstacles distort the sensor node localization process and migh...
Frank Reichenbach, Ralf Salomon, Dirk Timmermann
TCAD
2008
195views more  TCAD 2008»
13 years 4 months ago
Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...
Chung-Wei Lin, Shih-Lun Huang, Kai-Chi Hsu, Meng-X...