• 한국HCI학회:학술대회논문집
• /
• 2007.02a
• /
• pp.70-75
• /
• 2007

본 논문은 연결정보(connectivity) 및 미리 계산된 계층적 데이터 구조(hierarchical data structure)를 이용하지 않는 그래픽 및 햅틱 렌더링 알고리즘을 제안한다. 제안된 알고리즘은 점 기반 그래픽 표현(point-based graphic representation) 기법을 이용하여 3차원 자유 곡면을 생성한다. 생성된 점 기반 곡면 물체와의 햅틱 상호작용을 위해 그래픽 하드웨어(GPU)에 접근하여 점 기반 곡면에서 생성된 깊이 이미지(depth image)를 이용하여 햅틱 상호작용에 필수 요소인 충돌검출(collision detection) 및 반력 연산(contact force computation)을 수행한다.

• Journal of the Korea Computer Graphics Society
• /
• v.26 no.1
• /
• pp.7-15
• /
• 2020

In the process of visualizing a point set representing a smooth manifold surface, global illumination techniques can be used to render a realistic scene with various effects of lighting. Thanks to the continuous demand for ray tracing and the development of graphics hardware, dedicated GPUs and programmable pipeline for ray tracing have been introduced in recent years. In this paper, real-time global illumination rendering is studied for a point-set model using ray-tracing GPUs. We apply the moving least-squares (MLS) method to approximate the point set to a smooth implicit surface and render it using global illumination by performing massive ray-intersection tests with the surface and generating shading effects at the intersection point. As a result, a complicated point-set scene consisting of more than 0.5M points can be generated in real-time.

• Journal of the Korea Computer Graphics Society
• /
• v.29 no.3
• /
• pp.93-103
• /
• 2023

The problem of reconstructing three-dimensional models of people and objects from color and depth images captured by low-cost RGB-D cameras has long been an active research area in computer graphics. Color and depth images captured by low-cost RGB-D cameras are represented as point clouds in three-dimensional space, which correspond to discrete values in a continuous three-dimensional space and require additional surface reconstruction compared to rendering using polygonal models. In this paper, we propose an effective ray-tracing based technique for visualizing point clouds rather than polygonal models. In particular, our method shows the possibility of an effective rendering method even in mobile environment which has limited performance due to processor heat and lack of battery.

• International Journal of CAD/CAM
• /
• v.9 no.1
• /
• pp.111-120
• /
• 2010

In this paper, we propose a volume rendering method using grid computing for large-scale volume data. Grid computing is attractive because medical institutions and research facilities often have a large number of idle computers. A large-scale volume data is divided into sub-volumes and the sub-volumes are rendered using grid computing. When using grid computing, different computers rarely have the same processor speeds. Thus the return order of results rarely matches the sending order. However order is vital when combining results to create a final image. Job-Scheduling is important in grid computing for volume rendering, so we use an obstacle-flag which changes priorities dynamically to manage sub-volume results. Obstacle-Flags manage visibility of each sub-volume when line of sight from the view point is obscured by other subvolumes. The proposed Dynamic Job-Scheduling based on visibility substantially increases efficiency. Our Dynamic Job-Scheduling method was implemented on our university's campus grid and we conducted comparative experiments, which showed that the proposed method provides significant improvements in efficiency for large-scale volume rendering.

• Journal of Broadcast Engineering
• /
• v.26 no.6
• /
• pp.714-724
• /
• 2021

The point cloud content is immersive content recorded by acquiring points and colors corresponding to the real environment and objects having three-dimensional location information. When a point cloud content consisting of three-dimensional points having position and color information is enlarged and rendered, the gap between the points widens and an empty hole occurs. In this paper, we propose a method for improving the quality of point cloud contents through inverse transformation-based interpolation using depth information for holes by finding holes that occur due to the gap between points when expanding the point cloud. The points on the back are rendered between the holes created by the gap between the points, acting as a hindrance to applying the interpolation method. To solve this, remove the points corresponding to the back side of the point cloud. Next, a depth map at the point in time when an empty hole is generated is extracted. Finally, inverse transform is performed to extract pixels from the original data. As a result of rendering content by the proposed method, the rendering quality improved by 1.2 dB in terms of average PSNR compared to the conventional method of increasing the size to fill the blank area.

