• Title/Summary/Keyword: 3D Ray Tracing

Search Result 119, Processing Time 0.026 seconds

Implementation of Ray Tracing using Hit-Test Unit (Hit-Test Unit을 이용한 Ray Tracing의 구현)

  • Choi, K.Y.;Chung, D.J.
    • Proceedings of the KIEE Conference
    • /
    • 1997.11a
    • /
    • pp.402-404
    • /
    • 1997
  • The synthesis of the 3D images is the most important part of the virtual reality. The ray tracing is the best method for reality in the 3D graphics. But the ray tracing requires long computation time for the synthesis of the 3D images. So, we implements the ray tracing with software and hardware. Specially we designs the hit-test unit with FPGA tool for the ray-tracing.

  • PDF

Propagation Analysis Method in using 3D Ray Tracing Model in Wireless Cell Planning Software (무선망 설계툴에서 3 차원 광선 추적법을 이용한 전파해석 방법)

  • Shin, Young-Il;Jung, Hyun-Meen;Lee, Seong-Choon
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2007.08a
    • /
    • pp.251-255
    • /
    • 2007
  • In this paper, propagation analysis method in using 3D Ray Tracing propagation model in wireless cell planning is proposed. Through 3D Ray Tracing model, we can predict the distribution of propagation loss of the received signal. For correct and a low complex analysis, Quad Tree and Pre-Ordering and Hash Function algorithms are included in 3D Ray Tracing algorithm. And 3D Ray Tracing model is embodied in CellTREK that is developed by KT and used to plan Wibro system analysis. In CellTREK, propagation analysis is performed and that result is represented in 3D viewer. In numerical results, it is showed that the proposed scheme outperforms Modified HATA model when comparing with measurement data.

  • PDF

Implementation of Ray Tracing Processor for the Parallel Processing (병렬처리를 위한 고속 Ray Tracing 프로세서의 설계)

  • Choe, Gyu-Yeol;Jeong, Deok-Jin
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.5
    • /
    • pp.636-642
    • /
    • 1999
  • The synthesis of the 3D images is the most important part of the virtual reality. The ray tracing is the best method for reality in the 3D graphics. But the ray tracing requires long computation time for the synthesis of the 3D images. So, we implement the ray tracing with software and hardware. Specially we design the hit-test unit with FPGA tool for the ray tracing. Hit-test unit is a very important part of ray tracing to improve the speed. In this paper, we proposed a new hit-test algorithm and apply the parallel architecture for hit-test unit to improve the speed. We optimized the arithmetic unit because the critical path of hit-test unit is in the multiplication part. We used the booth algorithm and the baugh-wooley algorithm to reduce the partial product and adapted the CSA and CLA to improve the efficiency of the partial product addition. Our new Ray tracing processor can produce the image about 512ms/F and can be adapted to real-time application with only 10 parallel processors.

  • PDF

A Novel Performance Evaluation Methodology for Small Cell Networks (소형셀 네트워크 성능 분석을 위한 새로운 평가 방법)

  • Lim, Yeon-Geun;Chae, Chan-Byoung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.12
    • /
    • pp.1110-1116
    • /
    • 2013
  • A 3D-ray tracing tool is a software considering reflection, penetration, and diffraction of the signals to provide accuracy. To provide communication resources effectively, communication standards adopt Heterogeneous Networks (HetNets) that includes small cells. A 3D performance evaluation methodology becomes more and more important since the coverage of the small cell networks is narrower than that of the macro cell networks. It is difficult to directly apply conventional 2D mathematical models due to the complexity of small cell network; since they have many considerations such as topography, placement of buildings and 3D beamforming techniques. In this paper, we introduce an effective performance evaluation methodology for small cell networks using 3D-ray tracing tool. From simulation results, we conclude that new performance evaluation methodologies by using 3D-ray tracing tool is more suitable than conventional methodology for small cell networks.

Real-time Ray-tracing Chip Architecture

  • Yoon, Hyung-Min;Lee, Byoung-Ok;Cheong, Cheol-Ho;Hur, Jin-Suk;Kim, Sang-Gon;Chung, Woo-Nam;Lee, Yong-Ho;Park, Woo-Chan
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.4 no.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.

