• Korean Journal of Computational Design and Engineering
• /
• v.4 no.3
• /
• pp.190-199
• /
• 1999

Presented in this paper is an algorithm for finding all intersections among polygonal chains with an O((n+k)·log m) worst-case time complexity, where n is the number of lien segments in the polygonal chains, k is the number of intersections, and m is the number of monotone chains. The proposed algorithm is based on the sweep line algorithm. Unlike the previous polygonal-chain intersection algorithms that are designed to handle special only cases, such as convex polygons or C-oriented polygons, the proposed algorithm can handle arbitrarily shaped polygonal chains having self-intersections and singularities (tangential contact, multiple intersections). The algorithms has been implemented and applied to 1) testing simplicity of a polygon, 2) finding intersections among polygons and 3) offsetting planar point-sequence curves.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.1
• /
• pp.56-62
• /
• 1988

For shape description, a fast sequential method for polygonal approximation of chaincoded plane curves which are object boundaries is proposed. The proposed method performs polygonal approximation by use of the distance error from one point to a line, and its performance is enhanced by the smoothed slopes of lines. Furthermore, accumulated distance error and variable distance error threshold are proposed in order to consider and implement the visual characteristics of the human being.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.59-64
• /
• 2002

This paper presents a method for line segment extraction for 3-d building reconstruction. Building roofs are described as a set of planar polygonal patches, each of which is extracted by watershed-based image segmentation, line segment matching and coplanar grouping. Coplanar grouping and polygonal patch formation are performed per region by selecting 3-d line segments that are matched using epipolar geometry and flight information. The algorithm has been applied to high resolution aerial images and the results show accurate 3-d building reconstruction.

• International Journal of CAD/CAM
• /
• v.9 no.1
• /
• pp.71-77
• /
• 2010

Various applications, such as mesh composition and model repair, ask for a natural stitching for polygonal surfaces. Unlike the existing algorithms, we make full use of the information from the two feature lines to be stitched up, and present an accurate stitching method for polygonal surfaces, which minimizes the error between the feature lines. Given two directional polylines as the feature lines on polygonal surfaces, we modify the general placement method for points matching and arrive at a closed-form solution for optimal rotation and translation between the polylines. Following calculating out the stitching line, a local surface optimization method is designed and employed for postprocess in order to gain a natural blending of the stitching region.

• Journal of Korea Multimedia Society
• /
• v.12 no.1
• /
• pp.50-57
• /
• 2009

This paper proposes a extraction of feature lines on a polygonal model using local implicit surface fitting technique. To extract feature lines on a polygonal model, the previous technique addressed to compute the curvature and their derivatives at mesh vertices via global implicit surface fitting. It needs a user-specified precision parameter for finding an accurate projection of the mesh vertices onto an approximating implicit surface and requires high-time consumption. But we use a local implicit surface fitting technique to estimate the local differential information near a vertex by means of an approximating surface. Feature vertices are easily detected as zero-crossings, and can then be connected along the direction of principal curvature. Our method, demonstrated on several large polygonal models, produces a good fit which leads to improved visualization.

• International Journal of CAD/CAM
• /
• v.2 no.1
• /
• pp.23-28
• /
• 2002

This paper presents an efficient line-offset algorithm for general polygonal shapes with islands. A developed sweep-line algorithm (SL) is introduced to find all self-intersection points accurately and quickly. The previous work is limited to handle polygons that having no line-segments in parallel to sweep-line directions. The proposed algorithm has been implemented in Visual C++ and applied to offset point sequence curves, which contain several islands.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2007.05a
• /
• pp.1062-1073
• /
• 2007

