Rectangles Filling using Divide and Conquer Method
Abstract
Keywords
Full Text:
PDFReferences
Ellis Horowitz, Satraj Sahni and Rajasekharam, “Fundamentals of Computer Algorithms”, 2 ed, Galgotia publications Pvt. Ltd.
D F Rogers, “mathematical Elements for Computer Graphics”, McGraw Hill (Indian Edition).
James D.Foley, Andries Van Dam, Steven K.Feiner, Jhon F.Hughes “Computer Graphics Principles and Practice” , Second Edition in C, Pearson Education.
Donald Hearn and M. Pauline Baker “Computer Graphics C version”, Pearson Education.
Hoo-Cheng Liu, Mu-Hwa Chen, Shou-Yiing Hsu, Chaoyin Chien, Tsu-Feng Kuo and Yih-Farn Wang “A New Polygon Based Algorithm for Filling Regions” Tamkang Journal of Science and Engineering, Vol. 2, No. 4, pp. 175-186 (2000).
Pavlidis, T., "Filling algorithms for raster graphics," Computer Graphics and Image Processing 10, pp.126-141 (1979).
B. Chazelle, ,A theorem on polygon cutting with applications, proc. 23rd annual symp. On found. Of Comput. Sci., 1982, pp. 339-349.
A. Fournier and d. Y. Montuno, triangulating simple polygons and equivalent problems, acm Trans. On graphics, 3 (1984), pp. 153-174.
m. R. Garey, d. S. Johnson, f. P. Preparata and r. E. Tarjan, triangulating a simple polygon, Inform. Process. Lett., 7 (1978), pp. 175-180.
J. M. Keil, decomposing a polygon into simpler components, this journal, 14 (1985), pp. 799-817.
A Fast Trapezoidation Technique For Planar Polygons Gian Paolo Lorenzetto, Amitava Datta, and Richard ThomasDepartment of Computer Science University of Western Australia Nedlands W.A. 6907
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.