• Title/Summary/Keyword: drawing algorithm

Search Result 226, Processing Time 0.031 seconds

A Metabolic Pathway Drawing Algorithm for Reducing the Number of Edge Crossings

  • Song Eun-Ha;Kim Min-Kyung;Lee Sang-Ho
    • 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.

Digital Watermarking for Copyright Protection of 3-D CAD Design Drawing Based on Vector Data Using Digital Watermarking

  • Kwon, Ki-Ryong;Lee, Suk-Hwan;Park, Seung-Seob;Jeong, Tai-Il
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.12
    • /
    • pp.1596-1606
    • /
    • 2006
  • There has been more increased the development of 3D technique since many 3D contents of 3D graphic model, 3D mobile/computer game, and 3D CAD have been serviced in Web or industry fields. Therefore, the watermarking system is more required to protect the copyright for 3D contents. Currently there has been researched about the watermarking for 3D graphic model of mesh or NURBS. However, watermarking technique based on CAD design drawing leaves something to be desired yet. This paper proposed the watermarking technique for 3D CAD design drawing using Line and Arc components. After drawing out Line and Arc components from designed drawing, we embed the watermark into both the length of Line component and the radius of Arc component. Experimental results verified that the proposed algorithm satisfies the transparency about watermarked drawing and also has the robustness against several attacks by using public CAD tool.

  • PDF

A Region-based Comparison Algorithm of k sets of Trapezoids (k 사다리꼴 셋의 영역 중심 비교 알고리즘)

  • Jung, Hae-Jae
    • The KIPS Transactions:PartA
    • /
    • v.10A no.6
    • /
    • pp.665-670
    • /
    • 2003
  • In the applications like automatic masks generation for semiconductor production, a drawing consists of lots of polygons that are partitioned into trapezoids. The addition/deletion of a polygon to/from the drawing is performed through geometric operations such as insertion, deletion, and search of trapezoids. Depending on partitioning algorithm being used, a polygon can be partitioned differently in terms of shape, size, and so on. So, It's necessary to invent some comparison algorithm of sets of trapezoids in which each set represents interested parts of a drawing. This comparison algorithm, for example, may be used to verify a software program handling geometric objects consisted of trapezoids. In this paper, given k sets of trapezoids in which each set forms the regions of interest of each drawing, we present how to compare the k sets to see if all k sets represent the same geometric scene. When each input set has the same number n of trapezoids, the algorithm proposed has O(2$^{k-2}$ $n^2$(log n+k)) time complexity. It is also shown that the algorithm suggested has the same time complexity O( $n^2$ log n) as the sweeping-based algorithm when the number k(<< n) of input sets is small. Furthermore, the proposed algorithm can be kn times faster than the sweeping-based algorithm when all the trapezoids in the k input sets are almost the same.

A Realization of Deburring Robot using Vision Sensor (비젼 센서를 이용한 디버링 로봇의 구현)

  • 배준영;주윤명;김준업;이상룡
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2002.05a
    • /
    • pp.466-469
    • /
    • 2002
  • Burr is a projected part of finished workpiece. It is unavoidable and undesirable by-product of most metal cutting or shearing process. Also, it must be removed to improve the fit of machined parts, safety of workers, and the effectiveness of finishing operation. But deburring process is one of manufacturing processes that have net been successfully automated, so deburring automation is strongly needed. This paper focused on developing a basic algorithm to find edge of workpiece and match two different image data for deburring automation which includes automatic recognition of parts, generation of deburring tool paths and edge/corner finding ability by analyzing the DXF drawing file which contains information of part geometry. As an algorithm for corner finding, SUSAN method was chosen. It makes good performance in finding edge and corner in suitable time. And this paper suggested a simple algorithm to find matching point between CCD image and drawing file.

  • PDF

Axisymmetric Multi-Stage Deep Drawing Die Design Analysis Using Finite Element Method (유한요소법을 이용한 축대칭 다단계 딥드로잉 금형 설계 해석)

  • Lee, Dong-Ho;Lee, Seung-Yeol;Geum, Yeong-Tak
    • Transactions of Materials Processing
    • /
    • v.7 no.6
    • /
    • pp.594-602
    • /
    • 1998
  • The design analysis of axisymmetric, multi-stage deep drawing dies was performed using the rigid-viscoplastic finite element formulation. In the formulation the axisymmetric CFS algorithm was employed. Hill's non-quadratic normal anisotropic yield criterion and isotropic hardening rule were considered. For trial initial displacements and tool contact points. the geometric force equilibrium method was adopted. In order to see the validity of the formulation, the multi-stage deep drawing processes of shell-cylinder front part of hydraulic booster were simulated. The simulation showed good agreements with measurments and PAM-STAMP results.

  • PDF

