| dc.description.abstract |
A drawing concerns the process of generating geometric representations of relational information, usually for visualization purposes. A good drawing provides an understanding of the system to the reader, while a poor drawing may create confusion. A lot of information related to graphs and graph drawings can be stored using data structures where vertices represent entities and edges correspond to relationships among entities. In this paper, we have reviewed various studies to present the unsolved problems in the domain of graph drawing and to identify its applications in real life. By reviewing the existing approaches related to graph drawings, we found that there exist various drawing strategies that efficiently allow us to create drawings with a confined area, relatively high angular resolution, user-restrained aspect ratio, a lesser number of bends, etc. Moreover, there are several known algorithms for addressing different measures of graph drawing (such as symmetricity, spirality, rotation, etc.) but they are usually restricted to specific sub-classes of planar graphs. The present study provides readers a better understanding of the field of graph drawing and related problems |
en_US |