In general, finding a line stabber for a family of <italic>n</italic> objects in the plane takes Ï‰(<italic>n</italic> log <italic>n</italic>) time. However, we show how to find a line stabber for aâ€¦ (More)

Given a family of objecte in the plane, the line transversal problem is to compute a line that intersects every member of the family. In this paper we examine a variation of the line transversalâ€¦ (More)

We solve the problem of computing the shortest closed path inside a given polygon which visits every edge at least once (Aquarium Z{eeperâ€™s Tour). For convex polygons, we present a linear-timeâ€¦ (More)

Many of the fundamental problems in computer graphics involve the notion of visibility. In one approach to the hiddensurface problem, priorities are assigned to the faces of a scene. A realisticâ€¦ (More)

Many of Ule fundamental problems in computer graphics involve Ute notion of visibility. In one approach to Ute hidden-surface problem, priorities are assigned to Ute faces of a scene. A realisticâ€¦ (More)

Given a family of objects in the plane, the line transversal problem is to compute a line that intersects every member of the family. In this paper we examine a variation of the line transversalâ€¦ (More)