• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.2
• /
• pp.369-374
• /
• 2010

The shortest path between two points inside a simple polygon P is a minimum-length path among all paths connecting them which don't pass by the exterior of P. A linear time algorithm for computing the shortest path in a general simple polygon requires triangulating a polygon as preprocessing. The linear time triangulating is known to very complex to understand and implement it. It is also inefficient in case that the input without very large size is given because its time complexity has a big constant factor. In this paper, we present the customized shortest path algorithm for a segment-visible polygon which is a simple polygon weakly visible from an internal line segment. Our algorithm doesn't require triangulating as preprocessing and consists of simple procedures such as construction of convex hulls, so it is easy to implement and runs very fast in linear time.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.807-810
• /
• 2009

In this paper, we consider the shortest path problems in a simple polygon. The shortest path between two points inside a polygon P is a minimum-length path among all paths connecting them which don't pass by the exterior of P. A linear time algorithm for computing the shortest path in a general simple polygon requires triangulating a polygon as preprocessing. The linear time triangulating is known to very complex to understand and implement it. It is also inefficient in cases without very large input size. In this paper, we present the customized shortest path algorithms for specific polygon classes such as star-shaped polygons, edge-visible polygons, and monotone polygons. These algorithms need not triangulating as preprocessing, so they are simple and run very fast in linear time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.9
• /
• pp.1146-1151
• /
• 2019

Histogram H is an x-monotone rectilinear polygon with a horizontal edge, called by a base, connecting the leftmost vertical edge and the rightmost vertical edge. Here the rectilinear polygon is a polygon with only horizontal and vertical edges and the x- monotone polygon P is a polygon in which every line orthogonal to the x-axis intersects P at most twice. Walking counterclockwise on the boundary of a histogram H yields a sequence of left turns and right turns at its vertices. Conversely, a given sequence of the turns at the vertices can be realized by a histogram. In this paper, we consider the problem of finding a histogram to realize a given turn sequence. Particularly, we will find the histograms to minimize its area and its bounding box. It will be shown that both of the problems can be solved by linear time algorithms.

• Journal of the Korea Society for Simulation
• /
• v.19 no.4
• /
• pp.129-137
• /
• 2010

Currently used shortest path search algorithms involve graphs with vertices and weighted edges between each vertex. However, when finding the shortest path with a randomly shaped obstacle(an island, for instance) positioned in between the starting point and the destination, using such algorithms involves high memory inefficiency and is significantly time consuming - all positions in the map should be considered as vertices and every line connecting any of the two adjacent vertices should be considered an edge. Therefore, we propose a new method for finding the shortest path in such conditions without using weighted graphs. This algorithm will allow finding the shortest obstacle bypass given only the positions of the obstacle boundary, the starting point and the destination. When the row and column size of the minimum boundary rectangle to include an obstacle is m and n, respectively, the proposed algorithm has the maximum time complexity, O(mn). This performance shows the proposed algorithm is very efficient comparing with the currently used algorithms.

• Journal of KIISE:Software and Applications
• /
• v.27 no.3
• /
• pp.266-274
• /
• 2000

Medical image segmentation, which is essential in diagnosis and 3D reconstruction, is performed manually in most applications to produce accurate results. However, manual segmentation requires lots of time to segment, and is difficult even for the same operator to reproduce the same segmentation results for a region. To overcome such limitations, we propose a convenient and accurate semiautomatic segmentation method. The proposed method initially receives several control points of an ROI(Region of Interest Region) from a human operator, and then finds a boundary composed of a minimum cost path connecting the control points, which is the Live-wire method. Next, the boundary is modified to overcome limitations of the Live-wire, such as a zig-zag boundary and erosion of an ROI. Finally, the region is segmented by SRG(Seeded Region Growing), where the modified boundary acts as a blockage to prevent leakage. The proposed User-steered balloon method can overcome not only the limitations of the Live-wire but also the leakage problem of the SRG. Segmentation results of thigh muscles of the Visible Human are presented.

• Proceedings of the Plant Resources Society of Korea Conference
• /
• 2018.04a
• /
• pp.16-16
• /
• 2018

