3 search results - page 1 / 1 » Disjoint Segments Have Convex Partitions with 2-Edge Connect... |
CCCG
2007
13 years 6 months ago
2007
The empty space around n disjoint line segments in the plane can be partitioned into n + 1 convex faces by extending the segments in some order. The dual graph of such a partition...
COCOON
2009
Springer
13 years 11 months ago
2009
Springer
It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into ...
ENDM
2008
13 years 4 months ago
2008
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...