• Title/Summary/Keyword: point rendering

Search Result 133, Processing Time 0.025 seconds

A 3D Memory System Allowing Multi-Access (다중접근을 허용하는 3차원 메모리 시스템)

  • 이형
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.9
    • /
    • pp.457-464
    • /
    • 2005
  • In this paper a 3D memory system that allows 17 access types at an arbitrary position is introduced. The proposed memory system is based on two main functions: memory module assignment function and address assignment function. Based on them, the memory system supports 17 access types: 13 Lines, 3 Rectangles, and 1 Hexahedron. That is, the memory system allows simultaneous access to multiple data in any access types at an arbitrary position with a constant interval. In order to allow 17 access types the memory system consists of memory module selection circuitry, data routing circuitry for READ/WRITE, and address calculation/routing circuitry In the point of view of a developer and a programmer, the memory system proposed in this paper supports easy hardware extension according to the applications and both of them to deal with it as a logical three-dimensional away In addition, multiple data in various across types can be simultaneously accessed with a constant interval. Therefore, the memory system is suitable for building systems related to ,3D applications (e.g. volume rendering and volume clipping) and a frame buffer for multi-resolution.

A Study on 3D File Format for Web-based Scientific Visualization

  • Lee, Geon-hee;Nam, Jeong-hwan;Han, Hwa-seop;Kwon, Soon-chul
    • International Journal of Advanced Culture Technology
    • /
    • v.7 no.1
    • /
    • pp.243-247
    • /
    • 2019
  • The most commonly used 3D modeling file formats are OBJ (Wavefront file format specification) and STL (STereoLithography). Although they have a common point of view in 3D on the screen, detailed functions are different according to purpose of development. OBJ is the most commonly used 3D file format and STL is mainly used as 3D file format for 3D printing. However, in the field of Scientific Visualization, precise analysis is required. There is a difference in accuracy depending on the type of 3D file format. OBJ and STL are not suitable for delicate surface description because they form meshes in the form of triangular polygons. And if you increase the number of triangle polygons, it will be smoother, but the file size also increases exponentially and causes excessive CPU usage. In contrast, VTK provides a variety of polygon structures, including triangular polygons as well as rectangular polygons and cube polygons. Thus, delicate surface depiction is possible. Delicate surface rendering is possible and file size is not large. This paper describes the concept and structure of VTK. We also compared the load times and file sizes between VTK, STL, and OBJ in the Chrome browser. In addition, the difference in surface rendering ability between VTK, STL, and OBJ is intuitively viewed based on the screen in which each 3D file format is implemented under the same conditions. This study is expected to be helpful for efficient 3D file format for precise implementation of Web - based Scientific Visualization.

High-quality Texture Extraction for Point Clouds Reconstructed from RGB-D Images (RGB-D 영상으로 복원한 점 집합을 위한 고화질 텍스쳐 추출)

  • Seo, Woong;Park, Sang Uk;Ihm, Insung
    • Journal of the Korea Computer Graphics Society
    • /
    • v.24 no.3
    • /
    • pp.61-71
    • /
    • 2018
  • When triangular meshes are generated from the point clouds in global space reconstructed through camera pose estimation against captured RGB-D streams, the quality of the resulting meshes improves as more triangles are hired. However, for 3D reconstructed models beyond some size threshold, they become to suffer from the ugly-looking artefacts due to the insufficient precision of RGB-D sensors as well as significant burdens in memory requirement and rendering cost. In this paper, for the generation of 3D models appropriate for real-time applications, we propose an effective technique that extracts high-quality textures for moderate-sized meshes from the captured colors associated with the reconstructed point sets. In particular, we show that via a simple method based on the mapping between the 3D global space resulting from the camera pose estimation and the 2D texture space, textures can be generated effectively for the 3D models reconstructed from captured RGB-D image streams.

Spectral-based rendering technique for lighting simulation (라이팅 시뮬레이션을 위한 분광특성기반의 랜더링 기법)

  • Lee, Myong-Young;Cho, Yang-Ho;Lee, Cheol-Hee;Ha, Yeong-Ho
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.379-382
    • /
    • 2005
  • This study proposes an effective algorithm that can render a realistic image of a lighting environment, especially an automotive rear lamp, using the backward ray tracing method. To producea realistic image similar to that perceived by the human eye, the incident light energy at the eye point estimated by a ray tracing algorithm is represented by XYZ tri-stimulus values, which are then converted into RGB values considering the particular display device.

  • PDF

Approximating 3D General Sweep Boundary using Graphics Hardware (그래픽스 하드웨어를 이용한 입체 스윕 경계 근사)

  • An, Jae-U;Kim, Myeong-Su;Hong, Seong-Je
    • Journal of the Korea Computer Graphics Society
    • /
    • v.8 no.3
    • /
    • pp.1-7
    • /
    • 2002
  • This paper presents a practical technique for approximating the boundary surface of the volume swept out by three-dimensional objects using the depth-buffer. Objects may change their geometries and orientations while sweeping. The sweep volume is approximated as a union of volume elements, which are just rendered inside appropriate viewing frusta of virtual cameras and mapped into screen viewports with depth-buffer. From the depth of each pixel in the screen space of each rendering, the corresponding point in the original world space can be computed. Appropriately connecting these points yields polygonal faces forming polygonal surface patches approximately covering some portion of the sweep volume. Each view frustum adds one or more surface patches in this way, and these presumably overlapped polygonal surface patches approximately enclose the whole sweep volume. These patches may further be processed to yield non-overlapped polygonal surfaces as an approximation to the boundary of the original 3D sweep volume.

  • PDF

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

