Search

In this report three thinning algorithms are developed: one each for use with rectangular, hexagonal, and triangular arrays. The approach to the development of each algorithm is the same. Pictorial results produced by each of the algorithms are presented and the relative performances of the algorithms are compared. It is found that the algorithm operating with the triangular array is the most sensitive to image irregularities and noise, yet it will yield a thinned image with an overall reduced number of points. It is concluded that the algorithm operating in conjunction with the hexagonal array has features which strike a balance between those of the other two arrays. [ABSTRACT FROM AUTHOR]

Raster scan computer graphics with"real time" character generators have previously been limited to alphanumeric characters. A display has been described which extends the capabilities of this organization to include general graphics. Two fundamentally different scan conversion algorithms which have been developed to support this display are presented. One is most suitable to non- interactive applications and the other to Interactive applications. The algorithms were implemented in Fortran on the CDC6400 computer. Results obtained from the implementations show that the non interactive algorithms can significantly reduce display file storage requirements at little cost in execution time over that of a conventional raster display. The interactive algorithm can improve response time and reduce storage requirements. [ABSTRACT FROM AUTHOR]

There are situations in the natural sciences and medicine (e.g. in electron microscopy and X-ray photography in which it is desirable to estimate the gray levels of a digital picture at the individual points from the sums of the gray levels along straight tines (projections) at a Few angles. Usually, in such situations, the picture is far from determined and the problem is to find the "most representative" picture. Three algorithms are described (all using Monte Carlo methods which were designed to solve this problem. The algorithms are applicable in a large and varied number of fields. The most important uses may he the reconstruction of possibly asymmetric particles from electron micrographs and three-dimensional X-ray analysis. [ABSTRACT FROM AUTHOR]

Describes a reentrant polygon clipping algorithms. Ability of the algorithms to clip polygons against irregular convex plane-faced volumes; Representation of polygons to be clipped; Significance of six-plane truncated pyramid.

Proposes an efficient nonrecursive algorithm for moving any LISP computer program language-type list. Simple linear displacement of the list in which the pointers are transformed by adding or subtracting a given constant; Use of a table, stack or queue to store the correspondence between nodes in the original list.