• Journal of Electrical Engineering and Technology
• /
• v.7 no.6
• /
• pp.1023-1033
• /
• 2012

An underwater planar covering problem is studied where the coverage region consists of polygonal cells, and line sweep motion is used for coverage. In many subsea applications, sidescan sonar has become a common tool, and the sidescan sonar data is meaningful only when the sonar is moving in a straight line. This work studies the optimal line sweep coverage where the sweep paths of the cells consist of straight lines and no turn is allowed inside the cell. An optimal line sweep coverage solution is presented when the line sweep path is parallel to an edge of the cell boundary. The total time to complete the coverage task is minimized. A unique contribution of this work is that the optimal sequence of cell visits is computed in addition to the optimal line sweep paths and the optimal cell decomposition.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.7
• /
• pp.108-118
• /
• 1994

By using a concept of interrelation vector between line segments a new algorithm for partial shape recognition of two-dimensional objects is introduced. The interrelation vector which is invariant under translation rotation and scaling of a pair of line segments is used as a feature information for polygonal shape recognition. Several useful properties of the interrelation vector are also derived in relation to efficient partial shape recognition. The proposed algorithm requires only small space of storage and is shown to be computationally simple and efficient.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.8
• /
• pp.1099-1109
• /
• 1995

By using a concept of interrelation quadruplet between line segments, a new method for recognition of object families is introduced. The interrelation quadruplet, which is invariant under similarity transform of a pair of line segments, is used as a feature information for polygonal shape recognition. Several useful propertes of the interrelation quadruplet are derived in relation to efficient recognition of object families. Compared with the previous methods, the proposed method requires only small space of storage and is shown to be computationally simple and efficient.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.12
• /
• pp.1984-1994
• /
• 1989

Techniques for approximating digitalcurves by polygonal lines are a valuable tool for image analysis and data compression. S. Shilien proposed a method for segmenting a digital curve into digital straight line segments digital straight line segments which are not satisfied with the structural properties, and have more than one break point by Shilien's method. Here, the structural representation of digital straight lines and digital staight line segments is described. And a method for segmenting a digital curve into digital straight line segments which are not satisfied with the structural properties, and have more than one break point by Shilien's method. Here, the structural representation of digital straight lines and digital staight line segments is described. And a method for segmenting a digital curve into digital straight line segments which may be not satisfied with the structural properties is proposed. The number of break points extracted by this method is less than that by S. Shilien's method from the digital curve which includes the digital straight line segments not satisfied with the structural properties.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.4
• /
• pp.132-137
• /
• 2007

A point-wise car-like robot moving in the plane changes its direction with a constraint on turning curvature. In this paper, we consider the problem of computing a shortest path of bounded curvature between a prescribed initial configuration (position and orientation) and a polygonal goal, and propose a new geometric proof showing that the shortest path is either of type CC or CS (or their substring), where C specifies a non-degenerate circular arc and S specifies a non-degenerate straight line segment. Based on the geometric property of the shortest path, the shortest path from a configuration to a polygonal goal can be computed in linear time.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.17 no.3 s.106
• /
• pp.249-258
• /
• 2006

In this letter, we propose a novel printed helix antenna for RFID reader in UHF band. The printed strip line of the antenna is first wound up outside a polygonal shaped layer and then the winding continues on an inner layer to control the overall gain and the radiation pattern. In addition, the winding pitch angles on each layer have either negative or positive values resulting in the broad CP bandwidth. The detail structure of the antenna was optimized using Pareto genetic algorithm(GA), so as to obtain excellent performances for RFID reader antennas. The optimized two-layered polygonal helix was fabricated on the cardboard of a flexible substrate and the performances were measured and compared with the simulations. The fabricated antenna was made up of copper tape which can adhere to a flexible cardboard and had 21.4 % matching bandwidth, 31.9 % CP bandwidth, readable range of $5.5m^2$ with kr=3.2. Also based on the current distribution of the strip line of the antenna and sensitivity of the antenna bents points, we confirmed that the antenna has the quarter-wave transformer near the feed for the broad matching bandwidth and radiates the traveling wave for the broad CP bandwidth using the bent strip line.

