A Visible Surface Algorithm by Using the Segment Chain Method

Abstract

This paper presents a fast visible surface algorithm for free form bodies. Conventional algorithms for such objects require a lot of computing time as well as much memory capacity. The proposed algorithm approximates the objects with many small triangles. It makes use of a special triangle data structure which preserves topological information between neighboring triangles and requires comparatively small memory storage. By employing the segment chain method, the algorithm exhibits much faster characteristics compared with the Watkins' algorithm.