Automatic Mask Generation for 3D Makeup Simulation (3차원 메이크업 시뮬레이션을 위한 자동화된 마스크 생성)

  • Kim, Hyeon-Joong;Kim, Jeong-Sik;Choi, Soo-Mi
    • 한국HCI학회:학술대회논문집
    • /
    • 2008.02a
    • /
    • pp.397-402
    • /
    • 2008
  • 본 논문에서는 햅틱 인터랙션 기반의 3차원 가상 얼굴 메이크업 시뮬레이션에서 메이크업 대상에 대한 정교한 페인팅을 적용하기 위한 자동화된 마스크 생성 방법을 개발한다. 본 연구에서는 메이크업 시뮬레이션 이전의 전처리 과정에서 마스크를 생성한다. 우선, 3차원 스캐너 장치로부터 사용자의 얼굴 텍스쳐 이미지와 3차원 기하 표면 모델을 획득한다. 획득된 얼굴 텍스쳐 이미지로부터 AdaBoost 알고리즘, Canny 경계선 검출 방법과 색 모델 변환 방법 등의 영상처리 알고리즘들을 적용하여 마스크 대상이 되는 주요 특정 영역(눈, 입술)들을 결정하고 얼굴 이미지로부터 2차원 마스크 영역을 결정한다. 이렇게 생성된 마스크 영역 이미지는 3차원 표면 기하 모델에 투영되어 최종적인 3차원 특징 영역의 마스크를 레이블링하는데 사용된다. 이러한 전처리 과정을 통하여 결정된 마스크는 햅틱 장치와 스테레오 디스플레이기반의 가상 인터페이스를 통해서 자연스러운 메이크업 시뮬레이션을 수행하는데 사용된다. 본 연구에서 개발한 방법은 사용자에게 전처리 과정에서의 어떠한 개입 없이 자동적으로 메이크업 대상이 되는 마스크 영역을 결정하여 정교하고 손쉬운 메이크업 페인팅 인터페이스를 제공한다.

  • PDF

A Tessellation of a Polynomial Curve by a Sequential Method (다항식곡선으로부터 순차적 방법에 의한 점열의 생성)

  • Ju S.Y.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.11 no.3
    • /
    • pp.205-210
    • /
    • 2006
  • Curve tessellation, which generates a sequence of points from a curve, is very important for curves rendering on a computer screen and for NC machining. For the most case the sequence of discrete points is used rather than a continuous curve. This paper deals with a method of tessellation by calculating the maximal deviation of a curve. The maximal deviation condition is introduced to find the point with the maximal chordal deviation on a curve segment. In the previous research a curve tessellation was tried by the subdivision method, that is, a curve is subdivided until the maximal chordal deviation is less than the given tolerance. On the other hand, a curve tessellation by sequential method is tried in this paper, that is, points are generated successively by using the local property of a curve. The sequential method generates relatively much less points than the subdivision method. Besides, the sequential method can generate a sequence of points from a spatial curve by approximation to a planar curve. The proposed method can be applied for high-accuracy curve tessellation and NC tool-path generation.

An Efficient Real-Time Rendering of Large Molecular Models based on GPU (GPU 기반의 효율적인 거대 분자의 실시간 렌더링 기법)

  • Lee, Jun;Park, Sung-Jun;Kim, Jee-In
    • Journal of the Korea Computer Graphics Society
    • /
    • v.11 no.3
    • /
    • pp.19-22
    • /
    • 2005
  • 정보생물학 분야에 있어서 분자 구조를 3차원으로 렌더링하여 보여주는 것은 매우 중요한 작업이다. 특히 분자의 표면 렌더링은 분자의 3차원 구조 분석 등에 중요하게 사용된다. 그러나 분자 표면 렌더링을 수행하기 위해서는 많은 양의 폴리곤이 필요하게 된다. 특히 대장균 바이러스와 같은 분자량이 많은 거대 분자를 자연스럽게 렌더링 하기 위해서는 고가의 그래픽 전용 워크스테이션을 사용해야 한다. 본 논문에서는 저렴한 일반 PC 급 시스템에서도 거대 분자를 무리 없이 렌더링 할 수 있는 효율적인 알고리즘을 제안하였다. 제안하는 알고리즘은 높은 속도와 좋은 화질을 유지할 수 있는 Hybrid Point & Polygon 렌더링 기법이다. 이 알고리즘은 계층적인 자료구조인 옥트리(Octree)를 사용하였으며 최적의 성능을 내기 위하여 GPU가 작업을 처리한다. 제안된 알고리즘의 성능 평가는 일반 PC급에서 수행되었으며 특히 그래픽 카드 2개를 병렬로 연결하여 높은 성능을 낼 수 있는 SLI(Scalable Link Interface) 환경에서 평가를 수행하였다.

  • PDF

An Implementation of High Speed Rendering to Process Touch Screen Multiple Inputs based on FPGA (FPGA 기반의 터치스크린 다중입력처리를 위한 고속 렌더링 구현)

  • Yoon, Junhan;Kim, Jin Heon
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.11
    • /
    • pp.1803-1810
    • /
    • 2017
  • A large amount of processing time is required if the process of detecting the touch position on the touch screen and displaying it on the display panel is performed only by software. In this paper, we propose a method to output information touched on the screen using H/W method in order to improve the response speed delay. In the FPGA module designed for the HDMI signal output to the display module, the touch information is input to the serial data signal including touch coordinate information, point size, and color information. Then the module render the image using HDMI signal input to the module and the touch information. This method has a pipeline structure so it has effect of reducing the delay time that occurs in outputting the touch information compared with the conventional software processing method.