• 전자통신동향분석
• /
• 제4권1호
• /
• pp.93-117
• /
• 1989

Computational Geometry is concerned with the design and analysis of computational algorithms which solve geometry problems. Geometry problems have a large number of applications areas such as pattern recognition, image processing, computer graphics, VLSI design and statistics since they involve inherently geometric problems for which efficient algorithms have to be developed. Several parallel algorithms, based on various parallel computation models, have been proposed for solving geometric problems. We review the current status of the parallel algorithms in computational geometry.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권6호
• /
• pp.2132-2143
• /
• 2015

This paper presents two distance geometry-based algorithms for wireless location in cellular network systems-distance geometry filtering (DGF) and distance geometry constraint (DGC). With time-of-arrival range measurements, the DGF algorithm estimates the mobile station position by selecting a set of measurements with relatively small NLOS (non-line-of-sight) errors, and the DGC algorithm optimizes the measurements first and then estimates the position using those optimized measurements. Simulation results show that the proposed algorithms can mitigate the impact of NLOS errors and effectively improve the accuracy of wireless location.

• 전자공학회논문지B
• /
• 제31B권5호
• /
• pp.12-25
• /
• 1994

A two dimensional constant geometry FFT algorithms and architectures with shuffled inputs and normally ordered outputs are presented. It is suitable for VLSI implementation because all buterfly stages have identical, regular structure. Also a methodology using shuffled FFT inputs and outputs to halve the number of butterfly stages connected by a global interconnection which requires much area is presented. These algorithms can be obtained by shuffling the row and column of a decomposed FFT matrix which corresponds to one butterfly stage. Using non-recursive and recursive pipeline, the degree of serialism and parallelism in FFT computation can be adjusted. To implement high performance high radix FFT easily and reduce the amount of interconnections between stages, the method to build a high radix PE with lower radix PE 's is discussed. Finally the performances of the present architectures are evaluated and compared.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2003년도 춘계학술대회
• /
• pp.1639-1644
• /
• 2003

A hybrid genetic algorithm is developed for estimating the wall emissivities for an absorbing, emitting, and scattering media in a two-dimensional irregular geometry with diffusely emitting and reflecting opaque boundaries by minimizing an objective function, which is expressed by the sum of square errors between estimated and measured temperatures at only four data positions. The finite-volume method was employed to solve the radiative transfer equation for a two-dimensional irregular geometry. The results show that a developed hybrid genetic algorithms reduce the effect of genetic parameters on the performance of genetic algorithm and that the wall emissivities are estimated accurately without measurement errors.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2004년도 추계학술대회논문집
• /
• pp.954-957
• /
• 2004

Based on the authors' previous work, where a geometric constraint handling technique for stiffener layout optimization problem using geometry algorithms was proposed, stiffener layout optimization to maximize natural frequencies of a curved three-dimensional shell structure was performed with a projection method. The original geometry of the shell structure was first projected on a two-dimensional plane, and then the whole optimization process was performed with the projected geometry of the shell except that the original shell structure was used for the eigenproblem solving. The projection method can be applied to baseline structures with a one-to-one correspondence between original and projected geometries such as automobile hoods and roofs.

• ETRI Journal
• /
• 제10권3호
• /
• pp.125-140
• /
• 1988

Computational geometry has wide applications in pattern recognition, image processing, VLSI design, and computer graphics. Voronoi diagrams in computational geometry possess many important properites which are related to other geometric structures of a set of point. In this pater the design of systolic algorithms for the static and the dynamic Voronoi diagrams is considered. The major motivation for developing the systolic architecture is for VLSI implementation. A new systematic transform technique for designing systolic arrays, in particular, for the problem in computational geometry has been proposed. Following this procedure, a type T systolic array architecture and associated systolic algorithms have been designed for constructing Voronoi diagrams. The functions of the cells in the array are also specified. The resulting systolic array achieves the maximal throughput with O(n) computational complexity.

