Welcome to the 18th Spring Conference on Computer Graphics (SCCG 2002). Now it its 18th year, SCCG is the oldest annual conference in computer graphics in central Europe. SCCG is a leading international forum for the exchange of ideas on all aspects of computer graphics. In addition to the high quality peer reviewed papers from around the world, we are delighted to have invited talks from Marcus Gross from ETH Zürich, Switzerland, Karol Myszkowski from the Max-Planck-Institut für Informatik, Germany and Pavel ZemČík of Brno Technical University, Czech Republic.
Very realistic graphics for visualising archaeological site reconstructions
Recent developments in computer graphics are providing powerful tools for modelling multidimensional aspects of data gathered by archaeologists. Computer graphics techniques can now be used to reconstruct and visualise features of a site which may ...
Perception-based global illumination, rendering, and animation techniques
In this paper, we consider applications of perception-based video quality metrics to improve the performance of global lighting computations and rendering of animation sequences. To control the computation of animation frames we use the Animation ...
Hardware acceleration of graphics and imaging algorithms using FPGAs
Computer graphics algorithms and algorithms used in image processing are generally computationally expensive. This fact is the reason why people struggle to accelerate such algorithms using any reasonable means. The traditional sources of speedup are ...
A framework for facial surgery simulation
The accurate prediction of the post-surgical facial shape is of paramount importance for surgical planning in facial surgery. In this paper we present a framework for facial surgery simulation which is based on volumetric finite element modeling. We ...
Interactive virtual gallery
Interactive virtual gallery is a project designed to help gallery visitors and to facilitate the work of gallery designers preparing art exhibitions and other displays.It gives gallery visitors the possibility to see exhibitions in virtual reality.It ...
Teaching tennis in virtual environment
This paper deals with the problems of human animation and motion analysis, particularly in the area of methodological applications in sports training. We describe a particular program tool that has been implemented as a Java applet connected to the VRML ...
A new algorithm for detecting corners in digital images
Corners and vertices are important features in images, which are frequently used for scene analysis, stereo matching and object tracking. Many algorithms for detecting the corners have been reported up to now. In this paper, a new algorithm is ...
Connected component labeling based on the EVM model
This paper presents a new approach to achieve connected component labeling on both binary images and volumes by using the Extreme Vertices Model (EVM), a representation model for orthogonal polyhedra, applied to digital images and volume datasets ...
Entropy metrics used for video summarization
New methods for detecting shot boundaries in video sequences and for extracting key frames using metrics based on information theory are proposed. The method for shot cut detection relies on the mutual information and the joint entropy between the ...
Adaptive gain control for high dynamic range image display
Realistic display of high dynamic range images without introducing any artifact is a hard problem. In this paper we address this problem using a detail preserving local gain control approach. Unlike many other local gain control methods available in the ...
Hemicube shooting for non-diffuse global illumination
The hemicube is a classical tool to transfer the light power in diffuse radiosity algorithms. The main advantage of the hemicube based light transfer is that the visible patches can easily be identified by the graphics hardware. This paper extends the ...
On the efficiency of ray-shooting acceleration schemes
This paper examines the efficiency of different rayshooting acceleration schemes, including the uniform space subdivision, octree and kd-tree. We use simple computational models, which assume that the objects are uniformly distributed in space. The ...
Importance sampling with hemispherical particle footprints
We present a new importance sampling technique for stochastic ray-based global illumination methods. It allows to enhance the efficiency of global illumination calculations in general scenes with complex illumination settings by selecting preferably ...
Integration of geomorphing into level of detail management for realtime rendering
Realtime rendering of scenes with discrete levels of detail (LOD) often suffers from noticeable visual changes between succesive frames. We propose geomorphing to obtain smoother animations while retaining guaranteed frame rates. Our level of detail ...
Implicit linear interval estimations
Visualization and collision detection are two of the most important problems connected with implicit objects. Enumeration algorithms can be used either directly or as preprocessing step for many algorithms solving these problems. In general, enumeration ...
The pLab project: an extensible architecture for physically-based simulations
Pluggable architectures have become a popular means of creating extensible applications. Traditional plugins however are mostly fixed, single-purpose extensions that have only limited capabilities. We present a framework that allows the building of ...
A survey of the modelling and rendering of the earth's atmosphere
One of the extensively researched fields in todays computer graphics are techniques for simulation and visualisation of various natural phenomena. This state of the art report is a survey of the methods for modelling and rendering of the cloudless Earth'...
Adaptive algorithm for vector field interpolation based on octree structure
Computer graphics helps mathematicians and physicians visualize calculations and processed data. Visualization algorithms operating on vector field [9], [13], such as particle-tracing, require continuous (defined for every (x, y, z) position within the ...
Feature preservation in view-dependent multiresolution meshes
Normal vector discontinuities on surfaces provide important visual cues for understanding the image of a geometrical object since they often indicate feature boundaries. We present an algorithm that preserves the appearance of features in view-dependent ...
Efficient construction of visibility maps using approximate occlusion sweep
We present an algorithm that efficiently constructs a visibility map for a given view of a polygonal scene. The view is represented by a BSP tree and the visibility map is obtained by postprocessing of that tree. The scene is organised in a kD-tree that ...
Comparison of viewshed algorithms on regular spaced points
Viewshed is a basic visibility structure and represents all visible points from a given viewpoint. The paper gives a survey of non-parallel viewshed algorithms using regular spaced points. At first, a comprehensive background of the problem is given, ...
Parametrizing geometric objects using λ-calculus
This paper focuses on the general parameterization in geometric modeling. We have adapted the λ-calculus formalism to an existing geometrical model which has an applicative representation: the generalized maps embedded in the plane. We investigated how ...
Index Terms
Proceedings of the 18th Spring Conference on Computer Graphics