• 한국HCI학회:학술대회논문집
• /
• 2006.02a
• /
• pp.1262-1270
• /
• 2006

사실적인 물 애니메이션을 위한 격자 기반 시뮬레이션 기법은 자연스러운 물의 움직임뿐만 아니라 부드러운 물의 표면을 잘 표현해주는 장점이 있다. 이러한 격자 기반 방법과 함께 상대적으로 적은 계산으로 안정적인 결과를 산출해주는 입자 기반의 액체 시뮬레이션 기법이 최근 애니메이션 분야에 적용되기 시작했고, 그로 인하여 입자로 이루어진 시뮬레이션 데이터에 특화된 효과적인 렌더링 기술의 개발이 요구되고 있다. 본 논문에서는 주로 3차원 스캔 데이터와 같이 물체 표면을 샘플링 하여 얻어진 점 집합에 대한 렌더링 기법을 확장하여, 위상 변화가 크고 점 집합에 의해 내부까지 표현되는 물 데이터의 특성에 적합한 렌더링 기법을 제안한다. 본 기법에서는 시뮬레이션을 통하여 얻은 입자 데이터로부터 물의 표면을 표현해주는 새로운 점 집합을 생성하고, 시뮬레이션 된 데이터의 특성을 잘 반영하도록 각 점에 대한 법선 벡터와 반지름을 결정한다. 특히 가공된 점 집합 데이터에 대하여 확장된 점 집합 렌더링 기법을 적용함으로써 입자 데이터가 표현해주는 세밀한 부분들을 보존하면서, 부드러운 물의 표면을 가시화할 수 있도록 하였다.

• 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.

• ETRI Journal
• /
• v.34 no.5
• /
• pp.791-794
• /
• 2012

We propose an efficient framework to realistically render 3D faces with a reduced set of points. First, a robust active appearance model is presented to detect facial features in the projected faces under different illumination conditions. Then, an adaptive simplification of 3D faces is proposed to reduce the number of points, yet preserve the detected facial features. Finally, the point model is rendered directly, without such additional processing as parameterization of skin texture. This fully automatic framework is very effective in rendering massive facial data on mobile devices.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.4
• /
• pp.335-342
• /
• 2012

3D point cloud is widely used in Architecture, Civil Engineering, Medical, Computer Graphics, and many other fields. Due to the improvement of 3D laser scanner, a massive 3D point cloud whose gigantic file size is bigger than computer's memory requires efficient preprocessing and visualization. We suggest a data structure to solve the problem; a 3D point cloud is gradually subdivided by arbitrary-sized cube grids structure and corresponding point cloud subsets generated by the center of each grid cell are achieved while preprocessing. A massive 3D point cloud file is tested through two algorithms: QSplat and ours. Our algorithm, grid-based, showed slower speed in preprocessing but performed faster rendering speed comparing to QSplat. Also our algorithm is further designed to editing or segmentation using the original coordinates of 3D point cloud.

• Journal of Broadcast Engineering
• /
• v.26 no.3
• /
• pp.258-268
• /
• 2021

Point cloud content is immersive content that represents real-world objects with three-dimensional (3D) points. In the process of acquiring point cloud data or encoding and decoding point cloud data, the resolution of point cloud content could be degraded. In this paper, we propose a method of progressively enhancing the resolution of sequential point cloud contents through inter-frame registration. To register a point cloud, the iterative closest point (ICP) algorithm is commonly used. Existing ICP algorithms can transform rigid bodies, but there is a disadvantage that transformation is not possible for non-rigid bodies having motion vectors in different directions locally, such as point cloud content. We overcome the limitations of the existing ICP-based method by registering regions with motion vectors in different directions locally between the point cloud content of the current frame and the previous frame. In this manner, the resolution of the point cloud content with geometric movement is enhanced through the process of registering points between frames. We provide four different point cloud content that has been enhanced with our method in the experiment.