• 한국멀티미디어학회논문지
• /
• 제9권2호
• /
• pp.172-188
• /
• 2006

본 논문은 무선 센서 네트워크(wireless sensor network)에서 노드들의 위치 추정 문제를 다룬다. 위치 추정을 위한 기존의 기법들은 인접한 노드들 간의 거리를 이용하여 자신의 위치를 추정하는 LGB 기법과 멀리 떨어진 노드들 간의 거리를 추정하여 위치 추정에 이용하는 GGB 기법으로 분류할 수 있다. 그러나 LGB 기법의 경우 상대적으로 정확도가 낮은 거리 측정 기법 하에서는 적합하지 않은 면이 있고, 반면 GGB 기법의 경우 장애물이 있거나 혹은 노드들이 분포한 영역이 사각형이나 원형과 같은 정형이 아닌 경우에는 적용하기 어려운 면이 있다. 본 논문에서는 두 가지 기법을 절충하여 부정확한 거리 측정 기법 하에서 장애물이 있거나 비정형의 영역 내에 분포한 노드들에 대해서도 위치 추정을 가능하게 하는 새로운 위치 추정 알고리즘을 제안하고, 그 성능을 모의실험을 통해서 비교 분석한다.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2004년도 춘계학술대회논문집
• /
• pp.870-875
• /
• 2004

Beam stiffeners have frequently been used for raising natural frequencies of base structures. In stiffener layout optimization problems, most of the previous researches considering the position and/or the length of the stiffener as design variables dealt with structures having just simple convex shapes such as a square or rectangle. The reason is concave shape structures have difficulties ill formulating geometry constraints. In this paper, a new geometry constraint handling technique, which can define both convex and concave feasible lesions and measure a degree of geometry constraint violation, is proposed. Evolution strategies (ESs) is utilized as an optimization tool. In addition, the constraint-handling technique of EVOSLINOC (EVOlution Strategy for scalar optimization with Lineal and Nonlinear Constraints) is utilized to solve constrained optimization problems. From a numerical example, the proposed geometry constraint handling technique is verified and proves that the technique can easily be applied to structures in net only convex but also concave shapes, even with a protrusion or interior holes.

• International Journal of CAD/CAM
• /
• 제2권1호
• /
• pp.55-67
• /
• 2002

In many areas of industry, it is desirable to have fast and reliable systems in order to quickly obtain suitable solid models for computer- aided analyses. Nevertheless it is well known that the data exchange process between CAD modelers and CAE packages can require significative efforts. This paper presents an approach for geometrical data exchange through triangulated boundary models. The proposed framework is founded on the use of STL file specification as neutral format file. This work is principally focused on data exchange among CAD modelers and FEA packages via STL. The proposed approach involves the definition of a topological structure suitable for the STL representation and the development of algorithms for topology and geometry data processing in order to get a solid model suitable for finite element analysis or other computer aided engineering purposes. Different algorithms for model processing are considered and their pros and cons are discussed. As a case study, a prototype modeler which supports an exporting filter for a commercial CAE package has been implemented.

• ETRI Journal
• /
• 제39권1호
• /
• pp.1-12
• /
• 2017

In this paper, we present a new approach for the progressive compression of three-dimensional (3D) mesh geometry using redundant frame dictionaries and sparse approximation techniques. We construct the proposed frames from redundant linear combinations of the eigenvectors of a combinatorial mesh Laplacian matrix. We achieve a sparse synthesis of the mesh geometry by selecting atoms from a frame using matching pursuit. Experimental results show that the resulting rate-distortion performance compares favorably with other progressive mesh compression algorithms in the same category, even when a very simple, sub-optimal encoding strategy is used for the transmitted data. The proposed frames also have the desirable property of being able to be applied directly to a manifold mesh having arbitrary topology and connectivity types; thus, no initial remeshing is required and the original mesh connectivity is preserved.