A real-time hidden surface technique

P Willis

Research output: Contribution to journalArticle

Abstract

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.
Original languageEnglish
Pages (from-to)335-339
Number of pages5
JournalThe Computer Journal
Volume20
Issue number4
DOIs
Publication statusPublished - 1977

Fingerprint

Flight simulators
Real time systems

Cite this

A real-time hidden surface technique. / Willis, P.

In: The Computer Journal, Vol. 20, No. 4, 1977, p. 335-339.

Research output: Contribution to journalArticle

Willis, P. / A real-time hidden surface technique. In: The Computer Journal. 1977 ; Vol. 20, No. 4. pp. 335-339.
@article{56ce97ac97b842eabc39e15287563636,
title = "A real-time hidden surface technique",
abstract = "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.",
author = "P Willis",
year = "1977",
doi = "10.1093/comjnl/20.4.335",
language = "English",
volume = "20",
pages = "335--339",
journal = "The Computer Journal",
issn = "0010-4620",
publisher = "Oxford University Press",
number = "4",

}

TY - JOUR

T1 - A real-time hidden surface technique

AU - Willis, P

PY - 1977

Y1 - 1977

N2 - 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.

AB - 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.

UR - http://dx.doi.org/10.1093/comjnl/20.4.335

U2 - 10.1093/comjnl/20.4.335

DO - 10.1093/comjnl/20.4.335

M3 - Article

VL - 20

SP - 335

EP - 339

JO - The Computer Journal

JF - The Computer Journal

SN - 0010-4620

IS - 4

ER -