62 search results - page 3 / 13 » Triangulations of Line Segment Sets in the Plane |
DCG
2008
13 years 7 months ago
2008
The visibility graph V(X) of a discrete point set X R2 has vertex set X and an edge xy for every two points x, y X whenever there is no other point in X on the line segment betw...
CCCG
2001
13 years 8 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. ...
GC
2006
Springer
13 years 7 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...
CCCG
2007
13 years 9 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...
COMGEO
2008
ACM
13 years 7 months ago
2008
ACM
Given S1, a finite set of points in the plane, we define a sequence of point sets Si as follows: With Si already determined, let Li be the set of all the line segments connecting ...