Results 1 
4 of
4
A Geometric Framework for Computer Graphics Addressing Modeling, Visibility, and Shadows
, 1999
"... The main question this dissertation addresses is the following: Is it possible to design a computer graphics API such that modeling primitives, computing visibility, and generating shadows from point, linear, and area light sources can be conveniently and concisely expressed? The thesis answers this ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
The main question this dissertation addresses is the following: Is it possible to design a computer graphics API such that modeling primitives, computing visibility, and generating shadows from point, linear, and area light sources can be conveniently and concisely expressed? The thesis answers this question in the affirmative by describing a framework for geometric computing in computer graphics. The classes in the layered system constituting the framework are described using the UML notation and each algorithm presented is encapsulated in a member method of a class in the hierarchy. We identify a number of abstractions for objectâ€“space graphics such as transparent visibility and opaque visibility. These abstractions are somewhat harder to implement than standard rasterized abstractions as they rely on graphs and planar maps. Nevertheless, these notions prove to be fundamental in this work on objectâ€“space graphics and also appear to be fundamental for computer graphics in general. We propose that clients of a graphics API such as the one presented here should be relieved from the onus of computing shadows and we show that the computation of shadows can be automated and encapsulated in the framework. We address illumination under a point, a linear,
Trends and Developments in Computational Geometry
 COMPUTER GRAPHICS FORUM
, 1995
"... This report discusses some trends and achievements in computational geometry during the past five years, with emphasis on problems related to computer graphics. Furthermore, a direction of research in computational geometry is discussed, which could help in bringing the fields of computational ge ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
This report discusses some trends and achievements in computational geometry during the past five years, with emphasis on problems related to computer graphics. Furthermore, a direction of research in computational geometry is discussed, which could help in bringing the fields of computational geometry and computer graphics closer together.
The Object Complexity Model For HiddenSurface Removal
, 1998
"... We define a new model of complexity, called object complexity, for measuring the performance of hiddensurface removal algorithms. This model is more appropriate for predicting the performance of these algorithms on current graphics rendering systems than the standard measure of scene complexity ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We define a new model of complexity, called object complexity, for measuring the performance of hiddensurface removal algorithms. This model is more appropriate for predicting the performance of these algorithms on current graphics rendering systems than the standard measure of scene complexity used in computational geometry. We also