Use this URL to cite or link to this record in EThOS: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.480717 |
![]() |
|||||
Title: | CGAL : computer graphics and animation language. | ||||
Author: | Comninos, P. P. |
ISNI:
0000 0001 3561 0763
|
|||
Awarding Body: | Teesside Polytechnic | ||||
Current Institution: | Teesside University | ||||
Date of Award: | 1983 | ||||
Availability of Full Text: |
|
||||
Abstract: | |||||
This thesis describes an investigation of the
possibility of using interactive progr~ing languages for
the production of animated films of models of 3-D solids.
Two such languages are described, CGALt0 and CGALtl.
CGAL#0 is an interactive command interpretive language and
CGAL#l is an interpretive procedural high level language.
Both these languages were especially designed for the
purposes of 3-D model animation and implemented by the
author.
A dynamic display priority hidden surface algorithm,
designed by the author, is presented. This algorithm is
similar to the Newell algorithm but utilizes a different,
more efficient priority sort.
At present the author has implemented a restricted
version of this algorithm. The restrictions are that the
polygonal facets are non-intersecting and do not overlap
one another cyclically. With cyclically overlapping
facets this restricted algorithm does not guarantee
correct results. This restricted algorithm sorts the list
of facets in priority order without ever having to split a
facet.
An extended form of this algorithm
intersecting and cyclically overlapping
developed but not yet implemented.
dealing with
facets has been
The author
algorithm that
hidden surface
problem.
has also designed and implemented an
utilizes the priority list produced by the
algorithm in order to solve the hidden line
|
|||||
Supervisor: | Not available | Sponsor: | Not available | ||
Qualification Name: | Thesis (Ph.D.) | Qualification Level: | Doctoral | ||
EThOS ID: | uk.bl.ethos.480717 | DOI: | Not available | ||
Keywords: | Pattern recognition & image processing | ||||
Share: |