• Journal of applied mathematics & informatics
• /
• 제28권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학회:학술대회논문집
• /
• 한국HCI학회 2009년도 학술대회
• /
• pp.422-427
• /
• 2009

본 논문에서는 수학 교육을 위한 실시간 그래프 저작 시스템을 제안한다. 사용자는 대략적인 스케치를 통해 의도하는 그래프를 쉽게 그릴 수 있으며 실제 수학 교육에서 필요한 부가적인 정보 역시 쉽게 포함시킬 수 있다. 이와 더불어, 본 논문에서는 복잡한 그래프를 쉽게 그리기 위해 이미 그려져 있는 그래프 중 현재 그리고 있는 그래프와 가장 유사한 그래프를 찾아서 후보로 제시하는 방법을 제안한다.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제31권10호
• /
• pp.1266-1275
• /
• 2004

'생물정보학'이란 생물학적 데이타를 처리, 가공하여 정보를 얻어내는 연구 분야로 이 중 대사 체학은 대사 경로 네트워크를 가시화하여 생명 활동을 이해하고자 하는 분야로, 대사 경로 내의 흐름을 한 눈에 알 수 있도록 가시화하여 보여 줄 수 있는 도구가 반드시 필요하다. 따라서 본 논문에서는 새로운 '대사 경로 드로잉 알고리즘'을 제안하였다. 대사 경로 그래프의 구조로는 이분 그래프를 이용하여 가독성을 높였으며, 이 그래프가 척도 없는(scale-free) 네트워크 구조라는 것과 구조적으로 환형, 계층적, 선형 컴포넌트를 가진다는 것을 고려하여 사이즈가 큰 그래프도 적절하게 드로잉 하도록 하였다.

• 대한전자공학회논문지
• /
• 제23권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.

• 컴퓨터교육학회논문지
• /
• 제17권6호
• /
• pp.103-113
• /
• 2014

본 연구에서는 동적 다변량 그래프 데이터의 연속적 분석이 가능한 질의 모델을 설계 및 구현하였다. 먼저, 질의 모델을 판별함수 설정과 시간에 따른 통합 방법 선택의 두 단계로 설계하고, 질의 패널, 그래프 시각화 패널, 속성 패널로 구성된 질의 시스템으로 구현하였다. 또한, 그래프 표현에는 노드-링크 다이어그램과 Force-Directed Graph Drawing 알고리즘을 이용하였으며, 질의 결과로 선택된 대상들에 효과를 적용하여 사용자가 시각적으로 구분할 수 있도록 처리하였다. 마지막으로, 세계 소형 무기 거래량 데이터를 이용하여, 본 연구에서 설계한 동적 다변량 그래프 질의 모델을 검증하였다. 본 연구는 동적 그래프의 연속적 분석이 가능한 새로운 질의 모델을 설계하는 것을 통해, 기존 모델이 동적 그래프를 시점별로 이산적으로만 분석할 수 있는 한계를 개선하였다는데 의의가 있다. 본 연구는 추세 분석이나, 복잡계 네트워크 해석 등 동적 그래프를 사용하는 연구에 기여할 수 있을 것으로 기대된다.

• Genomics & Informatics
• /
• 제4권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.

• 한국CDE학회논문집
• /
• 제1권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.

• 한국정밀공학회지
• /
• 제13권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.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1996년도 추계학술대회 논문집
• /
• 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.

• 한국수학교육학회지시리즈A:수학교육
• /
• 제51권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.