• Journal of KIBIM
• /
• v.13 no.4
• /
• pp.85-95
• /
• 2023

In the process of creating drawings based on Building Information Modeling (BIM), automatically generated annotations can cause interference issues depending on the drawing type. This study aims to develop an algorithm for repositioning annotations using genetic algorithms to minimize such interferences. To achieve this, the Application Programming Interface (API) of BIM software was used to analyze data extractable from BIM drawing files. The process involved defining drawing data related to annotation repositioning, preprocessing this data, and deriving optimal placement coordinates for the annotations. Furthermore, applying the developed algorithm to the preliminary design drawings of small and medium-sized neighborhood facilities resulted in approximately a 95.37% decrease in annotation interference, indicating that the proposed algorithm can significantly enhance productivity in BIM-based drawing tasks.

• 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.

• Journal of the Society of Naval Architects of Korea
• /
• v.46 no.6
• /
• pp.622-630
• /
• 2009

This paper deals with the automation techniques of ship assembly drawing generation, which help the designer to reduce the man-hour for completing the drawings, and improve the quality of the drawing for the given time. The automation techniques are necessary for the reasons of economical efficiency and improve communication between the designers and shop-makers. The overlap-avoidance algorithm of this paper maximizes the readability of the drawings using the optimization techniques and the heuristic rules, especially for the ship assembly field.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.5
• /
• pp.854-859
• /
• 2010

Distribution Automation System(DAS) is designed to improve operational efficiency by acquisition and control of remote data using its components such as central computation units, communication network and feeder remote terminal units. A conventional human machine interface of the DAS adopts a schematic diagram which is made by drawing power equipments on the geographic information system map. The single line diagram is more useful than the schematic diagram for the main tasks of distribution system operation such as protective relay coordination, service restoration and loss minimization. Since the configuration of the distribution line is changed according to the relocation of the open tie switches, the auto-drawing algorithm based on the connection between the sections and the switches is an essential technique. This paper proposes a new auto-drawing algorithm for a single line diagram of distribution systems based on tertiary tree and collision avoidance method. The feasibility of the proposed algorithm has been testified for various cases using practical distribution system with 12 feeders.

• Journal of applied mathematics & informatics
• /
• v.7 no.2
• /
• pp.629-640
• /
• 2000

this paper present an efficient line-drawing algorithm that reduces the amount of space required, Because of its efficiency , this line-drawing algorithm is faster than the Bresenham algorithm or the recursive bisection method. this efficiency was achieved through a new data structure; namely , the modified segment tree (MST). Using the modified segment tree and the distribution rule suggested in this paper, we dra lines without generating the recursive calls used in [3] and without creating the binary operation used in [4]. we also show that line accuracy improves in proportion to the display resolution . In practice, we can significantly improve the algorithm's performance with respect to time and space, This improvement offer an increase in speed, specially with lines at or near horizontal, diagonal. or vertical ; that is, this algorithm requires the time complexity of (n) and the space complexity O(2k+1), where n is the number of pixels and k is a level of the modified segment tree.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.9
• /
• pp.2349-2357
• /
• 1994

This paper presents a facial expression transformation algorithm and drawing rule generation algolithm for a portrait drawing robot which was developed for the '93 Taejeon EXPO. The developed algorithm was mainly focused on the robust automatic generation of robot programs with the consideration that the drawing robot should work without any limitation of the age, sex or race for the persons. In order to give more demonstratin effects, the facial expression change of the pictured person was performed.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2002.06a
• /
• pp.63-63
• /
• 2002

RNA pseudoknots are not only important structural elements for forming the tertiary structure, but also responsible for several functions of RNA molecules such as frameshifting, read-through, and the initiation of translation. There exists no automatic method for drawing RNA pseudoknot structures, and thus representing RNA pseudoknots currently relies on significant amount of manual work. In this talk, I will introduce the first algorithm for automatically generating a drawing of RNA pseudoknot structures. Two basic criteria were adopted when designing the algorithm: (1) Overlapping of structural elements should be minimized to increase the readability of the drawing, and (2) The whole RNA structure as well as the pseudoknots themselves should be recognized quickly and clearly. The algorithm has been implemented in a JAVA program, which can be executed on any computing systems. Experimental results show that this program generates a clear and compact drawing of RNA pseudoknots and allows a biologist to gain insights into RNA pseudoknot structures. The program can also be used as useful aids in designing biochemical experiments to elucidate more precise mechanism of RNA functions associated with pseudoknots.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.14 no.2
• /
• pp.32-38
• /
• 1977

To organize the least control information for vector-drawing Korean characters, relatively simple 'Shortest Route Searching Algorithms' which can be applied to Korean character patterns were constructed. The shortest drawing routes and the common starting point for all charcters were found with this algorithm. It is shown that the vectors, which needs the least control informations to follow the shortest drawing route, are those vertical and horizontal vectors which have the size of 1 arid 3 times of raster distance. The vector control information for drawing 33 Korean characters including 9 double consonants and vowels can be organized with 7 bits 463 words of horizontal format informations which are corresponding to 3,241 bits.

• 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.

• Transactions of Materials Processing
• /
• v.6 no.5
• /
• pp.416-424
• /
• 1997

In the present study, a contact search and check algorithm for general tool surface described by triangular FE patch is proposed. To improve numerical stability, SEAM element using the linear Coons interpolation has been used. To check the proposed algorithm, both clover cup and L-shape cup deep drawing processes are calculated. The computed results shows that the proposed contact algorithm can be successfully applied for sheet metal forming processes with general shaped tools.