• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.19 no.3
• /
• pp.16-24
• /
• 2011

In this research, a cockpit display system using 3 dimensional geographic information was developed. A coordinate transformation method from WGS84 to TM was first studied. Octree data structure was used for efficient 2D and 3D graphic display. Also, a 3D graphic engine was developed for fast display with large amount of geographic data which can be practically used in aircraft onboard computer having low performance. This 3D engine contains additional function such as geographic and object information loading, many kinds of camera mode, aircraft position and rotation control function, character strip display. In the future research, actual GPS signal should be used and additional information that can help pilot's decision should be display.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.241-243
• /
• 2005

정보생물학 분야에 있어서 분자 구조를 3차원으로 렌더링하여 보여주는 것은 매우 중요한 작업이다. 특히 분자의 표면 렌더링은 분자 구조를 분석 하는데 필요한데, 렌더링을 하는데 있어서 폴리곤이 많이 필요하게 된다. 특히 분자량이 많은 거대 분자를 3차원으로 렌더링 하기 위해서는 고가의 그래픽 전용 워크스테이션을 사용하게 된다. 본 논문에서는 저렴한 일반 PC 급 시스템에서도 거대 분자를 렌더링 할 수 있는 알고리즘을 제안 하였다. 제안하는 알고리즘에는 옥트리(Octree)를 전처리로 사용한 Hybrid Point & Polygon 렌더링 기법을 적용 하였다. 각 렌더링 과정은 최적의 성능을 내기 위하여 GPU가 작업을 처리한다.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.361-364
• /
• 2004

This paper describes an automatic 3D models generation algorithm based on 2D silhouette images, using X-ray camera without camera parameters. The algorithm takes a multi steps process approach. First, a series of 2D silhouette images is captured from different directions of object and then converted to binary images. An octree data structure is constructed for voxel-based representation of object. An estimate 3D volume of object can be reconstructed by intersecting voxels and the 2D silhouettes. The marching cube algorithm is applied to get triangle mesh representing of the obtained 3D model for rendering.

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.5
• /
• pp.339-348
• /
• 2005

In this paper, LOD (Level Of Detail) for flocking, which is the real-time simulation on the movement or some groups such as fighting soldiers, moving fishes and flying birds, is presented. And a flocking LOD algorithm that uses factors such as the speed of fish, direction, and shape is proposed. Model data is modified for LOD in advance, so as to reduce strange edge collapse and unwanted holes. The errors of model data were identified by transforming polygonal model into octree-based cubes and revised before rendering. Experimental results show that the proposed algorithm considering flocking characteristics shows fast frame rates as compared with the conventional continuous LOD algorithm.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.914-916
• /
• 2003

Most current 3D digital maps are 2.5 dimension models based on DEM, which can only be recognized, browsed and operated by a special software, far from meeting the needs of a modern digital city (global) with the distributed, isomerous and multiple application on the real 3D representation and open sharing models. In this paper, a new generation digital city oriented 3D digital map is studied. Firstly, a real 3D digital map representation is presented. And then, some key techniques and methods for browser-based 3D digital map’s representation, display and operation are introduced, which can realized the open sharing of 3D map in distributed, isomerous and multiple application environment. Furthermore, the scale driving technique of proposed 3D digital map is also studied. And currently, some developments based on some of the above methods are being carried to provide key and general platform for other application software’s development.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2005.05a
• /
• pp.209-214
• /
• 2005

In this paper, finite element simulation of three-dimensional bulk metal forming processes is performed by an automated adaptive tetrahedral mesh generation scheme. A dynamic data exchange scheme is employed between tetrahedral mesh generator and forging simulator to minimize user intervention. Both number of elements and density distributions are controlled by the octree technique. The presented approach is applied to automatic forging simulation in order to evaluate the efficiency of the developed schemes and the simulation results are compared with $DEFORM^{TM}$.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2004.05a
• /
• pp.688-691
• /
• 2004

본 논문에서는 메쉬, 복셀, 골격 데이터를 포함하는 복합적인 옥트리 기반의 형상 표현을 이용하여 해마의 형상을 분석하기 위한 효과적인 방법을 제공한다. 먼저, 자기공명영상으로부터 분할된 해마 영역에 마칭큐브 알고리즘을 적용하여 다단계 메쉬 데이터를 생성한다. 이렇게 생성된 메쉬 모델을 하드웨어 깊이맵을 이용한 복셀화 과정을 통하여, 중간 단계의 이진 복셀 표현으로 변환한다. 마지막으로 광선 추적 방법에 의해 추출된 샘플 메쉬들에 대하여 L2 Norm을 계산함으로써 형상 특징을 생성한다. 본 연구에서 제시한 방법은 사용자 피킹 인터페이스를 이용하여 국부적 부위에서의 계층적 형상 분석을 가능하게 한다. 또한 계층적 Level-of-Detail 접근방법은 정확도를 유지하며 형상분석의 소요 시간을 절약하도록 한다.

• Journal of the Semiconductor & Display Technology
• /
• v.16 no.3
• /
• pp.99-105
• /
• 2017

This paper confirms the similarity of temperature tendency through numerical analysis and comparison with test, and it also confirms that temperature prediction of LED lightings is possible by numerical analysis. We confirmed that the temperature difference is about $10{\sim}20^{\circ}C$ except for some measurement points and shows similar tendency with the interpretation through manufacturing and performance analysis of AL heat sink applied Circular LED street lights and manufacturing and performance analysis of CMP-PLA heat sink applied Circular LED street lights. The simulations use Octree technique in SC/Tetra to set the grid size df the surface.

• Journal of the Korea Computer Graphics Society
• /
• v.16 no.1
• /
• pp.1-7
• /
• 2010

With the widespread use of vision-based surveillance systems, the capability for person identification is now an essential component. However, the CCTV cameras used in surveillance systems tend to produce relatively low-resolution images, making it difficult to use face recognition techniques for person identification. Therefore, an algorithm is proposed for person identification in CCTV camera images based on the clothing. Whenever a person is authenticated at the main entrance of a building, the clothing feature of that person is extracted and added to the database. Using a given image, the clothing area is detected using background subtraction and skin color detection techniques. The clothing feature vector is then composed of textural and color features of the clothing region, where the textural feature is extracted based on a local edge histogram, while the color feature is extracted using octree-based quantization of a color map. When given a query image, the person can then be identified by finding the most similar clothing feature from the database, where the Euclidean distance is used as the similarity measure. Experimental results show an 80% success rate for person identification with the proposed algorithm, and only a 43% success rate when using face recognition.

• Journal of the Korea Computer Graphics Society
• /
• v.15 no.3
• /
• pp.19-26
• /
• 2009

In this paper, a new adaptive vertex clustering using a KD-tree is presented for 3D mesh partitioning. A vertex clustering is used to divide a huge 3D mesh into several partitions for various mesh processing. An octree-based clustering and K-means clustering are currently leading techniques. However, the octree-based methods practice uniform space divisions and so each partitioned mesh has non-uniformly distributed number of vertices and the difference in its size. The K-means clustering produces uniformly partitioned meshes but takes much time due to many repetitions and optimizations. Therefore, we propose to use a KD-tree to efficiently partition meshes with uniform number of vertices. The bounding box region of the given mesh is adaptively subdivided according to the number of vertices included and dynamically determined axis. As a result, the partitioned meshes have a property of compactness with uniformly distributed vertices.