Normal view MARC view ISBD view

Enhancement of scan-line polygon filling algorithm / Agutaya A. Jennifer P. and Barnachea A. Lilibeth. 6

By: Agutaya A. Jennifer P. and Barnachea A. Lilibeth. 4 0 16, [, ] | [, ] |

Contributor(s): 5 6 [] |

Language: Unknown language code Summary language: Unknown language code Original language: Unknown language code Series: ; April 2002.46Edition: Description: 28 cm. 20 ppContent type: text Media type: unmediated Carrier type: volumeISBN: ISSN: 2Other title: 6 []Uniform titles: | | Related works: 1 40 6 []Subject(s): -- 2 -- 0 -- -- | -- 2 -- 0 -- 6 -- | 2 0 -- | -- -- 20 -- | | -- -- -- -- 20 -- | -- -- -- 20 -- --Genre/Form: -- 2 -- Additional physical formats: DDC classification: | LOC classification: | | 2Other classification:

Contents:

Action note: In: Summary: ABSTRACT: Different programming techniques can be used to fill different types of polygons. The scan line polygon-filling algorithm is an ingenious way of filling-in irregular polygons. This research is about the enhancement of the current algorithm that presents solutions to the setback of the existing algorithm. Scan line polygon-filling algorithm shows drawbacks that mainly results in poor filling when two polygons sharing the same edge, such example would be two rectangles with an edge shared in the middle. The algorithm limits itself to polygons, which means that shapes with curves such as circles and ellipses cannot be filled, and lastly, the existing algorithm is concentrated to two-dimensional polygons. After gathering related topics to this research, it is well studied so that this will be applied to the enhanced algorithm to be able to resolve the said problems of the algorithm . The Enhancement of Scan Line Polygon Filling Algorithm presents solution for proper filling-in of polygons that share the same edge. It also includes filling-in of circles and ellipses. Since the existing algorithm is applied only for two-dimensional figures, this study will be having an application of the algorithm to three0dimensional figures. Other editions:

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes
Comments ( 0 )

Item type	Current location	Home library	Collection	Call number	Status	Date due	Barcode	Item holds
Book	PLM	PLM Archives	Filipiniana-Thesis	QA75.5.Ag8.2002 (Browse shelf)	Available		FT3719

Total holds: 0

Undergraduate Thesis: (BSCS major in Computer Science) -Pamantasan ng Lungsod ng Maynila, 2002. 56

ABSTRACT: Different programming techniques can be used to fill different types of polygons. The scan line polygon-filling algorithm is an ingenious way of filling-in irregular polygons. This research is about the enhancement of the current algorithm that presents solutions to the setback of the existing algorithm. Scan line polygon-filling algorithm shows drawbacks that mainly results in poor filling when two polygons sharing the same edge, such example would be two rectangles with an edge shared in the middle. The algorithm limits itself to polygons, which means that shapes with curves such as circles and ellipses cannot be filled, and lastly, the existing algorithm is concentrated to two-dimensional polygons. After gathering related topics to this research, it is well studied so that this will be applied to the enhanced algorithm to be able to resolve the said problems of the algorithm . The Enhancement of Scan Line Polygon Filling Algorithm presents solution for proper filling-in of polygons that share the same edge. It also includes filling-in of circles and ellipses. Since the existing algorithm is applied only for two-dimensional figures, this study will be having an application of the algorithm to three0dimensional figures.

There are no comments for this item.

to post a comment.