Sciweavers

71
Voted
COCOON
2009
Springer
15 years 3 months ago
Convex Partitions with 2-Edge Connected Dual Graphs
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 ...
Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaqu...