• 한국컴퓨터그래픽스학회논문지
• /
• 제8권3호
• /
• pp.1-7
• /
• 2002

This paper presents a practical technique for approximating the boundary surface of the volume swept out by three-dimensional objects using the depth-buffer. Objects may change their geometries and orientations while sweeping. The sweep volume is approximated as a union of volume elements, which are just rendered inside appropriate viewing frusta of virtual cameras and mapped into screen viewports with depth-buffer. From the depth of each pixel in the screen space of each rendering, the corresponding point in the original world space can be computed. Appropriately connecting these points yields polygonal faces forming polygonal surface patches approximately covering some portion of the sweep volume. Each view frustum adds one or more surface patches in this way, and these presumably overlapped polygonal surface patches approximately enclose the whole sweep volume. These patches may further be processed to yield non-overlapped polygonal surfaces as an approximation to the boundary of the original 3D sweep volume.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집; 한국과학기술대학, 충남; 16-17 Oct. 1987
• /
• pp.269-272
• /
• 1987

This paper is concerned on kinematic analysis and simulation of an automatic feeding mechanism subjected by the motion of a curvilinear inverse cam. The main objection is the development of computer-aided design (CAD) program for simulating the motion of the cam-feeding mechanism using computer-graphics. A computer program CACAFS (Computer-Aided Cam and Automatic Feeding System) is independent of computer hardware used. The program is also interactive using a menu-selection technique. As the second part of the paper for the motion simulation of the cam-feeding system, this paper discusses the state-of-art for CAD. The first part of the paper presents the algorithm to simulate the notion of the cam-feeding mechanism.

• 한국컴퓨터정보학회논문지
• /
• 제18권1호
• /
• pp.185-192
• /
• 2013

3D 그래픽 소프트웨어의 대중화, 하드웨어의 발전 등으로 학교교육에서 3D 그래픽 도구를 보다 용이하게 사용할 수 있게 되었다. 그리고 초등학교의 도형영역의 교과 내용이 보다 강화되어 도형영역의 학습 난이도는 증가하였다. 이에 관련 소프트웨어인 스케치업 프로그램을 이용하여 도형 영역에 학습 효과를 증진시켜 보고자 한다. 그러기 위해 기존 연구를 분석하였으며 3D 그래픽 소프트웨어를 분류하고 벡터 그래픽 소프트웨어에 대한 선택의 기준을 제시하여 스케치업을 선택한 이유를 설명하였다. 스케치업을 활용하기 위해 도형영역의 단원을 재구성하였는데 주로 입체도형을 만들고 회전하고 단면을 파악하는 내용을 선정하여 재구성하였다. 그리고 입체도형 쌓기에 대한 내용을 교육과정의 초기에 삽입하였다. 10개 차시를 구성하고 교수학습에서 스케치업을 활용하며 재구성 교육과정을 실천하였다. 그리고 t 검증을 통해 전후 검사를 한 결과 공간 시각화 능력과 공간 방향 능력 분야에서 유의미한 통계 결과가 나타났다. 따라서 스케치업을 이용한 도형학습에의 적용은 효과적인 것으로 해석할 수 있다.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제54권12호
• /
• pp.723-731
• /
• 2005

The $4{\times}4$ homogeneous transformation matrix is a compact representation of orientation and position of an object in robotics and computer graphics. A coordinate transformation is accomplished through the successive multiplications of homogeneous matrices, each of which represents the orientation and position of each corresponding link. Thus, for real time control applications in robotics or animation in computer graphics, the fast multiplication of homogeneous matrices is quite demanding. In this paper, a parallel-architecture vector processor is designed for this purpose. The processor has several key features. For the accuracy of computation for real application, the operands of the processors are floating point numbers based on the IEEE Standard 754. For the parallelism and reduction of hardware redundancy, the processor takes column vectors of homogeneous matrices as multiplication unit. To further improve the throughput, the processor structure and its control is based on a pipe-lined structure. Since the designed processor can be used as a special purpose coprocessor in robotics and computer graphics, additionally to special matrix/matrix or matrix/vector multiplication, several other useful instructions for various transformation algorithms are included for wide application of the new design. The suggested instruction set will serve as standard in future processor design for Robotics and Computer Graphics. The design is verified using FPGA implementation. Also a comparative performance improvement of the proposed design is studied compared to a uni-processor approach for possibilities of its real time application.

• 한국멀티미디어학회논문지
• /
• 제11권8호
• /
• pp.1160-1168
• /
• 2008

모바일 하드웨어 기술의 비약적인 발전으로 과거에는 실시간으로 렌더링 될 수 없었던 다양한 3D 렌더링 효과들을 모바일 기기 상에서 실시간으로 처리할 수 있게 되었으며, 이를 이용하여 보다 사실적인 모바일 3D 응용 프로그램을 제작할 수 있게 되었다. 본 논문에서는 모바일 환경에서 고화질로 실시간 3D 렌더링을 지원하는 DMGL이라 불리는 플랫폼에 독립적인 OpenGL ES 기반 실시간 모바일 렌더링 라이브러리에 관해 설명한다. 모바일 그래픽스 소프트웨어 개발자들은 이 라이브러리를 이용하여 다양한 고급 실시간 3D 그래픽스 효과들을 간단히 구현할 수 있다. 또한 GPGPU 기반의 라이브러리들은 연기나 불과 같은 자연현상 시뮬레이션을 위한 복잡한 방정식들을 풀고, 그 결과를 실시간 렌더링 할 수 있는 기능을 제공한다.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2006년도 한국컴퓨터종합학술대회 논문집 Vol.33 No.1 (A)
• /
• pp.226-228
• /
• 2006

