Abstract: A relatively low cost, high speed search processor for efficiently scanning, inserting, and clearing certain data in an ordered linked list of data regarding a plurality of video scan line segments, which segments define mathematical elements (e.g. polygons) and corresponding portions of a three dimensional image. Data items containing information regarding the starting coordinates of the segments of a scan line are encoded and stored in the linked list according to the magnitudes thereof. The present search processor is adapted to read a new data entry to the linked list which is representative of the magnitude of a scan line segment starting coordinate and rapidly search the existing data items of the linked list to determine a particular location in the list at which to insert the new data entry, depending upon the magnitude of the scan line segment starting coordinate thereof relative to the magnitudes of the respective scan line segment starting coordinates of other items in the list.

Abstract: A high speed hidden surface processor capable of operating in real time and suitable for interaction with a computer-generated imagery or computer graphics system, whereby a realistic three-dimensional scene can be projected on a two-dimensional video display. The scene is formed by one or more polygons that are visible from an arbitrary viewpoint. The present hidden surface processor employs a hidden surface algorithm, such that certain polygons or portions of polygons, which polygons are obscured by other polygons lying closer to the viewpoint, are removed or truncated. Ordered linked lists of scan line data corresponding to the surfaces of the visible polygons are assembled and stored, so that the complete scene may be subsequently displayed with increased speed and minimized hardware implementation costs.