• 제목/요약/키워드: real-time polygon generation

검색결과 3건 처리시간 0.021초

원격 작업을 위한 3 차원 점군 데이터기반의 실시간 폴리곤 생성 및 텍스처 맵핑 기법 (Real-time Polygon Generation and Texture Mapping for Tele-operation using 3D Point Cloud Data)

  • 장가람;신용득;윤재식;박재한;배지훈;이영수;백문홍
    • 제어로봇시스템학회논문지
    • /
    • 제19권10호
    • /
    • pp.928-935
    • /
    • 2013
  • In this paper, real-time polygon generation algorithm of 3D point cloud data and texture mapping for tele-operation is proposed. In a tele-operation, it is essential to provide more highly realistic visual information to a tele-operator. By using 3D point cloud data, the tele-operator can observe the working environment from various view point with a reconstructed 3D environment. However, there are huge empty space in 3D point cloud data, since there is no environmental information among the points. This empty space is not suitable for an environmental information. Therefore, real-time polygon generation algorithm of 3D point cloud data and texture mapping is presented to provide more highly realistic visual information to the tele-operator. The 3D environment reconstructed from the 3D point cloud data with texture mapped polygons is the crucial part of the tele-operation.

공구 경로 생성을 위한 아일랜드를 포함하는 영역의 오프셋 (Offsetting a Region Including Islands for Tool-Path Generation)

  • 박상철
    • 대한기계학회논문집A
    • /
    • 제25권12호
    • /
    • pp.2009-2018
    • /
    • 2001
  • This paper presents a region offsetting algorithm for tool-path generation. The proposed region offsetting algorithm is developed by expanding the 'PWID offset algorithm [Choi and Park, 1999]'designed to offset a simple polygon. The PWID offset algorithm has three important steps; 1) remove 'local invalid ranges'by invoking a PWID test, 2) construct a raw offset owe and 3) remove 'global invalid ranges'by finding self-intersections of the raw offset cure. To develop a region offsetting algorithm, we modified the PWID offset algorithm by expanding the concept of the 'global invalid range'in the third step. The time complexity of the proposed algorithm is approximately Ο(n), where n is the number of points, and it is free of numerical errors for practical purposes. The proposed algorithm has been implemented and tested with various real regions obtained by intersecting a sculptured surface with a plane.

Image rasterization을 위한 Edge Painting Machine의 설계 및 simulation (Design and Simulation of Edge Painting Machine for Image Rasterization)

  • 최상길;김성수;어길수;경종민
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
    • /
    • pp.1492-1494
    • /
    • 1987
  • This paper describes a hardware architecture called Edge Painting Machine for real time generation of scan line images for raster scan graphics display. The Edge Painting Machine consists of Scanline Processor which converts polygon data sorted in their depth priority into a set of scan line commands for each scan line, and Edge Painting Tree which converts the scanline commands set into a raster line image. Edge painting tree has been designed using combinational logic circuit. The designed circuit has been simulated to verify the proper functioning. A salient feature of the EPT is that hardware composition is simple, because each processor is constituted by only combinational logic circuit.

  • PDF