• Journal of applied mathematics & informatics
• /
• v.28 no.5_6
• /
• pp.1347-1358
• /
• 2010

An upright drawing of a planar graph G on k layers is a planar straight-line drawing of G, where the vertices of G are placed on a set of k horizontal lines, called layers and no two adjacent vertices are placed on the same layer. There is a previously known algorithm that decides in linear time whether a planar graph admits an upright drawing on k layers for a fixed value of k. However, the constant factor in the running time of the algorithm increases exponentially with k and makes it impractical even for k = 3. In this paper, we give a linear-time algorithm to examine whether a biconnected planar graph G admits an upright drawing on three layers and to obtain such a drawing if it exists. We also give a necessary and sufficient condition for a tree to have an upright drawing on three layers. Our algorithms in both the cases are much simpler and easier to implement than the previously known algorithms.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.422-427
• /
• 2009

We present a real-time graph drawing tool for mathematics education. We developed a sketch-based graph drawing interface that recognizes the schematic sketch of a graph. Our system generates figures displaying useful supplementary information such as auxiliary lines, abscissas, and ordinates. The resulting graphs are very similar to the graphs commonly found in textbooks. We also developed a graph retrieval system that makes rapid graph drawing feasible.

• Journal of KIISE:Software and Applications
• /
• v.31 no.10
• /
• pp.1266-1275
• /
• 2004

Bioinformatics is concerned with the creation and development of advanced information and computational technologies for problems in biology. It is divided into genomics, proteomics and metabolimics. In metabolimics, an organism is represented by metabolic pathway, i.e., well-displayed graph, and so the graph drawing tool to draw pathway well is necessary to understand it comprehensively. In this paper, we design an improved drawing algorithm. It enhances the readability by making use of the bipartite graph. Also it is possible to draw large graph properly by considering the facts that metabolic pathway graph is scale-free network and is composed of circular components, hierarchic components and linear components.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.2
• /
• pp.217-224
• /
• 1986

In case of VLSI design, the shuffle-exchange graph is useful for optimal layout. HOEY and LEISERSON proposed the method of drawing a N-nodes shuffle-exchange graph on O(N2/log N) layout area by using the complex plane digram. [2] In this paper, a new algorithm for drawing the shuffle-exchange graph is proposed. This algorithm is not by using the complex plane diabram, but the table of e decimal represented nodes of shuffle-edge relations. And the structural properties for optimal layout of the graph are summarized and verified. By using this more simplified algorithm, a FORTRAN program which can be treated faster is written. Aimed near optimal shuffle-exchange graphs are printed out by giving inputs` the number of nodes.

• The Journal of Korean Association of Computer Education
• /
• v.17 no.6
• /
• pp.103-113
• /
• 2014

This study designed and implemented a query model for consecutive analyses of dynamic multivariate graph data. First, the query model consists of two procedures; setting the discriminant function, and determining an alteration method. Second, the query model was implemented as a query system that consists of a query panel, a graph visualization panel, and a property panel. A Node-Link Diagram and the Force-Directed Graph Drawing algorithm were used for the visualization of the graph. The results of the queries are visually presented through the graph visualization panel. Finally, this study used the data of worldwide import & export data of small arms to verify our model. The significance of this research is in the fact that, through the model which is able to conduct consecutive analyses on dynamic graph data, it helps overcome the limitations of previous models which can only perform discrete analysis on dynamic data. This research is expected to contribute to future studies such as online decision making and complex network analysis, that use dynamic graph models.

• Genomics & Informatics
• /
• v.4 no.3
• /
• pp.118-124
• /
• 2006

For the direct understanding of flow, pathway data are usually represented as directed graphs in biological journals and texts. Databases of metabolic pathways or signal transduction pathways inevitably contain these kinds of graphs to show the flow. KEGG, one of the representative pathway databases, uses the manually drawn figure which can not be easily maintained. Graph layout algorithms are applied for visualizing metabolic pathways in some databases, such as EcoCyc. Although these can express any changes of data in the real time, it exponentially increases the edge crossings according to the increase of nodes. For the understanding of genome scale flow of metabolism, it is very important to reduce the unnecessary edge crossings which exist in the automatic graph layout. We propose a metabolic pathway drawing algorithm for reducing the number of edge crossings by considering the fact that metabolic pathway graph is scale-free network. The experimental results show that the number of edge crossings is reduced about $37{\sim}40%$ by the consideration of scale-free network in contrast with non-considering scale-free network. And also we found that the increase of nodes do not always mean that there is an increase of edge crossings.

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.2
• /
• pp.97-106
• /
• 1996

Existing CAD systems do not provide advanced functions for automatic checking design and drafting errors in mechanical drawings. If the knowledge of checking in mechanical ddrsfting can be implemented into computers, CAD systems could automatically check for design and drafting errors. This paper describes a method for systematic checking of dimension errors. such as deficiency and/or redundancy of dimension input-errors in dimension figures and symbols, etc. The logic for finding dimensional errors is written by using a proccedural language. A geometric model and a topological-graph model are used in this method. Checking for deficiency and redundancy of dimensions is based upon graph Theory.

• Journal of the Korean Society for Precision Engineering
• /
• v.13 no.8
• /
• pp.60-71
• /
• 1996

Mostof existing CAD systems do not provide the advanced function for systematic checking of design and drafting errors in mechanical drawings. We have reported a computer aided drawing check system to single plane projection drawings made by a CAD system. This paper describes a checking method of dimensioning errors in mechanical drawings. The checking items are deficiency and redundancy of dimensions, input-errors in dimension figures and symbols, etc. Checking for deficiency and redundancy of global dimensions has been performed applying Graph Theory. This system has been applied to several examples and we have confirmed the feasibility of this checking method.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.11a
• /
• pp.593-597
• /
• 1996

This paper describes a method for drawing check of dimension errors, such as deficiency and redundancy of dimensions, input-errors in dimension figures and symbols, etc. The logic for finding dimensional errors is written by using the Turbo C language. Checking for deficiency and redundancy of global dimensions has been performed applying Graph Theory. Especialy, this paper gives an account of checking method for annular parts.

• The Mathematical Education
• /
• v.51 no.3
• /
• pp.197-210
• /
• 2012

In this study, we will develop and implement the teaching program of 'Function', on the subject of "Poster-Making utilizing the Graph Art" in the Math Camp for middle-school students. And we will examine the didactical significance through student's activities and products. The teaching program of 'Function' utilizing the Graph Art can be promoted self-directly the understanding of 'Function' concept and the ability for handling 'Function'. In the process of drawing up the graph art, in particular, this program help students to promote the ability for problem-solving and mathematical thinking, and to communicate mathematically and attain the his own level. Ultimately, this program have a positive influence upon cognitive and affective and areas with regard to mathematics.