24 search results - page 3 / 5 » Augmenting the Connectivity of Planar and Geometric Graphs |
ISAAC
2003
Springer
13 years 11 months ago
2003
Springer
Let G be an embedded planar graph whose edges may be curves. For two arbitrary points of G, we can compare the length of the shortest path in G connecting them against their Euclid...
COMGEO
2008
ACM
13 years 5 months ago
2008
ACM
Consider a planar straight line graph (PSLG), G, with k connected components, k 2. We show that if no component is a singleton, we can always find a vertex in one component that s...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
IJWMC
2010
13 years 3 months ago
2010
Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...