Premium
Arbitrary Area Filling in a Fast Procedure
Author(s) -
Ying DaoNing,
Feng Xing
Publication year - 1985
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.1985.tb00241.x
Subject(s) - computer science , fortran , microcomputer , line (geometry) , sample (material) , computer graphics (images) , representation (politics) , algorithm , ibm , parallel computing , computational science , programming language , geometry , mathematics , telecommunications , chip , chemistry , materials science , chromatography , politics , political science , law , nanotechnology
A representation for area filling is described which allows shading of an area that may have both straight lines and circular arc edges and include holes within its boundaries. For efficiency an elimination algorithm which has a waiting line list and a currently active line list is adopted. For calculating intersections, a more time saving method is used. The algorithm and some practical examples are discussed. The main features of the algorithm are execution with high speed and less storage requirement. The program is written both in BASIC and FORTRAN 77 and could be executed on a microcomputer such as APPLE II, IBM‐P/C etc. The sample outputs shown in this paper are generated by the APPLE II with high efficiency.