• Title/Summary/Keyword: Polygon rendering

Search Result 39, Processing Time 0.029 seconds

Mesh Decimation for Polygon Rendering Based Real-Time 3-Axis NC Milling Simulation (실시간 3축 NC 밀링 시뮬레이션을 위한 메쉬 간략화 방법)

  • Joo, S.W.;Lee, S.H.;Park, K.H.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.5 no.4
    • /
    • pp.347-358
    • /
    • 2000
  • The view dependency of typical spatial-partitioning based NC simulation methods is overcome by polygon rendering technique that generates polygons to represent the workpiece, thus enabling dynamic viewing transformations without reconstruction of the entire data structure. However, the polygon rendering technique still has difficulty in realizing real-time simulation due to unsatisfactory performance of current graphics devices. Therefore, it is necessary to develop a mesh decimation method that enables rapid rendering without loss of display quality. In this paper. we proposed a new mesh decimation algorithm thor a workpiece whose shape varies dynamically. In this algorithm, the 2-map data thor a given workpiece is divided into several regions, and a triangular mesh is constructed for each region first. Then, if any region it cut by the tool, its mesh is regenerated and decimated again. Since the range of mesh decimation is confined to a few regions, the reduced polygons for rendering can be obtained rapidly. Our method enables the polygon-rendering based NC simulation to be applied to the computers equipped with a wider range of graphics cards.

  • PDF

A Real-Time Rendering Algorithm of Large-Scale Point Clouds or Polygon Meshes Using GLSL (대규모 점군 및 폴리곤 모델의 GLSL 기반 실시간 렌더링 알고리즘)

  • Park, Sangkun
    • Korean Journal of Computational Design and Engineering
    • /
    • v.19 no.3
    • /
    • pp.294-304
    • /
    • 2014
  • This paper presents a real-time rendering algorithm of large-scale geometric data using GLSL (OpenGL shading language). It details the VAO (vertex array object) and VBO(vertex buffer object) to be used for up-loading the large-scale point clouds and polygon meshes to a graphic video memory, and describes the shader program composed by a vertex shader and a fragment shader, which manipulates those large-scale data to be rendered by GPU. In addition, we explain the global rendering procedure that creates and runs the shader program with the VAO and VBO. Finally, a rendering performance will be measured with application examples, from which it will be demonstrated that the proposed algorithm enables a real-time rendering of large amount of geometric data, almost impossible to carry out by previous techniques.

Ray Tracing Acceleration Schemes Based on Efficient Data Storage (효율적인 데이터 저장을 기초로 한 광선 추적의 가속화 방안)

  • 최현규;경종민
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.8
    • /
    • pp.1270-1281
    • /
    • 1989
  • This paper presents two new storage schemes of 3-D objects to accelerate the finding of the first intersecting object and the shadow computation steps in ray tracing. The 3-D objects which are potentially intersected with the first reflection (refraction)ray are enrolled within a so called reflection (refraction) frustum' for a polygon object. Only those objects registered in the corres ponding frustum are immediately checked for intersection with the secondary rays emanating from the same polygon. The other is called a shadow pyramid' which contains the candidate objects possibly blocking the path from the relevant light source to any point on the relevant polgon. The shadow testing of a point is performed only against the objects contained in the associated shadow pyramid. Despite the cost needed for registration of objects within frusta or shadow pyramids, the total rendering time of ray tracing using the proposed approaches was reduced by approximately 50% (10% in color rendering time and 70% in shadoe testing time) from the conventional cell 50% (10% in color rendering time and 70% in shadow testing time) from the conventional cell traversal scheme under the 3-D uniform subdivision environment due to the fast finding of candidate objects for intersection and the reduced number of intersection calculations.

  • PDF

Displacement Mapping for the Precise Representation of Protrusion (정확한 돌출 형상의 표현을 위한 변위매핑)

  • Yoo, Byoung-Hyun;Han, Soon-Hung
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.10
    • /
    • pp.777-788
    • /
    • 2006
  • This paper describes a displacement mapping technique which represents protruded shapes on the surface of an object. Previous approaches for image-based displacement mapping can represent only shapes depressed from the polygon surface. The proposed technique can represent shapes protruded from the underlying surface in real-time. Two auxiliary surfaces which are perpendicular to the underlying surface are added along the boundary of the polygon surface, in order to represent the pixels which overflow over the boundary of the polygon surface. The proposed approach can represent accurate silhouette of protruded shape. It can represent not only smooth displacement of protruded shape, but also abrupt displacement such as perpendicular protrusion by means of adding the supplementary texture information to the steep surface of protruded shape. By per-pixel instructions on the programmable GPU this approach can be executed in real-time. It provides an effective solution for the representation of protruded shape such as high-rise buildings on the ground.

Subsurface Scattering for Realistic Point-based Rendering (사실적인 포인트 기반 렌더링을 위한 서브서피스 스캐터링 방법)

  • Kim, Hyeon-Joong;Choi, Soo-Mi
    • Journal of the Korea Computer Graphics Society
    • /
    • v.18 no.1
    • /
    • pp.11-21
    • /
    • 2012
  • Point-based rendering has gained much attention as an alternative to polygon-based rendering because of its simplicity and flexibility. However, current point-based rendering techniques do not provide a sufficient rendering quality for translucent materials such as human skin. In this paper, we propose a point-based rendering framework with subsurface scattering of light, which is important to create the soft and semi-translucent appearance of human skin. To accurately simulate subsurface scattering in multi-layer materials, we present splat-based diffusion to apply a linear combination of several Gaussian basis functions to each splat in object space. Compared to existing point-based approaches, our method offers a significantly improved visual quality in rendering human faces.