An Efficient k-D tree Traversal Algorithm for Ray Tracing on a GPU (GPU상에서 동작하는 Ray Tracing을 위한 효과적인 k-D tree 탐색 알고리즘)

  • Kang, Yoon-Sig;Park, Woo-Chan;Seo, Choong-Won;Yang, Sung-Bong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.3
    • /
    • pp.133-140
    • /
    • 2008
  • This paper proposes an effective k-D tree traversal algorithm for ray tracing on a GPU. The previous k-D tree traverse algorithm based on GPU uses bottom-up searching from a leaf to the root after failing to find the ray intersected primitive in the leaf node. During the bottom-up search the algorithm decides the current node is visited or not from the parent node. In such a way, we need to visit the parent node which was already visited and the duplicated bounding box intersection tests. The new k-D tree traverse algorithm reduces the brother and parent duplicated visit by using an efficient method which decides whether the brother node is already visited or not during the bottom-up search. Also the algorithm take place bounding box intersection tests only for the nodes which is not yet done. As a result our experiment shows the new algorithm is about 30% faster than the previous.

A Study on Ray Tracing Method for Wave Propagation Prediction with Acceleration Methods (가속 방법을 이용하는 전파 광선 추적법에 관한 연구)

  • Kwon, Se-Woong;Moon, Hyun-Wook;Oh, Jae-Rim;Lim, Jae-Woo;Bae, Seok-Hee;Kim, Young-Gyu;Park, Joung-Soo;Yoon, Young-Joong
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.20 no.5
    • /
    • pp.471-479
    • /
    • 2009
  • In this paper, we proposed an improved ray tracing method with an amelioration of visible tree structure, a visible face determination method, and non-uniform random test point method. In a proposed visible tree structure, it reduces tree nodes by means of merging similar nodes. In a visible face determination method, it shows that a ray hit test with a packet ray method can reduce a test time. A ray tracing method involving with a packet ray hit test method can improve a tree construction time up to 3.3 times than a ray tracing method with a single ray hit test method. Furthermore, by seeding a non-uniform and random test point on a face, tree construction time is improved up to 1.11 times. Received powers from the proposed ray tracing results and measured results have good agreement with 1.9 dB RMS error.

Indexing of 3D Terrain Space for Predicting Collisions with Moving Objects

  • Wu, Wan-Chun;Seo, Young-Duk;Hong, Bong-Hee
    • 한국공간정보시스템학회:학술대회논문집
    • /
    • 2003.11a
    • /
    • pp.159-162
    • /
    • 2003
  • In this paper, to find probable collision positions between moving object and terrain in 3D space efficiently, we use a model, similar to Ray Tracing, which finds the triangles intersected by a directed line segment from a large amount of triangles. We try to reduce dead space as much as possible to find candidate triangles intersected by a directed line segment than previous work's. A new modified octree, LBV-Octree(Least Bounding Voxel Octree), is proposed, and we have a ray tracing with it. In the experiment, ray tracing with LBV-Octree provides $5%{\sim}11%$ better performance than with classical octree.

  • PDF

Acceleration Techniques for 3D Ray Tracing for Outdoor Propagation Model (실외 전파 특성 계산을 위한 고속 3차원 광선 추적법)

  • Lee, Haeng-Seon
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.18 no.11
    • /
    • pp.1231-1236
    • /
    • 2007
  • In this paper, acceleration techniques for a three dimensional ray tracing method are presented. Ray tracing methods are widely adopted to obtain radio propagation channel models, however calculation times increase with the number of scatters such as buildings, hills and mountains. Various techniques are proposed in combination of ray tube concept.

The Representation of 3-D Objects Using Ray Tracing and Space Subdivision (광선 추적법과 공간 분할을 이용한 입체 도형의 표현)

  • Kim, Y.I.;Cho, D.U.;Choi, B.U.
    • Proceedings of the KIEE Conference
    • /
    • 1987.07b
    • /
    • pp.1073-1076
    • /
    • 1987
  • In this paper, a new ray tracing algorithm which uses space subdivision method is introduced. In order to reduce huge number of ray-surface intersection calculation, the space is subdivided as lattice that contains minimum number of objects. With lattice structure, the process that calculates unnecessary ray-surface intersection is eliminated.

  • PDF