• Journal of Advanced Navigation Technology
• /
• v.13 no.1
• /
• pp.142-150
• /
• 2009

It is very important to generate a simplified model from a complex 3D character in computer game. We propose a new method of extracting feature lines from a 3D game character. Given an unstructured 3D character model containing texture information, we use model feature map (MFM), which is a 2D map that abstracts the variation of texture and curvature in the 3D character model. The MFM is created from both a texture map and a curvature map, which are produced separately by edge-detection to locate line features. The MFM can be edited interactively using standard image-processing tools. We demonstrate the technique on several data sets, including, but not limited to facial character.

• Journal of Welding and Joining
• /
• v.30 no.1
• /
• pp.64-71
• /
• 2012

The characteristics of high heat input (342kJ/cm) EG (Electro Gas Arc) welded joint of EH36-TM steel has been investigated. The weld metal microstructure consisted of fine acicular ferrite (AF), a little volume of polygonal ferrite (PF) and grain boundary ferrite (GBF). Charpy impact test results of the weld metal and heat affected zone (HAZ) met the requirement of classification rule (Min. 34J at $-20^{\circ}C$). In order to evaluate the relationship between the impact toughness property and the grain size of HAZ, the austenite grain size of HAZ was measured. The prior austenite grain size in Fusion line (F.L+0.1 mm) was about $350{\mu}m$. The grain size in F.L+1.5 mm was measured to be less than $30{\mu}m$ and this region was identified as being included in FGHAZ(Fine Grain HAZ). It is seen that as the austenite grain size decreases, the size of GBF, FSP (Ferrite Side Plate) become smaller and the impact toughness of HAZ increases. Therefore, the CGHAZ was considered to be area up to 1.3mm away from the fusion line. Results of TEM replica analysis for a welded joint implied that very small size ($0.8\sim1.2{\mu}m$) oxygen inclusions played a role of forming fine acicular ferrite in the weld metal. A large amount of (Ti, Mn, Al)xOy oxygen inclusions dispersed, and oxides density was measured to be 4,600-5,300 (ea/mm2). During the welding thermal cycle, the area near a fusion line was reheated to temperature exceeding $1400^{\circ}C$. However, the nitrides and carbides were not completely dissolved near the fusion line because of rapid heating and cooling rate. Instead, they might grow during the cooling process. TiC precipitates of about 50 ~ 100nm size dispersed near the fusion line.

• Journal of Korea Multimedia Society
• /
• v.10 no.5
• /
• pp.594-603
• /
• 2007

This paper proposes a watermarking scheme for 3D CAD design drawing. In the proposed scheme, we embed binary watermarks into line, arc, and polygon face components that are the basic component of 3D CAD design drawing. The embedding target component can be selected randomly among three components or by the component distribution in drawing. In line components, a watermark bit is embedded into the ratio of the length of a target line and an average length of lines that are connected into a target line. Furthermore, a watermark bit is embedded into a curvature radius on the basis of a center point in a arc component and also is embedded into a ratio of two sides in a polygonal face component. Experimental results verified that the proposed watermarking has the robustness against Format conversion, rotation translation, scaling, cropping, and layer cutting and also SNR of watermarked component is about 39.89-42.50 dB.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1437-1445
• /
• 1999

n개의 꼭지점을 가진 단조(monotone) 다각형은 2차원 평면상의 임의의 선분에 단조 적인 2개의 체인으로 구성된다. 단조 다각형의 내부를 경로 상에서 모두 감시할 수 있는 최소 링크를 가진 경비원 경로(watchman route with minimum links)는 최소 개수의 선분으로 구성된 경로로서 하나 이상 존재할 수 있다. 본 논문에서는 단조 다각형의 최소 링크를 가진 경비원 경로들 중에서 최단 경비원 경로를 구하는 O(n) 시간의 알고리즘을 제시한다.Abstract A monotone polygon consists of n vertices and is a union of two monotone chains with respect to some line segment in the plane. A watchman route with minimum-links is a polygonal path such that each point in the interior of the polygon can be visible from at least one point along the route. There may be more than one watchman route with minimum links for given monotone polygon. In this paper, we present an algorithm with O(n) time that finds a shortest watchman route among the watchman routes with minimum links in a monotone polygon.