Adaptive tessellation of PN triangle with modified bresenham algorithm수정 Bresenham 알고리즘을 이용한 PN triangle의 적응 모자이크 가공 기법에 관한 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 438
  • Download : 0
Reducing the required memory bandwidth is a main issue in 3D computer graphics. PN triangle solves the memory bandwidth problem by using curved surface representation and tessellation. It reconstructs a smooth and detailed 3D model from blocky one on graphics hardware and then reduces bandwidth consumption required for data transmission. But the existing PN triangle hardware tessellates a curved surface according to the user-defined and fixed Level Of Detail (LOD) and redundant geometric operations can be executed. In this paper, we insert adaptive LOD concept in PN triangle and propose several schemes for implementation and reducing visual artifacts. Simulation results show the reduced operation count and improved visual quality. Additionally we propose hardware architecture of PN triangle generation unit using adaptive LOD. The required hardware cost for PN triangle generation unit is not overhead to overall 3D graphics hardware.
Advisors
Kim, Lee-Supresearcher김이섭
Description
한국과학기술원 : 전기및전자공학전공,
Publisher
한국과학기술원
Issue Date
2003
Identifier
180513/325007 / 020013542
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 전기및전자공학전공, 2003.2, [ v, 53 p. ]

Keywords

PN triangle; Adaptive; Bresenham; 모자이크 가공; Tessellation; 테셀레이션

URI
http://hdl.handle.net/10203/196836
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=180513&flag=dissertation
Appears in Collection
EE-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0