In this paper we describe a simulation and development framework for designing mobile 3D graphics architectures. We are developing a simple and flexible simulation and verification environment (SVE) that uses gITrace's ability to intercept and redirect an OpenGL/ES streams. In combination wlth gITrace to trace OpenGL/ES commands, the SVE simulates the behavior of mobile 3D graphics pipeline during playback of traces, and then produces the second geometry trace that can be used as a test vector for the Verilog/HDL RT-level model. By comparing the frame-by-frame results, we can conduct architectural verification. To demonstrate the functionality of the SVE, we show the implementation of the verified mobile 3D architecture on a FPGA board. For this, we also present an application development environment (ADE) includes a mobile graphics API and a device driver interface (DDI). The proposed two software environments, the SVE and the ADE could be used fer developing and testing mobile applications, architectural study and speculative hardware designs.

• 한국지능시스템학회논문지
• /
• 제19권3호
• /
• pp.444-449
• /
• 2009

컴퓨터 하드웨어 고성능화와 함께 실시간 컴퓨터그래픽스를 활용하는 응용 시스템이 많이 출현하고 있다. 이 논문에서는 3차원 컴퓨터그래픽스에서 모델 내에 애니메이션 동영상이 재생되고 있는 상황에서 반사효과를 효율적으로 구현하는 방법을 제안한다. 제안한 방법은 동영상이 재생영역이 특정 반사평면의 어느 위치에 어떤 형태로 반사되는지 기하학적으로 계산한 다음, 텍스쳐 매핑하는 방법으로 반사효과를 구현하는 것이다. 제안한 방법이 기존의 스텐실 버퍼를 이용한 반사평면 효과 기법에 비하여 동영상과 반사평면의 영상이 함께 나타나는 경우에 처리 속도에는 큰 영향이 없고, 최소 30%에서 최대 127% 정도의 처리율이 개선되는 것을 실험 데이터에서 확인하였다.

• IEIE Transactions on Smart Processing and Computing
• /
• 제4권2호
• /
• pp.65-70
• /
• 2015

In this paper, we describe the world's first real-time ray-tracing chip architecture. Ray-tracing technology generates high-quality 3D graphics images better than current rasterization technology by providing four essential light effects: shadow, reflection, refraction and transmission. The real-time ray-tracing chip named RayChip includes a real-time ray-tracing graphics processing unit and an accelerating tree-building unit. An ARM Ltd. central processing unit (CPU) and other peripherals are also included to support all processes of 3D graphics applications. Using the accelerating tree-building unit named RayTree to minimize the CPU load, the chip uses a low-end CPU and decreases both silicon area and power consumption. The evaluation results with RayChip show appropriate performance to support real-time ray tracing in high-definition (HD) resolution, while the rendered images are scaled to full HD resolution. The chip also integrates the Linux operating system and the familiar OpenGL for Embedded Systems application programming interface for easy application development.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권3호
• /
• pp.1058-1070
• /
• 2014

There are two major ways to implement depth estimation, multiple image depth estimation and single image depth estimation, respectively. The former has a high hardware cost because it uses multiple cameras but it has a simple software algorithm. Conversely, the latter has a low hardware cost but the software algorithm is complex. One of the recent trends in this field is to make a system compact, or even portable, and to simplify the optical elements to be attached to the conventional camera. In this paper, we present an implementation of depth estimation with a single image using a graphics processing unit (GPU) in a desktop PC, and achieve real-time application via our evolutional algorithm and parallel processing technique, employing a compute shader. The methods greatly accelerate the compute-intensive implementation of depth estimation with a single view image from 0.003 frames per second (fps) (implemented in MATLAB) to 53 fps, which is almost twice the real-time standard of 30 fps. In the previous literature, to the best of our knowledge, no paper discusses the optimization of depth estimation using a single image, and the frame rate of our final result is better than that of previous studies using multiple images, whose frame rate is about 20fps.

• Journal of Information Processing Systems
• /
• 제5권2호
• /
• pp.105-116
• /
• 2009

To solve the general problems surrounding the application of genetic algorithms in stereo matching, two measures are proposed. Firstly, the strategy of simplified population-based incremental learning (PBIL) is adopted to reduce the problems with memory consumption and search inefficiency, and a scheme for controlling the distance of neighbors for disparity smoothness is inserted to obtain a wide-area consistency of disparities. In addition, an alternative version of the proposed algorithm, without the use of a probability vector, is also presented for simpler set-ups. Secondly, programmable graphics-hardware (GPU) consists of multiple multi-processors and has a powerful parallelism which can perform operations in parallel at low cost. Therefore, in order to decrease the running time further, a model of the proposed algorithm, which can be run on programmable graphics-hardware (GPU), is presented for the first time. The algorithms are implemented on the CPU as well as on the GPU and are evaluated by experiments. The experimental results show that the proposed algorithm offers better performance than traditional BMA methods with a deliberate relaxation and its modified version in terms of both running speed and stability. The comparison of computation times for the algorithm both on the GPU and the CPU shows that the former has more speed-up than the latter, the bigger the image size is.