• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.2926-2945
• /
• 2017

In geo-location database oriented spectrum sharing system, the entire geographic area is divided into meshes to classify, store and delivery the cognitive information. In this paper, we propose a flexible polygon mesh division scheme to reduce the number of meshes. Hence the cognitive information can be reduced correspondingly. Besides, polygon mesh can approximate the real environment and reduce the error of cognitive information because the edges of polygon are selected along the boundaries of the networks. We have designed the polygon approximation algorithm and have analyzed the relation between the error and the number of polygon's edges. Finally, the simulation results are provided to verify the algorithm and analysis. The polygon mesh division scheme in this paper provides an efficient approach for cognitive information organization in database oriented spectrum sharing system.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.6
• /
• pp.1087-1094
• /
• 1987

In this paper, we describe about polygon resizing porblem where the given polygons are expanded or shrunk in two dimensional plane. First, the definition of polygon resizing and it's problems are given, then the enhanced XY method is proposed: the polygon resizing can be completed in one directional sweep of plane only, usisng enhanced plane sweep method. The time complexity is 0(n log n), and space complexity 0(\ulcorner), where n is the number of verties of polygons. The applications of polygon resizing to the mask artwork processing and layout verification are discussed.

• Proceedings of the Optical Society of Korea Conference
• /
• 1999.08a
• /
• pp.128-129
• /
• 1999

Polygon Mirror Scanning(PMS) is composed of LED array, magnifying lens, polygon mirror and motor. It is important to correct the lens aberrations to gain the image we want to show. In this paper, we have simulated the lens aberration correction to reduce the spherical aberration . We have obtained a aspherical lens which is corrected the spherical aberration.

• Journal of information and communication convergence engineering
• /
• v.8 no.1
• /
• pp.59-63
• /
• 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 given 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. Two points of a polygon P are said to be L-visible from each other if they can be joined by a simple chain of at most two rectilinear line segments contained in P completely. An L-visible polygon P is a polygon such that there is a point from which every point of P is L-visible. We present the customized optimal shortest path algorithm for an L-visible polygon. Our algorithm doesn't require triangulating as preprocessing and consists of simple procedures such as construction of convex hulls and operations for convex polygons, so it is easy to implement and runs very fast in linear time.

• Journal of information and communication convergence engineering
• /
• v.15 no.1
• /
• pp.1-6
• /
• 2017

In this study, we develop and experimentally evaluate an ultra-wideband (UWB) slot antenna with a polygon tuning stub. The proposed antenna consists of a polygon slot with a $50-{\Omega}$ feed line. The effects of various parameters of the polygon-shaped slot and the polygon tuning stub on UWB applications are investigated. The optimum parameters were obtained using the Ansys HFSS software. The results of the studies on the surface current distributions of the operating frequency bands were discussed. The proposed antenna is fabricated on an inexpensive FR-4 substrate with the overall dimensions of $28.0mm{\times}30.0mm$. The measured results confirm that the proposed antenna covers frequencies from 2.58 GHz to 13.27 GHz, which is the UWB frequency range. Further, the proposed UWB antenna also exhibited that omni-directionality in the H-plane gain varied from 1.185 to 7.246 dBi. The good antenna characteristics of the proposed antenna make it suitable for UWB system applications.

• International Journal of Precision Engineering and Manufacturing
• /
• v.8 no.1
• /
• pp.3-10
• /
• 2007

A new approach based on implicit surface interpolation combined with domain decomposition is proposed for filling complex-shaped holes in a large polygon model, A surface was constructed by creating a smooth implicit surface from an incomplete polygon model through which the actual surface would pass. The implicit surface was defined by a radial basis function, which is a continuous scalar-value function over the domain $R^{3}$. The generated surface consisted of the set of all points at which this scalar function is zero. It was created by placing zero-valued constraints at the vertices of the polygon model. The well-known domain decomposition method was used to treat the large polygon model. The global domain of interest was divided into smaller domains in which the problem could be solved locally. The LU decomposition method was used to solve the set of small local problems; the local solutions were then combined using weighting coefficients to obtain a global solution. The validity of this new approach was demonstrated by using it to fill various holes in large and complex polygon models with arbitrary topologies.

• Journal of Ocean Engineering and Technology
• /
• v.18 no.2
• /
• pp.77-82
• /
• 2004

The purpose of this study is to develop a nesting algorithm, using a genetic algorithm to optimize nesting order, and modified No Fit Polygon(NFP) methodology to place parts with the order generated from the previous genetic algorithm. Various genetic algorithm techniques, which have thus far been applied to the Travelling Salesman Problem, were tested. The partially mapped crossover method, the inversion method for mutation, the elitist strategy, and the linear scaling method of fitness value were selected to optimize the nesting order. A modified NFP methodology, with improved searching capability for non-convex polygon, was applied repeatedly to the placement of parts according to the order generated from previous genetic algorithm. Modified NFP, combined with the genetic algorithms that have been proven in TSP, were applied to the nesting problem. For two example cases, the combined nesting algorithm, proposed in this study, shows better results than that from previous studies.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.5
• /
• pp.368-373
• /
• 2004

Surface visualization can be useful, particularly for internet-based education and simulation system. Since the mesh data size directly affects the downloading and operational performance, the problem that should be solved for efficient surface visualization is to reduce the total number of polygons, constituting the surface geometry as much as Possible. In this paper, an efficient polygon reduction algorithm based on Stokes＇ theorem, and topology preservation to delete several adjacent vertices simultaneously for past polygon reduction is proposed. The algorithm is irrespective of the shape of polygon, and the number of the polygon. It can also reduce the number of polygons to the minimum number at one time. The performance and the usefulness for medical imaging application was demonstrated using synthesized geometrical objects including plane. cube. cylinder. and sphere. as well as a real human data.

• Journal of the Korean School Mathematics Society
• /
• v.15 no.1
• /
• pp.183-197
• /
• 2012

Geometry having long history of mathematics have important role for thinking power and creativity progress in middle school. The regular polygon included in plane geometry was mainly taught convex regular polygon in elementary school and middle school. In this study, we investigated the denotation's extension of regular polygon by mathematical basic knowledge included in school curriculum. For this research, first, school mathematical knowledge about regular polygon was analyzed. And then, basic direction of research was established for inquiry. Second, based on this analysis inductive inquiry activity was performed with research using geometry software(Cabri Geometry II). Through this study the development of enriched learning material and showing the direction of geometry research is expected.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2008.04a
• /
• pp.863-868
• /
• 2008

This paper investigates the abnormal noise of polygon mirror scanner motor due to the mechanical contact. In the high speed polygon mirror scanner motor the vibration of polygon mirror scanner motor is one of the main sources of abnormal noise, because structure-borne noise due to the vibration is bigger than aerodynamic noise, especially when the rotating part contacts the stationary parts. This research determines the main harmonics of structure-borne noise by using sound quality evaluation. It also develops an experimental set-up to measure the mechanical contact and vibration of polygon mirror scanner motor simultaneously. This paper also show that mechanical contact between rotating shaft and stationary sleeve is one of the dominant vibration sources of structure-borne noise which cause the abnormal noise of the high speed polygon mirror scanner motor by using the developed experimental set-up.