Thesis (Ph. D.)--University of Wisconsin--Madison, 1975. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 165-169).

Thesis (M.S.)--Massachusetts Institute of Technology. / "Supported, in part, by Project MAC, an M.I.T. research program." Includes bibliographical references (p. 64).

Thesis (Ph. D.)--University of Cambridge, 1991. / "August 1991"--Cover. Includes bibliographical references.

Thesis (M.S.)--University of Florida, 2001. / Title from first page of PDF file. Document formatted into pages; contains viii, 48 p.; also contains graphics. Vita. Includes bibliographical references (p. 47).

Thesis (Ph. D.)--University of Hong Kong, 2006. / Title proper from title frame. Also available in printed format.

Thesis (Ph. D.)--University of Hong Kong, 2006.

Web grammars are a general and flexible method for "picture" description in computer graphics. They apply the rewriting procedure typical of string grammars to general directed graphs or "webs". An interactive graphical system is implemented to provide an easy and convenient way to manipulate and specify a web in a natural manner. This project is based on a system implemented by Pat Conroy. The system is written in ALGOLW. The graphical terminal used to display the webs is an Adage Graphical Terminal ( AGT for short ) which is connected to a main computer, an IBM 360/67 by telephone lines. There are instruments such as light-pen, function keys, foot pedals and dials to assist the interaction between the user and the AGT. In this project, a solution to the problem of replacing a subweb by another on the display screen is attemped. / Science, Faculty of / Computer Science, Department of / Graduate

Object representation is the backbone of any solid modelling system. Hierarchical spatial decompositions of objects called octrees introduced very efficient algorithms for boolean set operations and some restricted classes of geometric transformations. Linear octrees, a compact encoding of the octrees, result in a significant reduction of storage requirements, and lead simpler algorithms for most modelling operations. This thesis investigates some properties of linear octrees with emphasis on object generation. By interpreting linear octree node digits as binary numbers, some simple conversion and node trimming algorithms are found, which when combined with a node enumeration algorithm, generate the linear octrees of cuboidal volumes efficiently. A simple and uniform approach is devised to perform arbitrary geometric transformations by means of cuboid generation. Experiments shows these algorithms maintain the efficiency of special cases while degrading linearly with the number of intermediate nodes generated. / Science, Faculty of / Computer Science, Department of / Graduate

The following is a study of the problem of computer generation of non-isomorphic regular graphs of degree d on n points. The uork consists of a study of various properties and representations of regular graphs and a discussion of hov these might be useful in solving the isomorphism problem in the computer generation of regular graphs. An algorithm for the generation of regular graphs of degree 3 on n points with a Hamiltonian cycle is presented. The algorithm is not ideal in that it does not generate distinct (ie. non-isomorphic) copies, and so a procedure for detecting graph isomorphism is used to process the list of graphs produced by the algorithm. / Science, Faculty of / Computer Science, Department of / Graduate

The performance of systems which employ a linear transformation and block quantization to encode visual information sources has been investigated. The effect of several relevant design parameters upon the behavior of these systems was examined theoretically. The performance criterion used was the rate measured in bits-per-picture sample required to transmit an image through a noiseless digital channel such that the average distortion in the received picture is less than a specified value. As a measure of image distortion, the mean-squared-error, well-known for its analytical tractability, was used. A second measure of image distortion which incorporates knowledge of the human visual system was examined. The new distortion index proposed by Stockham is expected to correlate well with subjective assessments of picture distortion although no experiments have been performed, as yet, to show this. In order to determine what, if anything, could be learned about this second distortion measure from theoretical considerations alone, a procedure was developed to estimate its value for given bit rates. These values were compared to the mean-squared-error distortion values obtained for the same bit rates in an attempt to gain some insight into the usefulness of the second distortion measure. / Applied Science, Faculty of / Electrical and Computer Engineering, Department of / Graduate