VISIBLE SURFACE GENERATION BY A PRIORI TREE STRUCTURES.

Henry Fuchs, Zvi Kedem, Bruce F. Naylor

Research output: Contribution to journalArticle

Abstract

A description is given of 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, the authors attempt to capitalize on this by preprocessing the environment's database so as to decrease the run-time computations required to generate a scene.

Original languageEnglish (US)
Pages (from-to)124-133
Number of pages10
JournalComputer Graphics (ACM)
Volume14
Issue number3
StatePublished - Jul 1980

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

VISIBLE SURFACE GENERATION BY A PRIORI TREE STRUCTURES. / Fuchs, Henry; Kedem, Zvi; Naylor, Bruce F.

In: Computer Graphics (ACM), Vol. 14, No. 3, 07.1980, p. 124-133.

Research output: Contribution to journalArticle

Fuchs, H, Kedem, Z & Naylor, BF 1980, 'VISIBLE SURFACE GENERATION BY A PRIORI TREE STRUCTURES.', Computer Graphics (ACM), vol. 14, no. 3, pp. 124-133.
Fuchs, Henry ; Kedem, Zvi ; Naylor, Bruce F. / VISIBLE SURFACE GENERATION BY A PRIORI TREE STRUCTURES. In: Computer Graphics (ACM). 1980 ; Vol. 14, No. 3. pp. 124-133.
@article{6382aef06d594eb2ba8b8871979e4a2d,
title = "VISIBLE SURFACE GENERATION BY A PRIORI TREE STRUCTURES.",
abstract = "A description is given of 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, the authors attempt to capitalize on this by preprocessing the environment's database so as to decrease the run-time computations required to generate a scene.",
author = "Henry Fuchs and Zvi Kedem and Naylor, {Bruce F.}",
year = "1980",
month = "7",
language = "English (US)",
volume = "14",
pages = "124--133",
journal = "Computer Graphics (ACM)",
issn = "0097-8930",
publisher = "Association for Computing Machinery (ACM)",
number = "3",

}

TY - JOUR

T1 - VISIBLE SURFACE GENERATION BY A PRIORI TREE STRUCTURES.

AU - Fuchs, Henry

AU - Kedem, Zvi

AU - Naylor, Bruce F.

PY - 1980/7

Y1 - 1980/7

N2 - A description is given of 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, the authors attempt to capitalize on this by preprocessing the environment's database so as to decrease the run-time computations required to generate a scene.

AB - A description is given of 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, the authors attempt to capitalize on this by preprocessing the environment's database so as to decrease the run-time computations required to generate a scene.

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

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

M3 - Article

AN - SCOPUS:0019033556

VL - 14

SP - 124

EP - 133

JO - Computer Graphics (ACM)

JF - Computer Graphics (ACM)

SN - 0097-8930

IS - 3

ER -