Computing spanning line segments in three dimensions

A set of spanning line segments ℊ in a polyhedron P preserves the property of intersection; that is, a plane intersects P if and only if it also intersects ℊ. This paper gives a linear time algorithm for constructing ℊ for a polyhedron with N extreme vertices. If N is odd, the algorithm is optimal in yielding [ N /2] + 1 spanning line segments. If N is even, it gives ( N /2) + 1, which is optimal in some cases and nearly optimal in others.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/47136/1/371_2005_Article_BF01782320.pd