• Journal of the Korea Society of Computer and Information
• /
• v.10 no.3 s.35
• /
• pp.345-352
• /
• 2005

This paper aims to design Game Rendering Engine for real-time 3D online games. Previous, in order to raise rendering speed, BSP tree was used to partitioned space in Quake Game Engine. A game engine is required to develop for rapidly escalating of 3D online games in Korea. too. Currently rendering time is saved with the hardware accelerator which is working on the high-level computer system. On the other hand, a game engine is needed to save rendering time for users with low-level computer system. Therefore, a game rendering engine is which reduces rendering time by PVS look-up table using Empty space BSP tree designed and implemented in this paper

• Journal of Digital Contents Society
• /
• v.9 no.4
• /
• pp.771-778
• /
• 2008

A Device performance analyzing method for appropriate level in hybrid rendering model is suggested. In recent research, we proposed a hybrid rendering model which is applying a proper shading method to each of polygons consisting of an object. The number of polygon for Gouraud shading and that for flat shading should be considered according to a current device performance and system environments. Therefore, this paper suggests the method to calculate automatically a proper resolution of a mesh of object and a proper level of mixture between Gouraud and a flat shading, considering a current device performance and a preference of end-user. The rendering model is so simple that it can be an efficient replacement to reduce a real-time rendering time since it provides automatically multi-level of rendering resolution to an executing environments. Moreover, it can be adopted in real-time adaptive service for 3D graphic contents like a graphic game under various device environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.5063-5073
• /
• 2016

In this paper, an efficient texture compression method is proposed for fast rendering, which exploits the spatial correlation among blocks through intra-picture block matching. Texture mapping is widely used to enhance the visual quality of results in real-time rendering applications. For fast texture mapping, it is necessary to identify an effective trade-off between compression efficiency and computational complexity. The conventional compression methods utilized for image processing (e.g., JPEG) provide high compression efficiency while resulting in high complexity. Thus, low complexity methods, such as ETC1, are often used in real-time rendering applications. Although these methods can achieve low complexity, the compression efficiency is still lower than that of JPEG. To solve this problem, we propose a texture compression method by reducing the spatial redundancy between blocks in order to achieve the better compression performance than ETC1 while maintaining complexity that is lower than that of JPEG. Experimental results show that the proposed method achieves better compression efficiency than ETC1, and the decoding time is significantly reduced compared to JPEG while similar to ETC1.

• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.3
• /
• pp.276-284
• /
• 2022

In this paper, we implemented cloud rendering using WebRTC for high-quality AR and VR services. Cloud rendering is an applied technology of cloud computing. It efficiently handles the rendering of large volumes of 3D content. The conventional VR and AR service is a method of downloading 3D content. The download time is delayed as the 3D content capacity increases. Cloud rendering is a streaming method according to the user's point of view. Therefore, stable service is possible regardless of the 3D content capacity. In this paper, we implemented cloud rendering using WebRTC and analyzed its performance. We compared latency of 100MB, 300MB, and 500MB 3D AR content in 100Mbps and 300Mbps internet environments. As a result of the analysis, cloud rendering showed stable latency regardless of data volume. On the other hand, the conventional method showed an increase in latency as the data volume increased. The results of this paper quantitatively evaluate the stability of cloud rendering. This is expected to contribute to high-quality VR and AR services

• Journal of Korea Game Society
• /
• v.10 no.1
• /
• pp.157-165
• /
• 2010

This paper presents a novel real-time rendering algorithm based on spherical coordinate system of the object using convex hull. While OpenGL rendering pipeline touches all vertices of an object, the proposed method takes account the only visible vertices by examining the visible triangles of the object. In order to determine the visible areas of the object in its spherical coordinate representation, the proposed method uses 3D geometric relation of 6 plane equations of the camera frustum and the bounding sphere of the object. In addition, we compute the convex hull of the object and its maximum side factors for hidden surface removal. Simulation results showed that the quality of result image is almost same compared to original image and rendering performance is greatly improved.

• Journal of Korea Game Society
• /
• v.6 no.4
• /
• pp.55-61
• /
• 2006

