28 search results - page 3 / 6 » Binary plane partitions for disjoint line segments |
CCCG
2001
15 years 1 months ago
2001
We show that the segment endpoint visibility graph of any finite set of disjoint line segments in the plane admits a simple Hamiltonian polygon, if not all segments are collinear. ...
117
click to vote
ISVD
2007
IEEE
15 years 6 months ago
2007
IEEE
Voronoi diagram for a set of geometric objects is a partition of the plane (or space in higher dimensions) into disjoint regions each dominated by some given object under a predet...
COCOON
2009
Springer
15 years 6 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 ...
CCCG
2006
15 years 1 months ago
2006
Abstract. Given a set P of points and a set S of pairwise disjoint axis-parallel line segments in the plane, we construct a straight line spanning tree T on P such that every segme...
GC
2006
Springer
14 years 11 months ago
2006
Springer
It is shown that for a set S of n pairwise disjoint axis-parallel line segments in the plane there is a simple alternating path of length ( n). This bound is best possible in the...