Sciweavers

2 search results - page 1 / 1
» Planar minimally rigid graphs and pseudo-triangulations
Sort
View
COMPGEOM
2003
ACM
13 years 10 months ago
Planar minimally rigid graphs and pseudo-triangulations
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...
Ruth Haas, David Orden, Günter Rote, Francisc...
SIAMDM
2010
149views more  SIAMDM 2010»
13 years 3 months ago
Formal Theory of Noisy Sensor Network Localization
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
Brian D. O. Anderson, Iman Shames, Guoqiang Mao, B...