The basic building blockss of all graphical output are primitives such as polyline, polymarker, text, cell array and fill area. These primitives have additional data associated with them to render visual effect on the display surface of a workstation. I have explored and analyzed these primitives and implemented them by routines written in C language for IBM and IBM Compatible Personal Computers. Some of the algoriths for these routines were integrated and implemented in the Extensible Graphics Software(EGS). EGS is a prototype graphics system developed by the faculty and students of Ball State University to study and research graphics systems.I have created a font for English alphabets and digit characters. The font and any algorithms created in this thesis would be included and implemented for further development of EGS.An effective attempt is made in this thesis to show how a graphics system could be developed with a minimal dependency on hardware of computers. / Department of Computer Science

This dissertation is concerned with the representation of visual knowledge. Image features often have many different local interpretations. As a result, visual interpretations are often ambiguous and hypothetical. In many model-based vision systems the problem of representing ambiguous and hypothetical interpretations is not very specifically addressed. Generally, specialization hierarchies are used to suppress a potential explosion in local interpretations. Such a solution has problems, as many local interpretations cannot be represented by a single hierarchy. As well, ambiguous and hypothetical interpretations tend to be represented along more than one knowledge representation dimension limiting modularity in representation and control. In this dissertation a better solution is proposed. Classes of objects which have local features with similar appearance in the image are represented by discrimination graphs. Such graphs are directed and acyclic. Their leaves represent classes of elementary objects. All other nodes represent abstract (and sometimes unnatural) classes of objects, which intensionally represent the set of elementary object classes that descend from them. Rather than interpreting each image feature as an elementary object, we use the abstract class that represents the complete set of possible (elementary) objects. Following the principle of least commitment, the interpretation of each image feature is repeatedly forced into more restrictive classes as the context for the image feature is expanded, until the image no longer provides subclassification information. This approach is called discrimination vision, and it has several attractive features. First, hypothetical and ambiguous interpretations can be represented along one knowledge representation dimension. Second, the number of hypotheses represented for a single image feature can be kept small. Third, in an interpretation graph competing hypotheses can be represented in the domain of a single variable. This often eliminates the need for restructuring the graph when a hypothesis is invalidated. Fourth, the problem of resolving ambiguity can be treated as a constraint satisfaction problem which is a well researched problem in Computational Vision. Our system has been implemented as Mapsee-3, a program for interpreting sketch maps. A hierarchical arc consistency algorithm has been used to deal with the inherently hierarchical discrimination graphs. Experimental data show that, for the domain implemented, this algorithm is more efficient than standard arc consistency algorithms. / Science, Faculty of / Computer Science, Department of / Graduate

This thesis describes the process of writing a software application geared toward developing computer graphics in the Windows environment. The code is written using Visual C++ and the Microsoft Foundation Classes (MFC). As an illustration of this process we will walk through the development of a software application. This application will allow a user to create and edit an image composed of simple line graphics and geometric shapes. The user can select drawing colors, select drawing styles, and do area filling. This application also illustrates the use of menus and dialog boxes. / Department of Computer Science

Typescript (photocopy). / Digitized by Kansas Correctional Industries / Department: Computer Science.

An often overlooked area of graphics is the ability of application programs to create graphical images. Many programs exist which allow creation interactively, but few offer the same ability for noninteractive application programs. By allowing an application program to create graphical images more user friendly programs may be created by programmers. / Department of Computer Science

This Creative Project has investigated current methods being used to produce computer animation. This investigation has resulted in the creation of a computer rendering program capable of generating animation. In order for the program to be able to execute though, a model of the object to be viewed must first be specified. This is done by assembling together a series of graphic primitives that when viewed collectively, form the desired model. Next, the rendering software is told where to point an imaginary camera in space. This camera is used to focus the image found in the viewfinder onto the computer monitor. Lastly, the imaginary camera is provided with a three dimensional path to follow as it tracks its way through space. By combining this data with the rendering software, a person viewing the resulting computer animation is able to interact with the computer model. / Department of Computer Science

A model to enable a graphics presentation of an experiment has been developed. The model was developed specifically for experiments run on a shake table for earthquake simulating tests but could be used for any experiment that involves movement and instrumentation. By integrating the results obtained from the instruments used during an experiment it is possible to display, on a computer screen, the motion of the model being tested. By use of visualization techniques it is possible to obtain a graphical representation of all the instruments being used and thereby producing a picture of the entire experiment. / Science, Faculty of / Computer Science, Department of / Graduate

