Premium
Hidden Lines using the EXCELL Method
Author(s) -
Tamminen M.
Publication year - 1982
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.1982.tb00032.x
Subject(s) - computer science , disjoint sets , directory , graphics , computation , data structure , variable (mathematics) , line (geometry) , computer graphics , theoretical computer science , algorithm , computer graphics (images) , mathematics , programming language , geometry , discrete mathematics , mathematical analysis , operating system
The Extendible cell (EXCELL) method provides a data structure for efficient coordinate based access. It stores geometric data into computer storage blocks corresponding to disjoint variable sized rectangular cells accessible by an address calculation type directory. Two efficient hidden line algorithms utilizing an EXCELL structure are presented, both of which perform satisfactorily even if central memory is small compared to the total amount of data. The computation time is approximately proportional to the amount of input. An important aspect of the method is that the programs are contained within a “standard” general purpose graphics system.