Rectilinear Layouting of Graphs.

Date of Submission

December 1992

Date of Award

Winter 12-12-1993

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Advance Computing and Microelectronics Unit (ACMU-Kolkata)


Bhattacharya, Bhargab Bikram (ACMU-Kolkata; ISI)

Abstract (Summary of the Work)

Representation of objects and their interrelationships are often done using graphs. These graphical representations have numerous applications in the real world like FLOW DIAGRAMS, NETWORKING, PERT-CPM etc. Also it is extremely useful for Data Base Applications and CASE-TOOLSs. Diagrammatic representation is widely used functional analysis of in the information systems. Now-a-days &'computer-aided diagram creation' techniques employed in the are of advertising and industrial design. A areas well-depicted graphic representation can convey a lot more than more words. Properties that characterize a well-depicted graph are1) it has clarity of expression.(ii) it has an aest.hetic appeal.(iii) it has simplicity of notation.A frequently encountered problem in these applications 'LAYOUTING'. Creation a layout for is of a graph on plane a may become very complex as of edge-crossings, the number of the number bends. etc, increase. Such diagram will be a very difficult to interpret and analyze.In this report an effort is made to create a layout. for graph. split. The graph is first. into components such t.hat the layout for each of these components can be easily created. The number of minimized by first,creating a representation for a maximal planar subgraph of the graph and then adding the remaining edges such that the crossings are minimized.


ProQuest Collection ID:

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.


This document is currently not available here.