Chow, Yuk Pui. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2010. / Includes bibliographical references (leaves 83-87). / Abstracts in English and Chinese. / Chapter 1. --- Introduction --- p.13-16 / Chapter 1.1. --- Motivation --- p.13 / Chapter 1.2 --- Objectives --- p.14-15 / Chapter 1.3 --- Thesis Organization --- p.16 / Chapter 2. --- Related Works --- p.17-24 / Chapter 2.1 --- Axial and the Free Form Deformation --- p.17 / Chapter 2.1.1 --- The Free-Form Deformation --- p.18 / Chapter 2.1.2 --- The Lattice-based Representation --- p.18 / Chapter 2.1.3 --- The Axial Deformation --- p.19-20 / Chapter 2.1.4 --- Curve Pair-based Representation --- p.21-22 / Chapter 2.2 --- Self Intersection Detection --- p.23-24 / Chapter 3. --- Axial Deformation with Controllable LCFs --- p.25-46 / Chapter 3.1 --- Related Methods --- p.25 / Chapter 3.2 --- Axial Space --- p.26-27 / Chapter 3.3 --- Definition of Local Coordinate Frame --- p.28-29 / Chapter 3.4 --- Constructing Axial Curve with LCFs --- p.30 / Chapter 3.5 --- Point Projection Method --- p.31-32 / Chapter 3.5.1 --- Optimum Reference Axial Curve Point --- p.33 / Chapter 3.6 --- Advantages using LCFs in Axial Deformation --- p.34 / Chapter 3.6.1 --- Deformation with Smooth Interpolated LCFs --- p.34-37 / Chapter 3.6.2 --- Used in Closed-curve Deformation --- p.38-39 / Chapter 3.6.3 --- Hierarchy of Axial Curve --- p.40 / Chapter 3.6.4 --- Applications in Soft Object Deformation --- p.41 / Chapter 3.7 --- Experiments and Results --- p.42-46 / Chapter 4. --- Self Intersection Detection of Axial Curve with LCFs --- p.47-76 / Chapter 4.1 --- Related Works --- p.48-49 / Chapter 4.2 --- Algorithms for Solving Self-intersection Problem with a set of LCFs --- p.50-51 / Chapter 4.2.1 --- The Intersection of Two Plane --- p.52 / Chapter 4.2.1.1 --- Constructing the Normal Plane --- p.53-54 / Chapter 4.2.1.2 --- A Line Formed by Two Planes Intersection --- p.55-57 / Chapter 4.2.1.3 --- Problems --- p.58 / Chapter 4.2.1.4 --- Sphere as Constraint --- p.59-60 / Chapter 4.2.1.5 --- Intersecting Line between Two Circular Discs --- p.61 / Chapter 4.2.2 --- Distance between a Mesh Vertex and a Curve Point --- p.62-63 / Chapter 4.2.2.1 --- Possible Cases of a Line and a Circle --- p.64-66 / Chapter 4.3 --- Definition Proof --- p.67 / Chapter 4.3.1 --- Define the Meaning of Self-intersection --- p.67 / Chapter 4.3.2 --- Cross Product of Two Vectors --- p.68 / Chapter 4.4 --- Factors Affecting the Accuracy of the Algorithm --- p.69 / Chapter 4.3.1 --- High Curvature of the Axial Curve --- p.69-70 / Chapter 4.3.2 --- Mesh Density of an Object. --- p.71-73 / Chapter 4.5 --- Architecture of the Self Intersection Algorithm --- p.74 / Chapter 4.6 --- Experimental Results --- p.75- 79 / Chapter 5. --- Conclusions and Future Development --- p.80-82 / Chapter 5.1 --- Contribution and Conclusions --- p.80-81 / Chapter 5.2 --- Limitations and Future Developments --- p.82 / References --- p.83-87

Typescript (photocopy). / Digitized by Kansas Correctional Industries

X windows is a graphic display management system. It is designed to work on a variety of machines and display adapters, however it is not designed for terminals with local graphics capabilities. X windows can be made to work on this type of terminal, although in a slower and restricted form. The problem with designing a variation of X for these terminals is the translation from X requests to native graphics commands, and the mapping of terminal input into X events. These implementation issues are discussed and example code is provided. / Department of Computer Science