Display of Visible Edges of a Set of Convex Polygons

We present an efficient algorithm for computing visible boundary edges of a set of m nonoverlapping convex polygons. The algorithm runs in time O(m log m + Σ m i=1 log n i + F), where n i is the number of vertices of polygon i and F the complexity of the visible scene. The method can be applied to solve three dimensional hidden-surface problem based on scan-line approach, namely, each scan-line plane intersects a set of objects in three-dimensional space and yields a set of nonoverlapping convex polygons.