• Title/Summary/Keyword: DAG 패스

Search Result 2, Processing Time 0.014 seconds

The Design and Implementation of Automatic Converter of Maya Data And SEDRIS STF Data (Maya 데이터와 SEDRIS STF 데이타간의 자동변환기 설계 및 구현)

  • Yong Do, Her;Kwong-Hyung, Lee
    • The Journal of Korean Association of Computer Education
    • /
    • v.7 no.6
    • /
    • pp.141-150
    • /
    • 2004
  • The method of reusing the environmental data which is previously modelled in modeling and simulation is very important. So, we need an environmental data representation and interchange mechanism which satisfies the requirements of sharing. The SEDRIS STF(SEDRIS Transmittal Format) provides environmental data users and producers with a clearly defined interchange specification. In this paper, We design and implement an automatic converter which converts commercial data(Maya) format to standard interchange format and vice verse without losing semantic of information content using SEDRIS standard interchange format.

  • PDF

Efficient Evaluation of Path Expressions Using Connectivity of Nodes (노드의 연결성을 이용한 패스 표현의 효과적인 처리)

  • Lee, Tae-Gyeong
    • The KIPS Transactions:PartD
    • /
    • v.9D no.3
    • /
    • pp.337-344
    • /
    • 2002
  • Recently, there has been a lot of research on graph-type data because it can model seamless the application domains such as GIS, network, WWW, multimedia presentations etc., and domain in which the data sequence is important. In this paper, an efficient code system, called node code system, is proposed to evaluate paths of DAG in a multimedia presentation graph. The node code system assigns a unique binary string to each node of a graph. The comparison of node codes of two nodes tells the connectivity between the nodes without actual traversal of a graph. The method using the property of the node code system allows us to construct the paths between two nodes more efficiently than the method using conventional graph traversals. The algorithms to construct paths using the node code system are provided.