Graphics rendering pipeline (application, geometry, and rasterizer) is the core of real-time graphics which is the most important functionality for computer games. Usually this rendering process is completed by both the CPU and the GPU, and a bottleneck can be located either in the CPU or the GPU. This paper focuses on reducing the bottleneck between the CPU and the GPU. We are proposing a method for improving the performance of parallel processing for real-time graphics rendering by separating the CPU operations (usually performed using a thread) into two parts: pure CPU operations and operations related to the GPU, and let them operate in parallel. This allows for maximizing the parallelism in processing the communication between the CPU and the GPU. Some experiments lead us to confirm that our method proposed in this paper can allow for faster graphics rendering. In addition to our method of using a dedicated thread for GPU related operations, we are also proposing an algorithm for balancing the graphics pipeline using the idle time due to the bottleneck. We have implemented the two methods proposed in this paper in our networked 3D game engine and verified that our methods are effective in real systems.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.6
• /
• pp.344-353
• /
• 2006

In this paper, we present a new algorithm which imitate real pencil strokes. The purpose of research on NPR(Non-Photorealistic Rendering) is simulating automatically manmade artistic expressions such as pen-and-ink illustrations, watercolor paintings, pencil sketches and pastel drawings with computers. Recently, there has been a great deal of research works on NPR. One of them is researching in pencil illustration methods for NPR, and a lot of researchers have investigated into the LIC(Linear Integral Convolution) techniques which would change the initial images into the output images by directional vector field images for generating effects of pencil. However, the LIC techniques can not be applied to real-time drawing tools because they are post processing techniques. This paper presents a real-time pencil strokes algorithm which is based on an observation of how pencils(from 6B to 6H) draw lines. Although this algorithm using some pencil variables and noise generation is simple, it is fast and also can draw real-time pencil strokes similar to real manmade pencil strokes in a GUI drawing tool.

• Journal of Korea Multimedia Society
• /
• v.13 no.2
• /
• pp.298-307
• /
• 2010

The grass is one of important components that cover the wide surfaces in the application such as game or real time simulation. Actually, it not easy to render effectively numerous grasses that grow over the wide terrain. To solve the difficulty, we must find a solution to the two contradictions in terms : quality and calculation cost. As a solution to the above-mentioned task, in this paper, we propose an efficient method to represent the natural grasses by introducing fractal theory and instancing technique. Although the existing grass representation methods make use of a simple rule of applying a basic grass model repeatedly in rendering process, on the contrary we take advantage of the basic property of fractal's self-similarity and we devise a natural representation method suited to the given environment by introducing two important growth factors such as nature of terrain and quantity of light, and finally we apply a GPU-based shader instancing technique to rendering numerous grass models in real-time.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.5_6
• /
• pp.228-237
• /
• 2007

displacement mapping enables us to add realistic details to polygonal meshes without changing geometry. We present a real-time artifacts-free inverse displacement mapping method. In each pixel, we construct a ray and trace the ray through the displacement map to find an intersection. To skip empty regions safely, we traverse the image pyramid of displacement map in top-down order. Furthermore, when the displacement map is enlarged, intersection with bilinear interpolated displacement map can be found. When the displacement map is at distance, our method supports mipmap-like prefiltering to enhance image quality and speed. Experimental results show that our method can produce correct images even at grazing view angles. Rendering speed of a test scene is over hundreds of frames per second and the influence of resolution of displacement map to rendering speed is little. Our method is simple enough to be added to existing virtual reality systems easily.

• Proceedings of the KIEE Conference
• /
• 2000.11d
• /
• pp.712-714
• /
• 2000

In the field of computer graphics, it approached the investigation of outstanding performance and high speed. Although most introduced Anti-Aliasing method were to meet these, it was not to improve speed. Because Anti-Aliasing method was focus on only qualify. Anti-Aliasing Effect is compensated from movement of object on the screen. Speed is important in the REAL-TIME application program like as 3D games. Cause Anti-Aliasing which needs great amount of time is not used in general. This Paper suggest the Efficient Anti-Aliasing method which apply Two-Point Anti-Aliasing Method that informs brightness data of the screen and use adjacent brightness data for real-time rendering.