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

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.4
• /
• pp.347-358
• /
• 2000

The view dependency of typical spatial-partitioning based NC simulation methods is overcome by polygon rendering technique that generates polygons to represent the workpiece, thus enabling dynamic viewing transformations without reconstruction of the entire data structure. However, the polygon rendering technique still has difficulty in realizing real-time simulation due to unsatisfactory performance of current graphics devices. Therefore, it is necessary to develop a mesh decimation method that enables rapid rendering without loss of display quality. In this paper. we proposed a new mesh decimation algorithm thor a workpiece whose shape varies dynamically. In this algorithm, the 2-map data thor a given workpiece is divided into several regions, and a triangular mesh is constructed for each region first. Then, if any region it cut by the tool, its mesh is regenerated and decimated again. Since the range of mesh decimation is confined to a few regions, the reduced polygons for rendering can be obtained rapidly. Our method enables the polygon-rendering based NC simulation to be applied to the computers equipped with a wider range of graphics cards.

• Journal of Korea Game Society
• /
• v.21 no.2
• /
• pp.79-88
• /
• 2021

Particle and noise are effectively used to implement unspecific VFX like an explosion, magic. Particle can create freely but, The more usage, the higher CPU/GPU usage. This paper using polygon mesh that is hard to change but consumes fixed resources to overcome the demerit of particle and reduce CPU/GPU usage. Also, using shader, apply noise texture that is suitable unspecific pattern to vertex and surface texture mapping of polygon mesh for implement VFX in unity. As a result of experiment, shader applied sphere polygon mesh show 2~4ms CPU, 1~2ms GPU usage in profiler. Also It has been shown that shader can be used to implement unspecific VFX.

• Journal of Institute of Convergence Technology
• /
• v.12 no.1
• /
• pp.1-5
• /
• 2022

This paper describes an algorithm for generating a terrain using a noise function and a height map as one of the procedural terrain generation methods. The polygon mesh data structure to represent the generated terrain concisely and render it is also described. The Perlin noise function is used as the noise technique for terrain mesh, and the height data of the terrain is generated by combining the four noise waves. In addition, the terrain height information can be also obtained from actual image data taken from the satellite. The algorithm presented in this paper generates the geometry part of the polygon topography from the height data obtained, and generated a material for texture mapping with two textures, that is, a diffuse texture and a normal texture. The validity of the terrain method proposed in this paper is verified through application examples, and its possibility can be confirmed through performance verification.

• 대한방사선방어학회:학술대회논문집
• /
• 2011.11a
• /
• pp.170-171
• /
• 2011

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.12
• /
• pp.640-647
• /
• 2002

In this paper, we consider the problems related to the edge visibility on a reconfigurable mesh(in short, RMESH). The following basic problems related to the edge visibility are considered: First, determine if a given polygon is visible from a specific edge, Second, find all edges from which a given polygon is visible. Third, compute the visibility polygon from a specific edge of a given polygon. In this paper, we consider the following problem in order to solve these problems in constant time: given two edges e and f of a simple polygon p, compute the maximal interval of f which is visible from e. We present a constant time algorithm for the problem on an N-N RMESH, where N is the number of vertices of P. Applying the algorithm, we can solve the above three problems in a constant time on a reconfigurable mesh. Specially, we can solve the third problem in a constant time on an N-$N_2$ RMESH.

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

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.795-797
• /
• 2014

The visibility polygon of a simple polygon P is the set of points which are visible from a visibility source in P such as a point or an edge. Since a visibility polygon is the set of points, the set operations such as intersection and union can be executed on them. The intersection(resp. union) of two visibility polygons is the set of points which are visible from both (resp. either) of the corresponding two visibility sources. As previous results, there exist O(n) time algorithms for the set operations of two visibility polygons with total n vertices. In this paper, we present $O(log^2n)$ time algorithms for solving the problems on a reconfigurable mesh with size $O(n^2)$.

• Structural Engineering and Mechanics
• /
• v.45 no.3
• /
• pp.411-422
• /
• 2013

A well-designed mesh shape of the cable net is of essential significance to achieve high performance of cable-network antenna reflectors. This paper is concerned with the mesh design problem for such antenna reflector structure. Two new methods for creating the topological forms of the cable net are first presented. Among those, the cyclosymmetry method is useful to generate different polygon-faceted meshes, while the topological mapping method is suitable for acquiring triangle-faceted meshes with different mesh grid densities. Then, the desired spatial paraboloidal mesh geometrical configuration in the state of static equilibrium is formed by applying a simple mesh generation approach based on the force density method. The main contribution of this study is that a general technical guide for how to create the connectivities between the nodes and members in the cable net is provided from the topological point of view. With the new idea presented in this paper, multitudes of mesh configurations with different net patterns can be sought by a certain rule rather than by empiricism, which consequently gives a valuable technical reference for the mesh design of this type of cable-network structures in the engineering.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2023.01a
• /
• pp.369-372
• /
• 2023

본 논문에서는 삼각형 구조로 구성된 3차원 메쉬(Mesh)에서 합성곱 신경망(Convolution Neural Network, CNN)을 응용하여 정확도가 높은 새로운 학습 표현 기법을 제시한다. 우리는 메쉬를 구성하고 있는 폴리곤의 edge와 face의 로컬 특징을 기반으로 학습을 진행한다. 일반적으로 딥러닝은 인공신경망을 수많은 계층 형태로 연결한 기법을 말하며, 주요 처리 대상은 1, 2차원 데이터 형태인 오디오 파일과 이미지였다. 인공지능에 대한 연구가 지속되면서 3차원 딥러닝이 도입되었지만, 기존의 학습과는 달리 3차원 딥러닝은 데이터의 확보가 쉽지 않다. 혼합현실과 메타버스 시장의 확대로 인해 3차원 모델링 시장이 증가하고, 기술의 발전으로 데이터를 획득할 수 있는 방법이 생겼지만, 3차원 데이터를 직접적으로 학습에 이용하는 방식으로 적용하는 것은 쉽지 않다. 그렇게 때문에 본 논문에서는 산업 현장에서 이용되는 데이터인 메쉬 구조를 폴리곤의 최소 단위인 삼각형 형태로 구성하여 학습 데이터를 구성해 기존의 방법보다 정확도가 높은 학습 기법을 제안한다.