On visible surface generation by a priori tree structures

摘要: This paper describes a new algorithm for solving the hidden surface (or line) problem, to more rapidly generate realistic images of 3-D scenes composed polygons, and presents development theoretical foundations in area as well additional related algorithms. As many applications environment be displayed consists polygons whose relative geometric relations are static, we attempt capitalize on this by preprocessing environment's database so decrease run-time computations required scene. is based generating “binary space partitioning” tree order traversal visibility priority at will produce linear order, dependent upon viewing position, (parts of) which can then used easily solve problem. In application where entire static with only viewing-position changing, common simulation, results presented sufficient completely