Acoustic Target Strength (TS) is a major parameter of the active sonar equation, which indicates the ratio of the radiated intensity from the source to the re-radiated intensity by a target. In developing a TS equation, it is assumed that the radiated pressure is known and the re-radiated intensity is unknown. This research provides a TS equation for polygonal plates, which is applicable to near field acoustics. In this research, Helmholtz-Kirchhoff formula is used as the primary equation for solving the re-radiated pressure field; the primary equation contains a surface (double) integral representation. The double integral representation can be reduced to a closed form, which involves only a line (single) integral representation of the boundary of the surface area by applying Stoke's theorem. Use of such line integral representations can reduce the cost of numerical calculation. Also Kirchhoff approximation is used to solve the surface values such as pressure and particle velocity. Finally, a generalized definition of Sonar Cross Section (SCS) that is applicable to near field is suggested. The TS equation for polygonal plates in near field is developed using the three prescribed statements; the redection to line integral representation, Kirchhoff approximation and a generalized definition of SCS. The equation developed in this research is applicable to near field, and therefore, no approximations are allowed except the Kirchhoff approximation. However, examinations with various types of models for reliability show that the equation has good performance in its applications. To analyze a general shape of model, a submarine type model was selected and successfully analyzed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.10
• /
• pp.1355-1360
• /
• 2020

In a map, placing the labels, corresponding to names or explanations of specific features, is called map labeling. In this paper, n points on a line are given, and placing rectangular labels for the points is considered. Particularly, the labels have a same height and their lower sides lie on a straight line in the upper of the line on which the given points are. The points and the labels are connected by polygonal lines, which are called leader lines. The leader lines are classified into straight leader lines and bended leader lines, where the straight leader line consists of only the vertical line and the bended leader line consists of vertical, horizontal, vertical lines. The problem is placing the labels to minimize the number of bended leader lines, and we propose an O(nlogn)-time algorithm, which improves the O(n2)-time algorithm previously provided in [13].

• Journal of the Korean Institute of Landscape Architecture
• /
• v.27 no.4
• /
• pp.137-142
• /
• 1999

The purpose of this study is to develope a CAD-based tool for rasterization of polygonal vector map in AutoCAD. To identity the layer property of polygonal entity with user-defined coordinates as topology, algorithm in processing entity data of selection set that intersected with scan line was used, and the layers were extracted sequentially by sorted intersecting points in data-list. In addition to the functions for querying and modifying topology, two options for mapping were set up to construct plan projection type and to change meshes' properties in existing DTM data. In case of plan projection type, user-defined cell size of 3DFACE mesh is available for more detailed edge, and topological draping on landform can be executed in case of referring DTM data as an AutoCAD's drawing. The concept of algorithm was simple and clear, but some unexpectable errors were found in detecting intersected coordinates that were AutoCAD's error, not the utility's. Also, the routines to check these errors were included in algorithmic processing. Developed utility named MESHMAP was written in entity data control functions of AutoLISP language and dialog control language(DCL) for the purpose of user-oriented interactive usage. MESHMAP was proved to be more effective in data handling and time comparing with GRIDMAP module in LANDCADD which has similar function.

• Transactions of Materials Processing
• /
• v.15 no.2 s.83
• /
• pp.118-125
• /
• 2006

API steel is used for line-pipe to transport the oil and natural gas. As the recent trends in the development of API steel are towards the use of larger diameter and thicker plate, many researches have been studied to achieve higher strength, higher toughness and lower yield ratio in API steel. However, the strength of API steel after pipe forming is changed depending on the competition of the Bauschinger effect and work hardening which are affected by the strain history during pipe forming process. So, the purpose of this study is to investigate the influence of microstructure on the Bauschinger effect for API steel. To change the microstructure of API steel we have changed the hot rolling condition and the amounts of V and Cu addition. The compression-tensile test and the microstructure observation by OM and TEM were conducted to investigate the yield strength drop and the correlation between the Bauschinger effect and microstructure of API steel. The experimental results show that the increase of polygonal ferrites volume fraction increases the Baushcinger effect due to the back stress which comes from the increase of mobile dislocation density at polygonal ferrite interior during the compressive deformation. The hot rolling condition was more effective on the Bauschinger effect in API steel than the small amount of V and Cu addition.