Polygon based 3D graphic engine for interactive TV (Interactive TV를 위한 Polygon 기반의 3D Graphic Engine)

  • Kim, Jung-Hwan;Jung, Moon-Ryul
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2005.11a
    • /
    • pp.243-247
    • /
    • 2005
  • 디지털 방송은 비디오, 오디오와 더불어 데이터를 전송할 수 있다. 데이터 영역에는 셋톱박스(STB)에서 수행되는 애플리케이션(Xlet)이 포함된다. 디지털 방송은 애플리케이션을 이용해 보다 진보된 인터랙티브 프로그램을 제공할 수 있다. 그러나 이러한 인터렉티브 TV에서 3차원 객체의 활용은 아직 여러 제한사항으로 인해 어려움이 있다. 현재 제정된 DVB-MHP, SCTE-OCAP, ATSC-ACAP 등의 데이터 방송 표준은 3D 객체를 표현하기 위한 구체적인 방법을 기술하지 않고 있다. 또한, 상용셋톱박스에 탑재된 자바 가상 머신(Java Virtual Machine)은 3D 객체를 렌더링(Rendering)하기 위한 API를 제공하지 않고 있다. 그리고 이를 위한 별도의 플러그인(Plug-in)도 제공하지 않는다. 본 논문에서는 Interactive TV에서 3차원 객체를 표현하기 위해 필요한 기본개념과 기술 및 데이터 방송 표준을 분석하고, 이들을 통합하여 polygon 기반의 3D Graphic Engine을 제안한다. 특히, 본 논문에서 제안하는 3D Graphic Engine API는 각각의 표준에서 가용한 공통 API를 기반으로 설계 되었으며, Java Virtual Machine 1.1 환경에서 구동될 수 있도록 구현되었다.

  • PDF

Interactive Pixel-unit AR Lip Makeup System Using RGB Camera

  • Nam, Hyeongil;Lee, Jeongeun;Park, Jong-Il
    • Journal of Broadcast Engineering
    • /
    • v.25 no.7
    • /
    • pp.1042-1051
    • /
    • 2020
  • In this paper, we propose an AR (Augmented Reality) lip makeup using bare hands interactively using an RGB camera. Unlike previous interactive makeup studies, this interactive lip makeup system is based on an RGB camera. Also, the system controls the makeup area in pixels, not in polygon-units. For pixel-unit controlling, the system also proposed a 'Rendering Map' that can store the relative position of the touched hand relative to the lip landmarks. With the map, the part to be changed in color can be specified in the current frame. And the lip color of the corresponding area is adjusted, even if the movement of the face changes in the next frame. Through user experiments, we compare quantitatively and qualitatively our makeup method with the conventional polygon-unit method. Experimental results demonstrate that the proposed method enhances the quality of makeup with a little sacrifice of computational complexity. It is confirmed that natural makeup similar to the actual lip makeup is possible by dividing the lip area into more detailed areas. Furthermore, the method can be applied to make the face makeup of other areas more realistic.

Rendering Trees Using Billboarding Method with View Dependent Texture Re-creation in Real-Time (시점 종속적 빌보드 텍스쳐 재생성을 이용한 나무의 실시간 렌더링)

  • Min, Sung-Hwan;Kim, Chang-Hun
    • Journal of the Korea Computer Graphics Society
    • /
    • v.8 no.4
    • /
    • pp.9-16
    • /
    • 2002
  • In this paper we propose an extended billboarding method for rendering trees. It's difficult circumstance that PC renders forest by general polygon rendering in real-time, because tree object consists of tremendous leaves and limbs. Our method re-creates an appropriate texture image by 3D image warping equation each frame, and we use it for a billboarding method. For speed up, we use warping method with a image pyramid and image caching.

  • PDF

Device Performance Analysis Method for Hybrid Rendering (하이브리드 렌더링을 위한 단말기 성능분석 방법)

  • Kim, Hak-Ran;Park, Hwa-Jin
    • 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.

  • PDF

Development of PC-Based 6DOF Force Display System (PC기반의 6자유도 촉각장치의 개발)

  • Shin, Suck-Doo;Kang, Won-Chan;Kim, Dong-Ok;Kim, Won-Bae;Kim, Young-Dong
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.50 no.5
    • /
    • pp.211-217
    • /
    • 2001
  • In this paper, we have developed the 6 DOF force display system to be based on the single PC. The system is composed of the force display device, the force reflecting rendering algorithm and the high-speed controller. The previous systems had a problem, that must adopt high performance workstation or 2-PC in order to control the graphics speedily and stably. In this paper, it is possible to improve the problem as to develop its exclusive controller and new rendering algorithm. The proposed new rendering algorithm is based on the Proxy algorithm, which can convert information of the position, the velocity, and the haptic information into the force-data. Especially, as to use the proxy algorithm, we can construct dynamical virtual-environment with the elasticity, the viscosity, the mass, and the friction force. As the result of the experiment, we found that our system has much superior characteristics than some other haptic interfaces, because it can control of 30,000 polygon model constructed virtual object with 1[kHz] haptic interrupt cycle and 20[Hz] graphic interrupt cycle in the single PC based system.

  • PDF