A Simple and Fast Algorithm for Real-time Pencil Strokes (간단하고 빠른 실시간 연필 스트로크 알고리즘)

  • Choi Sung-Wook
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.6
    • /
    • pp.344-353
    • /
    • 2006
  • In this paper, we present a new algorithm which imitate real pencil strokes. The purpose of research on NPR(Non-Photorealistic Rendering) is simulating automatically manmade artistic expressions such as pen-and-ink illustrations, watercolor paintings, pencil sketches and pastel drawings with computers. Recently, there has been a great deal of research works on NPR. One of them is researching in pencil illustration methods for NPR, and a lot of researchers have investigated into the LIC(Linear Integral Convolution) techniques which would change the initial images into the output images by directional vector field images for generating effects of pencil. However, the LIC techniques can not be applied to real-time drawing tools because they are post processing techniques. This paper presents a real-time pencil strokes algorithm which is based on an observation of how pencils(from 6B to 6H) draw lines. Although this algorithm using some pencil variables and noise generation is simple, it is fast and also can draw real-time pencil strokes similar to real manmade pencil strokes in a GUI drawing tool.

A Modified Bresenham's Line Drawing Algorithm Using Symmetrical Property of Line Segment (직선 선분의 대칭성을 이용한 수정 브레제남 직선 그리기 알고리즘)

  • Lee, Sang-Rak;Hong, Yun-Sik
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.8
    • /
    • pp.2213-2221
    • /
    • 1999
  • A line segment has a symmetrical property about its midpoint. With this symmetrical property for a line segment we have proposed a variant of Bresenham's line drawing algorithm that selects two pixels at the same time. It implies that bi-directional line drawing toward the midpoint of line segment from each-end be possible. Besiders, it can select two pixels using only one decision parameter, instead of two different parameters for each pixel. We also present a theoretical proof for the correctness of such a selection. Thus, we can reduce the time of generating line segment by approximately less than 5% compared to the Bresenham's method. Also, our experimental results show that the shape of line segment generated by the proposed approach is the exactly same as that of Bresenham's method.

  • PDF

Finite Element Inverse Analysis of the Deep Drawing Process Considering Bending History (굽힘이력을 고려한 딥드로잉공정의 유한요소역해석)

  • Huh, J.;Yoon, J.H.;Bao, Y.D.;Huh, H.
    • Transactions of Materials Processing
    • /
    • v.16 no.8
    • /
    • pp.590-595
    • /
    • 2007
  • This paper introduces a new approach to take account of bending history in finite element inverse analysis during sheet metal forming process. A modified membrane element was adopted for finite element inverse analysis so that bending-unbending energy was additionally imposed in the total plastic energy, predicting bending-unbending regions using the geometry of the final shape and tools. An algorithm was applied to a cylindrical cup deep drawing process. The blank shape and the distribution of the thickness strain were compared with those obtained from the incremental finite element analysis in order to evaluate the effect of the bending history. The algorithm reduced the difference between the results of the inverse analysis from those of the incremental analysis due to bending history. The analysis was also carried out with the variation of the thickness of the initial blank to investigate the effect of bending deformation. The results showed that the difference was remarkably reduced as the thickness of the initial blank increased. This indicates that the finite element inverse analysis cooperated with the suggested scheme is useful to obtain more accurate results, especially when bending effects are significant.

Efficient Controlled Selection

  • Ryu, Jea-Bok;Lee, Seung-Joo
    • Communications for Statistical Applications and Methods
    • /
    • v.4 no.1
    • /
    • pp.151-159
    • /
    • 1997
  • In sample surveys, we expect preferred samples that reduce the survey cost and increase the precision of estimators will be selected. Goodman and Kish (1950) introduced controlled selection as a method of sample selection that increases the probability of drawing preferred samples, while decreases the probability of drawing nonpreferred samples. In this paper, we obtain the controlled plans using the maximum entropy principle, and when the order of nonpreferred samples is considered, we propose the algorithm to obtain a controlled plan.

  • PDF

Blank Design and Strain Prediction in Sheete Metal Forming Process (박판금속 성형공정에서의 블랭크 설계및 변형률 예측)

  • Lee, Choong-Ho;Huh, Hoon
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.20 no.6
    • /
    • pp.1810-1818
    • /
    • 1996
  • A new finite elemetn approach is introduced for direct prediction of bland shapes and strain distributions from desired final shapes in sheet metal forming. The approach deals with the geometric compatibility of finite elements, plastic deformation theory, minimization of plastic work with constraints, and a proper initial guess. The algorithm developed is applied to cylindrical cup drawing, square cup drawing, and fron fender forming to confirm its validity by demonstratin reasonable accurate numerical results of each problems. Rapid calculation with this algorithm enables easy determination of various process variables for design of sheet metal forming process.