• Proceedings of the Society of Korea Industrial and System Engineering Conference
• /
• 2002.05a
• /
• pp.455-460
• /
• 2002

As the transmission of 3D shape models through Internet becomes more important, the compression issue of shape models gets more critical. The issues for normal vectors have not yet been explored as much as it deserves, even though the size of the data for normal vectors can be significantly larger than its counterparts of topology and geometry. Presented in this paper is an approach to compress the normal vectors of a shape model represented in a mesh using the concept of clustering. It turns out that the proposed approach has a significant compression ratio without a serious sacrifice of the visual quality of the model.

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.531-536
• /
• 2001

The structural shape optimization is a useful tool for engineers to determine the shape of a structure. During the optimization process, relocations of nodes happen successively. However, excessive movement of nodes often results in the mesh distortion and eventually deteriorates the accuracy of the optimum solution. To overcome this problem, an efficient method for the shape optimization has been developed. The method starts from the design domain which is large enough to hold the possible shape of the structure. The design domain has pre-defined uniform fine meshes. At every cycle, the method judges whether all the elements are inside of the structure or not. Elements inside of the structure are assigned with real material properties, however elements outside of the structure are assigned with nearly zero values. The performance of the method is evaluated through various examples.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.171-173
• /
• 2000

본 논문에서는 ATM PNNI(Private Network-Network Interface) 망에서 경로 배정을 위해 필요로 하는 링크 상태 정보(link state information)를 효율적으로 집단화(aggregation)하는 두 가지 방법을 제시한다. 이 방법들은 집단화할 동료 집단(peer group)의 경계노드(border node)들을 셔플넷(shufflenet)이나 de Bruijn 그래프의 노드들로 사상시킴으로써 표현해야 할 링크의 수를 완전 그물망 방법(full-mesh approach)의 N2에서 aN(a는 정수, N은 경계노드 수)으로 줄인다. 이는 공간 복잡도가 0(N)인 신장 트리(apanning tree) 방법에서 필요로 하는 링크의 수와 비슷하지만, 신장 트리 방법과는 달리 비대칭망(asymmetric network)에서 사용할 수 있다는 것이 큰 장점이다. 모의 실험 결과 셔플넷 방법은 aN개의 링크만을 표현하면서도 상태 정보의 정확성은 완전 그물망 방법에 근접함을 알 수 있었고, de Bruijn 방법은 정보의 정확성에서는 셔플넷 방법에 못 미치지만 가장 널리 사용되고 있는 별모양 방법(star approach) 방법보다는 훨씬 정확하며, 계산 복잡도 면에서 셔플넷 방법보다 효율적이었다.

• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.823-826
• /
• 2003

FPGA-based logic emulator with lane gate capacity generally comprises a large number of FPGAs connected in mesh or crossbar topology. However, gate utilization of FPGAs and speed of emulation are limited by the number of signal pins among FPGAs and the interconnection architecture of the logic emulator. The time-multiplexing of interconnection wires is required for multi-FPGA system incorporating several state-of-the-art FPGAs. This paper proposes a circuit partitioning algorithm called SCATOMi(SCheduling driven Algorithm for TOMi)for multi-FPGA system incorporating four to eight FPGAs where FPGAs are interconnected through TOMi(Time-multiplexed, Off-chip, Multicasting interconnection). SCATOMi improves the performance of TOMi architecture by limiting the number of inter-FPGA signal transfers on the critical path and considering the scheduling of inter-FPGA signal transfers. The performance of the partitioning result of SCATOMi is 5.5 times faster than traditional partitioning algorithms. Architecture comparison show that the pin count is reduced to 15.2%-81.3% while the critical path delay is reduced to 46.1%-67.6% compared to traditional architectures.

• Journal of computational fluids engineering
• /
• v.18 no.2
• /
• pp.41-48
• /
• 2013

Ice accretion on the solid surface is an importance factor in assessing the performance of aircraft and wind turbine blade. Changes in the external shape due to ice accretion can greatly deteriorate the aerodynamic performance. In this study, a three-dimensional upwind-type second-order positivity-preserving finite volume CFD scheme based on the unstructured mesh topology is developed to simulate two-phase flow in atmospheric icing condition. The code is then validated by comparing with NASA IRT experimental data on the sphere. The present results of the collection efficiency are found to be in close agreement with experimental data and show improvement near the stagnation region.

• 한국전산유체공학회:학술대회논문집
• /
• 1996.05a
• /
• pp.111-117
• /
• 1996

The Delaunay triangulation technique was tested for complicated shapes of computational domain. While a simple geometry, both in topology and in geometry, was discretized well into triangular elements. a complex geometry often failed in triangularization. A complex geometry should be devided into smaller sub-domains whose shape is simple both topologically and geometrically. The present study developed the data structures not only for relationships among neibering elements but also for shape information, and coupled these into the Delaunay triangulation technique. This approach was able to enhance greatly the reliability of triangularization specially in complicated shapes of computational domains. The GUI (Graphic User Interface) and OOP (Object-Oriented Programming) were used in order to develop the user-friendly and efficient computer code.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.430-432
• /
• 2004

Multicasting is an efficient means of one to many (or many to many) communications. Due to the frequent and unpredictable topology changes, multicast still remains as challenge and no one-size-fits-all protocol could serve all kinds of needs in ad hoc network. Protocols and approaches currently proposed on this issue could be classified mainly into four categories, tree-based, meshed-based, statelessness and hybrid. In this article, we borrow the concept of Eulerian ring in graph theory and propose a novel ring-based multicast framework--Hierarchical Eulerian Ring-Oriented Multicast Architecture (HEROMA) over wireless mobile Ad hoc network. It is familiar with hybrid protocol based on mesh and tree who concentrates on efficiency and robustness simultaneously. Architecture and recovery algorithm of HEROMA are investigated in details. Simulation result is also presented, which show different level of improvements on end-to-end delay in scenario of small scale.

• Journal of the Society of Naval Architects of Korea
• /
• v.41 no.1
• /
• pp.15-22
• /
• 2004

Twin-skeg type stern shapes are recently adopted for very large commercial ships. However it is difficult to apply a CFD system to a hull form having twin-skeg, since grid topology around a twin-skeg type stern is more complicated than that of a conventional single-screw ship, or of an open-shaft type twin-screw ship with center-skeg. In the present study a surface mesh generator and a multi-block field grid generation program have been developed for twin-skeg type stern. Furthermore, multi-block flow solvers are utilized for potential and viscous flow analysis around a twin-skeg type stern The present computational system is applied to a 15,000TEU container ship with twin-skeg to prove the applicability. Wave profiles and wake distribution are calculated using the developed flow analysis tools and the results are compared with towing tank measurements.

• International Journal of CAD/CAM
• /
• v.2 no.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.

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