On visible surface generation by a priori tree structures

Henry Fuchs, Zvi Kedem, Bruce F. Naylor

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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 of polygons, and presents the development of theoretical foundations in the area as well as additional related algorithms. As in many applications the environment to be displayed consists of polygons many of whose relative geometric relations are static, we attempt to capitalize on this by pre processing tile environment,s database so as to decrease the run-time computations required to generate a scene. This preprocessing is based on generating a "ninary space partitioning" tree whose inorder traversal of visibility priority at run-time will produce a lineaL" order, dependent upon the viewing position, on (parts of) the polygons, which can then be used to easily solve the hidden surfac6 problem. In the application where the entire environment is static with only the viewing-position changing, as is common in simulation, the results presented will be safficient to solve completely tlae llidden surface problem.

Original languageEnglish (US)
Title of host publicationProceedings of the 7th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1980
PublisherAssociation for Computing Machinery, Inc
Pages124-133
Number of pages10
ISBN (Print)0897910214, 9780897910217
DOIs
StatePublished - Jul 14 1980
Event7th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1980 - Seattle, United States
Duration: Jul 14 1980Jul 18 1980

Other

Other7th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1980
CountryUnited States
CitySeattle
Period7/14/807/18/80

Fingerprint

Tile
Visibility
Processing

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

Fuchs, H., Kedem, Z., & Naylor, B. F. (1980). On visible surface generation by a priori tree structures. In Proceedings of the 7th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1980 (pp. 124-133). Association for Computing Machinery, Inc. https://doi.org/10.1145/800250.807481

On visible surface generation by a priori tree structures. / Fuchs, Henry; Kedem, Zvi; Naylor, Bruce F.

Proceedings of the 7th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1980. Association for Computing Machinery, Inc, 1980. p. 124-133.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fuchs, H, Kedem, Z & Naylor, BF 1980, On visible surface generation by a priori tree structures. in Proceedings of the 7th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1980. Association for Computing Machinery, Inc, pp. 124-133, 7th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1980, Seattle, United States, 7/14/80. https://doi.org/10.1145/800250.807481
Fuchs H, Kedem Z, Naylor BF. On visible surface generation by a priori tree structures. In Proceedings of the 7th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1980. Association for Computing Machinery, Inc. 1980. p. 124-133 https://doi.org/10.1145/800250.807481
Fuchs, Henry ; Kedem, Zvi ; Naylor, Bruce F. / On visible surface generation by a priori tree structures. Proceedings of the 7th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1980. Association for Computing Machinery, Inc, 1980. pp. 124-133
@inproceedings{389933c17f8b426a9f9ee23c36d52c1e,
title = "On visible surface generation by a priori tree structures",
abstract = "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 of polygons, and presents the development of theoretical foundations in the area as well as additional related algorithms. As in many applications the environment to be displayed consists of polygons many of whose relative geometric relations are static, we attempt to capitalize on this by pre processing tile environment,s database so as to decrease the run-time computations required to generate a scene. This preprocessing is based on generating a {"}ninary space partitioning{"} tree whose inorder traversal of visibility priority at run-time will produce a lineaL{"} order, dependent upon the viewing position, on (parts of) the polygons, which can then be used to easily solve the hidden surfac6 problem. In the application where the entire environment is static with only the viewing-position changing, as is common in simulation, the results presented will be safficient to solve completely tlae llidden surface problem.",
author = "Henry Fuchs and Zvi Kedem and Naylor, {Bruce F.}",
year = "1980",
month = "7",
day = "14",
doi = "10.1145/800250.807481",
language = "English (US)",
isbn = "0897910214",
pages = "124--133",
booktitle = "Proceedings of the 7th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1980",
publisher = "Association for Computing Machinery, Inc",

}

TY - GEN

T1 - On visible surface generation by a priori tree structures

AU - Fuchs, Henry

AU - Kedem, Zvi

AU - Naylor, Bruce F.

PY - 1980/7/14

Y1 - 1980/7/14

N2 - 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 of polygons, and presents the development of theoretical foundations in the area as well as additional related algorithms. As in many applications the environment to be displayed consists of polygons many of whose relative geometric relations are static, we attempt to capitalize on this by pre processing tile environment,s database so as to decrease the run-time computations required to generate a scene. This preprocessing is based on generating a "ninary space partitioning" tree whose inorder traversal of visibility priority at run-time will produce a lineaL" order, dependent upon the viewing position, on (parts of) the polygons, which can then be used to easily solve the hidden surfac6 problem. In the application where the entire environment is static with only the viewing-position changing, as is common in simulation, the results presented will be safficient to solve completely tlae llidden surface problem.

AB - 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 of polygons, and presents the development of theoretical foundations in the area as well as additional related algorithms. As in many applications the environment to be displayed consists of polygons many of whose relative geometric relations are static, we attempt to capitalize on this by pre processing tile environment,s database so as to decrease the run-time computations required to generate a scene. This preprocessing is based on generating a "ninary space partitioning" tree whose inorder traversal of visibility priority at run-time will produce a lineaL" order, dependent upon the viewing position, on (parts of) the polygons, which can then be used to easily solve the hidden surfac6 problem. In the application where the entire environment is static with only the viewing-position changing, as is common in simulation, the results presented will be safficient to solve completely tlae llidden surface problem.

UR - http://www.scopus.com/inward/record.url?scp=85033218518&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85033218518&partnerID=8YFLogxK

U2 - 10.1145/800250.807481

DO - 10.1145/800250.807481

M3 - Conference contribution

SN - 0897910214

SN - 9780897910217

SP - 124

EP - 133

BT - Proceedings of the 7th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1980

PB - Association for Computing Machinery, Inc

ER -