(Some images might got lost during the LaTex->HTML conversion)
of our research and the talk are also available in postscript format
: FoSe_notes.ps.gz(12MB)
[Danskin, Hanrahan '92] extension of
[Laur, Hanrahan '91](Space Leaping) and [Levoy
'90a](Splatting) All Algorithms are based on preprocessing the data
storing them in octrees together with certain information about the homogenity
of the volumetric area corresponding to each node of the tree.
Proximity Clouds: [Yagel, Shi '93].
Definitions: Pixel + object space coherence, ray coherence + frame-to-frame
coherence
Exploiting pixel space coherence: Adaptive raycasting.
sentence "it is highly probable...."
the algorithm
problems: the selection of omega_min, omega_max, epsilon
results
Exploiting object space coherence: Adaptive refinement.
Central data structures: Pyramides and octrees. Subdividing the space in
an adaptive manner with respect to a certain area coherence (empty/non-empty
areas, homogeneous areas).
Preprocessing allows fast traversal of empty areas (space leaping) and
fast sampling of homogeneous areas.
Exploiting object space coherence: Proximity Clouds
Algorithm + Advantages with respect to 6.
Detecting areas with constant linear and non-linear behaviour via Wavelets.
Coherence in stereoscopic visualization.
What is stereoscopic visualization, the three steps
Katja Buehler (Who chose the colors ;) ) and Anna Vilanova (Who is not really convinced about the colors ;) (Lukas Mroz, who reset the colors }:-]= ) Mon Feb 1 16:10:17 MET 1999