A study of applying String Pattern Recognition technique to Surface Rendering

碩士 === 明道大學 === 資訊傳播學系碩士班 === 101 === Polygon graphic rendering technology has been widely used in 3D stereoscopic display, dynamic simulation, material structure and realistic graphics, and so on. It has already occupied an important place in computer graphics. It is worthy of study. Polygon graphi...

Full description

Bibliographic Details
Main Authors: Pi-Chun Hung, 洪碧君
Other Authors: Jwo-Liang Chu
Format: Others
Language:zh-TW
Published: 2013
Online Access:http://ndltd.ncl.edu.tw/handle/62572830837317174752
id ndltd-TW-101MDU07676002
record_format oai_dc
spelling ndltd-TW-101MDU076760022015-10-13T21:56:02Z http://ndltd.ncl.edu.tw/handle/62572830837317174752 A study of applying String Pattern Recognition technique to Surface Rendering 應用字串圖形辨識法於表面著色之研究 Pi-Chun Hung 洪碧君 碩士 明道大學 資訊傳播學系碩士班 101 Polygon graphic rendering technology has been widely used in 3D stereoscopic display, dynamic simulation, material structure and realistic graphics, and so on. It has already occupied an important place in computer graphics. It is worthy of study. Polygon graphic rendering is usually performed for all the scan lines on the screen, identifying each online pixel inside the polygon, then coloring. Due to the extremely large number of pixels on the screen, point-by-point identification is time consuming. The polygon graphic rendering mentioned in this article is also performed for all the scan lines on the screen. A scan line may be divided into several subsegments by clipping with the polygon’s edges. Using string pattern recognition method to identify subsegments inside the polygon, then coloring all pixels on the subsegments to complete the coloring work. The graph coloring of the polygon covers two fields: the graphic clipping and the surface rendering. By introducing the string pattern recognition algorithm, even concave polygons can easily be applied in the field of graphic clipping, not limited to convex polygons. In polygon surface coloring, a large number of operations (to gain intersection point coordinates of two straight lines) is needed. By means of the new midpoint partition algorithm and the position identification algorithm, the operations of intersection points will be simplified. In summary, the introducing of string pattern recognition algorithms, has help raise the identification level from "point" to "line" and make both convex and concave polygons are easily to be clipped in the field of graphic clipping. Improved midpoint partition algorithm has also simplified operations in calculating intersection point coordinates of two straight lines. The article has offered some contributions to polygon graphic rendering technology. Jwo-Liang Chu 朱倬梁 2013 學位論文 ; thesis 57 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 明道大學 === 資訊傳播學系碩士班 === 101 === Polygon graphic rendering technology has been widely used in 3D stereoscopic display, dynamic simulation, material structure and realistic graphics, and so on. It has already occupied an important place in computer graphics. It is worthy of study. Polygon graphic rendering is usually performed for all the scan lines on the screen, identifying each online pixel inside the polygon, then coloring. Due to the extremely large number of pixels on the screen, point-by-point identification is time consuming. The polygon graphic rendering mentioned in this article is also performed for all the scan lines on the screen. A scan line may be divided into several subsegments by clipping with the polygon’s edges. Using string pattern recognition method to identify subsegments inside the polygon, then coloring all pixels on the subsegments to complete the coloring work. The graph coloring of the polygon covers two fields: the graphic clipping and the surface rendering. By introducing the string pattern recognition algorithm, even concave polygons can easily be applied in the field of graphic clipping, not limited to convex polygons. In polygon surface coloring, a large number of operations (to gain intersection point coordinates of two straight lines) is needed. By means of the new midpoint partition algorithm and the position identification algorithm, the operations of intersection points will be simplified. In summary, the introducing of string pattern recognition algorithms, has help raise the identification level from "point" to "line" and make both convex and concave polygons are easily to be clipped in the field of graphic clipping. Improved midpoint partition algorithm has also simplified operations in calculating intersection point coordinates of two straight lines. The article has offered some contributions to polygon graphic rendering technology.
author2 Jwo-Liang Chu
author_facet Jwo-Liang Chu
Pi-Chun Hung
洪碧君
author Pi-Chun Hung
洪碧君
spellingShingle Pi-Chun Hung
洪碧君
A study of applying String Pattern Recognition technique to Surface Rendering
author_sort Pi-Chun Hung
title A study of applying String Pattern Recognition technique to Surface Rendering
title_short A study of applying String Pattern Recognition technique to Surface Rendering
title_full A study of applying String Pattern Recognition technique to Surface Rendering
title_fullStr A study of applying String Pattern Recognition technique to Surface Rendering
title_full_unstemmed A study of applying String Pattern Recognition technique to Surface Rendering
title_sort study of applying string pattern recognition technique to surface rendering
publishDate 2013
url http://ndltd.ncl.edu.tw/handle/62572830837317174752
work_keys_str_mv AT pichunhung astudyofapplyingstringpatternrecognitiontechniquetosurfacerendering
AT hóngbìjūn astudyofapplyingstringpatternrecognitiontechniquetosurfacerendering
AT pichunhung yīngyòngzìchuàntúxíngbiànshífǎyúbiǎomiànzhesèzhīyánjiū
AT hóngbìjūn yīngyòngzìchuàntúxíngbiànshífǎyúbiǎomiànzhesèzhīyánjiū
AT pichunhung studyofapplyingstringpatternrecognitiontechniquetosurfacerendering
AT hóngbìjūn studyofapplyingstringpatternrecognitiontechniquetosurfacerendering
_version_ 1718071045032771584