z-logo
open-access-imgOpen Access
A real time hidden surface technique
Author(s) -
Philip Willis
Publication year - 1977
Publication title -
the computer journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.319
H-Index - 64
eISSN - 1460-2067
pISSN - 0010-4620
DOI - 10.1093/comjnl/20.4.335
Subject(s) - acknowledgement , computation , computer science , representation (politics) , surface (topology) , measure (data warehouse) , simple (philosophy) , algorithm , artificial intelligence , computer vision , real time computing , mathematics , data mining , geometry , politics , political science , law , philosophy , computer security , epistemology
Most hidden surface algorithms require a considerable amount of computation for all but the simplest images. This prevents their use in real time systems where new frames may be calculated at a rate of 25 per second. The paper presents an approach suitable for fixed models, such as those used in flight simulators, where most of the time consuming computation may be performed when the model is first created. The technique is to test for surface proximity in a well defined manner, ‘well spaced’ surfaces requiring a simple measure of distance to determine priority, and ‘closely spaced’ surfaces being modified until they are ‘well spaced’. This modification is only in the representation of the surface and does not affect its final appearance in the picture. The work to be described is part of a project financed by the Science Research Council, to which grateful acknowledgement is made

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom