Agutaya A. Jennifer P. and Barnachea A. Lilibeth.  4  0   <br/><br/>
Enhancement of scan-line polygon filling algorithm /        6 
       6     
Agutaya A. Jennifer P. and Barnachea A. Lilibeth. 
 -   
 -     
 - 20 pp.     28 cm.     
 -   
 -   
 - 
 - 
 -         .
 -     .
 -          0   .
 -         .
 -  0       .
<br/><br/>   Undergraduate Thesis: (BSCS major in Computer Science) -Pamantasan ng Lungsod ng Maynila, 2002. 
<br/><br/>
<br/><br/>      
<br/><br/>   5 
<br/><br/>      
<br/><br/> 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.       
<br/><br/>      
<br/><br/><br/> <br/> <br/> <br/> <br/> <br/> <br/> 
<br/><br/><br/>5     
<br/><br/><br/> <br/>   
<br/><br/><label>ISBN: </label>  
<br/><br/><label>ISSN: </label>2 
 =   
 =   
<br/><br/><label>Standard No.: </label>        
<br/><br/><label>Publisher. No.: </label>  
<br/><br/><label>Source: </label>        
<br/><br/><label>LCCN: </label>
<br/><br/><label>Nat. Bib. No.: </label> 2 
<br/><br/><label>Nat. Bib. Agency Control No.: </label>    
<br/><br/><label>Subjects--Personal Names: </label><br/>     2     --0------
<br/><br/><label>Subjects--Corporate Names: </label><br/>     6 --0-- 2 --------
<br/><br/><label>Subjects--Meeting Names: </label><br/><br/> 0    2 --
<br/><br/><label>Subjects--Uniform Titles: </label><br/>  --20------
<br/><br/><label>Subjects--Chronological Terms: </label><br/> 
<br/><br/><label>Subjects--Topical Terms: </label><br/>    --------20--
<br/><br/><label>Subjects--Geographic Terms: </label><br/>--------20--
<br/><br/><label>Index Terms--Genre/Form: </label><br/>----2
<br/><br/><label>LC Class. No.: </label> / 2 
<br/><br/><label>Dewey Class. No.: </label> / 2 
<br/><br/><label>National Agricultural Library Call No.: </label> /  
<br/><br/><label>National Library of Medicine Call No.: </label> /  
<br/><br/><label>Gov. Doc. Class. No.: </label>