A graph may he drawn in many different ways. We investigate how to draw a graph nicely, in the sense of being visually pleasing. We discuss the history of this field, and look at several algorithms for drawing graphs. For planar graphs this problem has been algorithmically solved: that is, there is an algorithm which takes a n vertex planar graph and places the vertices at some of the nodes of an n-2 by 2n-4 array so that each edge of the planar graph can be drawn with a straight line. We describe in detail one particular implementation of this algorithm, give some examples in which this embedding is pleasing, and give a number of examples in which this grid embedding is not as visually pleasing another drawing of the same graph. For the more difficult problem of drawing a nonplanar graph, we investigate a spring based algorithm. We give a number of examples in which this heuristic produces more pleasing drawings than those produced by the planar embedding and a few cases where it fails to do so. / Graduation date: 1997

In this project, an enhanced version of Jedit is presented. Jedit is a Graph Editor developed at Ball State University by a group of students under the direction of Dr. Jay Bagga. The following paper describes the new version, named Jedit 4.0.In this version two new algorithms are implemented. These are: Planarity Testing and Planarity Drawing. The first algorithm tests a graph for planarity and the second one makes a planar embedding of the graph in a grid of size (n-2) x (n-2), where n is the order of the graph. Planar graphs have important applications in the fields of computer engineering, architecture, and many others.Jedit 4.0 also includes new features that were not available in earlier versions. The new features include: graph rotation operation, graph complement, drawing of well-known graphs, and credits window. Several modifications and additions to existing features and algorithms have also been carried out.Jedit 4.0 uses swing java technology what provides a more elegant look. Drop down menus have also been added to provide the user an easier way to use Jedit. / Department of Computer Science

Segment endpoint visibility graph is a representation scheme for art gallery problems, guard problems, and other shortest path or shortest circuit problems. In the research of visibility graphs, drawing graphs is a time-consuming task. VGE (Visibility Graphs Editor) is developed for visibility graphs reseacheres to create and modify graphs interactively in X-window environment. Appropriate graphics user interface allows the researcher to edit a graph, save and open a file, and make a hard copy of a graph. VGE is developed in C under X-window environment and using EZD[3] graphics tool. The thesis also discusses the uses of EZD. Although it is still only a prototype, VGE is a successful tool for analyzing visibility graphs. / Department of Computer Science

Call number: LD2668 .T4 1985 B62 / Master of Science

Typescript (photocopy). / Digitized by Kansas Correctional Industries

Typescript (photocopy). / Digitized by Kansas Correctional Industries

In recent years extensive research has been done on visibility graphs. In this thesis, we study some of the visibility graph algorithms, and implement these algorithms in the graph editor - GraphPerfect - which is a part of a project headed by Dr. Jay S. Bagga of the Department of computer science at Ball State University. One of the goals of this project is to design and build a software tool to learn and work with graphs and graph algorithms.In this thesis, some properties of visibility graphs are studied in detail and implementation of some graph algorithms is given. / Department of Computer Science

The hypercube is one of the most versatile and efficient networks yet discovered for parallel computation. It is well suited for both special-purpose and general-purpose tasks, and it can efficiently simulate many other networks of the same size. The size of subgraphs can be used to estimate the efficient communications of hypercube computer systems.The thesis investigates induced subgraphs of a hypercube, discusses sizes of subgraphs, and provides a formula to give bounds on the size of any subgraph of the hypercube.The concept of spanning graphs and line graphs is useful for studying properties of graphs. An MS WINDOWS based graphical system is developed which allows the creation and display of graphs and their spanning graphs, line graphs and super line graphs. / Department of Computer Science

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

The GLuskap system for interactive three-dimensional graph drawing applies techniques of scientific visualization and interactive systems to the construction, display, and analysis of graph drawings. Important features of the system include support for large-screen stereographic 3D display with immersive head-tracking and motion-tracked interactive 3D wand control. A distributed rendering architecture contributes to the portability of the system, with user control performed on a laptop computer without specialized graphics hardware. An interface for implementing graph drawing layout and analysis algorithms in the Python programming language is also provided. This thesis describes comprehensively the work on the system by the author—this work includes the design and implementation of the major features described above. Further directions for continued development and research in cognitive tools for graph drawing research are also suggested. / viii, 110 leaves : ill. (some col.) ; 29 cm.