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

Thesis (M.F.A.)--Rochester Institute of Technology, 1989. / Includes bibliographical references (leaves 29-32).

Thesis (M.S.)--University of North Texas, May, 2008. / Title from title page display. Includes bibliographical references.

Thesis (M.F.A.)--Rochester Institute of Technology, 1993. / Typescript. Includes bibliographical references (leaves 28-29).

Thesis (M.S.)--Ohio University, June, 1991. / Title from PDF t.p.

Thesis (M.F.A.)--Rochester Institute of Technology, 1986. / Typescript. Includes bibliographical references (leaves 72-73).

Thesis (M.S.)--Virginia Polytechnic Institute and State University, 1992. / Vita. Abstract. Includes bibliographical references (leaf 86). Also available via the Internet.

Thesis (M.A.)--Ohio State University, 1985. / Includes bibliographical references (leaves 128-133). Available online via OhioLINK's ETD Center

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

Thesis (M.F.A.)--Rochester Institute of Technology, 1992. / On T.p. "[copyright]" appears as the copyright symbol. Includes bibliographical references (leaves 18-21).