Flora investigations have been conducted by many researchers for a long time in Korea. Even though large amount of investigation data has been accumulated, there is no accurate statistics or database because most of data were published in a printed form. We developed a web-based database of flora investigation, named as the Integrated Korean Flora Database (http://www.floradb.net/) to understand distribution patterns and habitats of plants in Korea. Till now, 480 published paper, 356 thesis, 76 reports and books, and 8 unpublished papers written in between 1962 and 2017 were collected and their species lists from 280 papers were parsed into the database. From 124,105 records, 3,100 species belonging to 206 families and 965 genera were identified via comparing with two major Korean plant species lists. 55 endangered species, 159 endemic species, and 367 rare species were identified. The most frequently surveyed species were Commelina communis in herbaceous and Rosa multiflora in woody plants. Microclimate data provided by Korea Meteorological Administration were also integrated and analyzed to assign cold hardness zones for each species. By comparing minimum temperature (<2%) acquired from automated weather stations (AWS) near by plant species, 6a to 10b zones (7b is the most frequent zone) were identified. Integrated Korean Flora Database will be a fundamental platform of korea flora investigation as well as a new standard for classifying distribution of plants based on accurate microclimate data. Moreover, it can also provide evidences of investigated plant species, such as specimen and/or pictures with connecting to the InfoBoss Cyber Herbarium (http://herbarium.infoboss. co.kr/) and Biodiversity Observation Datbase (BODB; http://www.biodiversitydb.org/).

• Clinics in Shoulder and Elbow
• /
• v.26 no.4
• /
• pp.397-405
• /
• 2023

Background: A precontoured plate rarely fits properly within the patient's clavicle and must be bent intraoperatively. This study aimed to determine whether anatomical reduction could be achieved using a plate bent before surgery. Methods: This study included 87 consecutive patients with displaced mid-shaft clavicle fractures who underwent plate fixation and were followed-up for a minimum of 1 year. After exclusions, 39 consecutive patients underwent fixation with a precontoured plate bent intraoperatively (intraoperative bending group), and 28 underwent fixation with the plate bent preoperatively (preoperative bending group). Using free software and a three-dimensional (3D) printer, ipsilateral clavicle 3D-printed models were constructed. Using plain radiographs, the distance between the edge of the lateral inferior cortex and the medial inferior cortex was measured. The angle between the line connecting the inferior cortex edge and the line passing through the flat portion of the superior cortex of the distal clavicle was measured. Results: Mean length differences between the ipsilateral and contralateral clavicle were smaller on both anteroposterior (AP; P=0.032) and axial images (P=0.029) in the preoperative bending group. The mean angular differences on both AP (P=0.045) and axial images (P=0.008) were smaller in the preoperative bending group. No significant differences were observed between the two groups in functional scores at the last follow-up. Conclusions: Smaller differences in length and angle between the ipsilateral and contralateral clavicle, indicative of reduction, were observed in the preoperative bending group. Using the precontoured technique with low expense, the operation was performed more effectively as reflected by a shorter operation time. Level of evidence: III.

• Journal of the Korea Society for Simulation
• /
• v.15 no.2
• /
• pp.31-39
• /
• 2006

The visibility graph is a well-known method for efficient path-finding with the minimum search space modelling the game world. The generalized visibility graph is constructed on the expanded obstacle boundaries to eliminate the "wall-hugging" problem which is a major disadvantage of using the visibility graph. The paths generated by the generalized visibility graph are guaranteed to be near optimal and natural-looking. In this paper we propose the method to apply the generalized visibility graph efficiently for game characters who moves among static obstacles between varying start and goal points. Even though the space is minimal once the generalized visibility graph is constructed, the construction itself is time-consuming in checking the intersection between every two links connecting nodes. The idea is that we build the map for static obstacles first and then incorporate start and goal nodes quickly. The incorporation of start and goal nodes is the part that must be executed repeatedly. Therefore we propose to use the rotational plane-sweep algorithm in the computational geometry for incorporating start and goal nodes efficiently. The simulation result shows that the execution time has been improved by 39%-68% according to running times in the game environment with multiple static obstacles.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.28 no.7
• /
• pp.1267-1273
• /
• 2022

Although the Korea shipbuilding industry has recently been receiving most of the orders for ships in the world, production processes are being disrupted due to a shortage of manpower at the production site. This is because the workers quit the shipyard as both work and wages were reduced due to the long slump in the shipbuilding industry. The main reason for the increase in orders was the large-scale orders for Qatar LNG carriers, and the situation in which the technical specifications required for ships are becoming more complex is also working to an advantage. Because the contract delivery time is of utmost importance for ships, the dock launch plan is the most important management item among the shipyard's major processes. The structure to be built in the dock may be a hull that has left the design work or a finished vessel, and in some cases, it is often at the level of some blocks of the hull. When launching, the hull is affected by the hogging or sagging moment due to the fluid force, and securing the safety of the structural strength of the block connection is of utmost importance. In a normal process, the connecting member launches after welding has been completed, but in actual shipbuilders, quick decision-making is needed on the conditions for securing structural safety to comply with the docking schedule. In this study, a detailed analysis method and applicability using a bending stress evaluation method and finite element analysis modelling were analyzed to rationally judge the above-mentioned problems from an engineering point of view. The main contents mentioned in the thesis can be used as good examples when conducting similar structural strength evaluations in the future.