• Title/Summary/Keyword: Fur Rendering

Search Result 6, Processing Time 0.035 seconds

An Adaptive System for Effective Fur rendering (효과적인 Fur 렌더링을 위한 적응적 시스템 -혼합 렌더링을 이용한 빠른 Fur 렌더링 방법-)

  • Kim, Hye-Sun;Ban, Yun-Ji;Lee, Chung-Hwan;Nam, Seung-Woo;Choi, Jin-Sung;Oh, Jun-Kyu
    • 한국HCI학회:학술대회논문집
    • /
    • 2009.02a
    • /
    • pp.719-724
    • /
    • 2009
  • Fur rendering is difficult in that there are huge numbers of objects and it takes so much time. The previous method considers fur as cylinder, transforms it into 2D ribbon, triangulates and commits rendering. But this method has problem like under sampling and takes rendering time so long. To resolve these shortcuts we proposed new algorithm. We divide fur into thick and thin fur and we applied adaptive rendering methods for each type of fur. Also we can perform an effective rendering according to the proposed rendering framework.

  • PDF

Realtime Fur Simulation Rendering (실시간 Fur 시뮬레이션 렌더링)

  • Kim, Dong-Kyoum;Kim, Jee-In;Kim, Hyung-Seok
    • 한국HCI학회:학술대회논문집
    • /
    • 2009.02a
    • /
    • pp.475-481
    • /
    • 2009
  • 실시간 렌더링에서 Fur는 모피등과 같이 매우 복잡한 표면을 표현하는 문제로 가상세계의 사실감을 높이는데 매우 중요한 요소이다. 복잡한 Fur의 실시간 렌더링을 위하여 다수의 방법이 제안되어 왔으나, Fur를 사실처럼 보여지게 하는 측면에서, 기존의 정적인 표현으로서는 한계점이 존재한다. 본 논문에서는 중력 및 외력에 의한 시뮬레이션을 통한 Fur의 실시간 Animation 방법을 제안한다. 기본 구조는 모피의 볼륨을 구성하는 n개의 Shell과 Shell의 표현을 보강하는 Fin의 구조로 이루어져 있고, Shell과 Fin의 공유 Vertex 배열을 통해 이 두 가지 구조를 하나로 통합한다. 이 공유 Vertex 배열에 본 논문에서 제안하는 중력 및 외력에 의한 시뮬레이션을 적용하여 공유 Vertex 배열을 변형시킨다. 이 후 변형된 공유 Vertex배열을 기반으로 Rendering을 수행하게 된다. 본 논문에서 제안하는 방법을 사용하여, 정적인 Fur Rendering이 아닌 동적으로 움직이는 Fur Rendering을 사용 함 으로써 좀 더 높은 현실감을 느낄 수 있을 것으로 기대한다.

  • PDF

INTERACTIVE VISUALIZATION TECHNIQUES FOR A VIRTUAL REALITY BASED ANALSYIS OF SIMULATION RESULTS

  • Benolken, Paul;Graf, Holger;Rix, Joachim
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2001.10a
    • /
    • pp.237-247
    • /
    • 2001
  • In this paper we present an overview of existing state of the art visualization techniques fur the interactive analysis of results from numerical simulations and measurements. We describe the basic concepts and key ideas behind these different visualization methods in this paper. The potential of these techniques for an efficient integration into a virtual reality environment will be investigated. Furthermore we present our first demonstrator fur visualizing multiparametric data and give an outlook on our plans for further exploiting and developing these techniques in an upcoming project.

  • PDF

Peach & Pit Volume Measurement and 3D Visualization using Magnetic Resonance Imaging Data (자기공명영상을 이용한 복숭아 및 씨의 부피 측정과 3차원 가시화)

  • 김철수
    • Journal of Biosystems Engineering
    • /
    • v.27 no.3
    • /
    • pp.227-234
    • /
    • 2002
  • This study was conducted to nondestructively estimate the volumetric information of peach and pit and to visualize the 3D information of internal structure from magnetic resonance imaging(MRI) data. Bruker Biospec 7T spectrometer operating at a proton reosonant frequency of 300 MHz was used for acquisition of MRI data of peach. Image processing algorithms and visualization techniques were implemented by using MATLAB (Mathworks) and Visualization Toolkit(Kitware), respectively. Thresholding algorithm and Kohonen's self organizing map(SOM) were applied to MRI data fur region segmentation. Volumetric information were estimated from segemented images and compared to the actual measurements. The average prediction errors of peach and pit volumes were 4.5%, 26.1%, respectively for the thresholding algorithm. and were 2.1%, 19.9%. respectively for the SOM. Although we couldn't get the statistically meaningful results with the limited number of samples, the average prediction errors were lower when the region segmentation was done by SOM rather than thresholding. The 3D visualization techniques such as isosurface construction and volume rendering were successfully implemented, by which we could nondestructively obtain the useful information of internal structures of peach.

A Study of Efficient Access Method based upon the Spatial Locality of Multi-Dimensional Data

  • Yoon, Seong-young;Joo, In-hak;Choy, Yoon-chul
    • Proceedings of the Korea Database Society Conference
    • /
    • 1997.10a
    • /
    • pp.472-482
    • /
    • 1997
  • Multi-dimensional data play a crucial role in various fields, as like computer graphics, geographical information system, and multimedia applications. Indexing method fur multi-dimensional data Is a very Important factor in overall system performance. What is proposed in this paper is a new dynamic access method for spatial objects called HL-CIF(Hierarchically Layered Caltech Intermediate Form) tree which requires small amount of storage space and facilitates efficient query processing. HL-CIF tree is a combination of hierarchical management of spatial objects and CIF tree in which spatial objects and sub-regions are associated with representative points. HL-CIF tree adopts "centroid" of spatial objects as the representative point. By reflecting objects′sizes and positions in its structure, HL-CIF tree guarantees the high spatial locality of objects grouped in a sub-region rendering query processing more efficient.

  • PDF

A Cost-Effective Hardware Image Compositor for Sort-Last Parallel Visualization Clusters (후정렬 병렬 가시화 클러스터를 위한 저비용의 하드웨어 영상 합성기)

  • Taropa Emanuel;Lee Won-Jong;Srini Vason P.;Han Tack-Don
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07a
    • /
    • pp.712-714
    • /
    • 2005
  • Real-time 3D visualization of large datasets imposes a distributed architecture of the rendering system and dedicated hardware for image composition. Previous work on this domain has relied on prohibitively expensive cluster systems with hardware composition done by complicated schemes. In this paper we propose a low-cost hardware compositor fur a high performance visualization cluster. We show the system's design and the results obtained using Simulink [1] for our image composition scheme.

  • PDF