Skip Navigation

The Computer Journal 1977 20(4):335-339; doi:10.1093/comjnl/20.4.335
© 1977 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Willis, P. J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A real time hidden surface technique

P. J. Willis *

School of Engineering and Applied Science, University of Sussex, Falmer, Brighton, UK

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.

Received June 1976.

* School of Engineering and Applied Science, University of Sussex, Falmer, Brighton BN1 9QT


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.