On scene complexity definition for rendering
Ľudovít Niepel, Jozef Martinka, A Ferko, Pavol Eliass · Digital Library (University of West Bohemia) · 1995
This paper introduces one way how to define in a mathematically correct way the complexity of the polygonal scene for rendering. This complexity allows to compare previously incomparable rendering algorithms via computing the complexity of various scenes, and give the more rigid solution of other related problems. The advantages of this unified approach are discussed.