Bezier curve is one of the most fundamental primitives for the modeling of fonts and two-dimensional (2D) computer graphics objects. How to efficiently render the Bezier curve becomes an important task for many embedded applications. This thesis first proposed a novel adaptive curve-rendering algorithm which can determine the coordinates of all the crossing points of the curve and scan-lines with the required accuracy for the graphics fill operation. Next, for the rendering of stroked Bezier curves, this thesis proposed several possible rendering circuit architectures. The performance and gate count of these architectures have been estimated, and compared in this thesis. It has been found that the design based on the table-lookup normal vector calculator can lead to the fastest circuit, while the design based on the Cordic operator represents the most economic design. A basic Bezier curve rendering circuit has been implemented in this thesis, and used to accelerate a prototype OpenVG embedded systems.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0906110-144327 |
| Date | 06 September 2010 |
| Creators | Wang, Min-Hung |
| Contributors | Shiann-Rong Kuang, Yun-Nan Chang, Shen-Fu Hsiao |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | Cholon |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0906110-144327 |
| Rights | not_available, Copyright information available at source archive |
Page generated in 0.0016 seconds