Index: trunk/VUT/doc/SciReport/multirow.sty
===================================================================
--- trunk/VUT/doc/SciReport/multirow.sty	(revision 243)
+++ trunk/VUT/doc/SciReport/multirow.sty	(revision 243)
@@ -0,0 +1,159 @@
+%%
+%% multirow.sty  V1.6 version (5-May-2004)
+%%
+%% Author:  Jerry Leichter <jerrold.leichter@smarts.com>
+%%          Piet van Oostrum <piet@cs.uu.nl>
+%%
+%% This file may be distributed under the terms of the LaTeX Project Public
+%% License, as described in lppl.txt in the base LaTeX distribution.
+%% Either version 1 or, at your option, any later version.
+%%
+%% V1.0 was distributed anonymously, based on a Usenet posting that was
+%%      not intended for stand-alone use.
+%% V1.1 was modified by Piet van Oostrum <piet@cs.uu.nl> to allow it to
+%%      work without bigstrut.sty.
+%% V1.2 was modified by Jerry Leichter for the same goal, but using a
+%%      different approach which will work properly in conjunction with
+%%      bigstrut.sty.
+%% V1.2a was modified by Piet van Oostrum <piet@cs.uu.nl> to use \vskip
+%%    instead of \raise in positioning, avoiding making rows too high
+%%    when the adjustment is large.
+%% V1.3 was modified by Piet van Oostrum to work properly in a p{} column
+%%      (\leavevmode added)
+%% V1.4 was modified by Piet van Oostrum to check for the special case that
+%%      the width is given as an *. In this case the natural
+%%      width of the text argument will be used and the argument
+%%      is processed in LR-mode.
+%% V1.5 was modified by Piet van Oostrum: Added a % after \hbox{#5}\vfill}.
+%%      Added \struts around #5 for better vertical positioning.
+%%      Additional coding for negative value of nrows.
+%% V1.6 was modified by Piet van Oostrum: Replace a space by \relax after
+%%      \advance\@tempdima#4.
+%%
+% Make an entry that will span multiple rows of a table.
+%
+% \multirow{nrows}[bigstruts]{width}[fixup]{text}
+%
+% nrows is the number of rows to span.  It's up to you to leave the other
+%       rows empty, or the stuff created by \multirow will over-write it.
+%       With a positive value of nrows the spanned colomns are this row and
+%       (nrows-1) rows below it. With a negative value of nrows they are
+%       this row and (1-nrows) above it.
+%
+% bigstruts is mainly used if you've used bigstrut.sty.  In that case it
+%       is the total number of uses of \bigstrut within the rows being
+%       spanned.  Count 2 uses for each \bigstrut, 1 for each \bigstrut[x]
+%       where x is either t or b.  The default is 0.
+% width is the width to which the text is to be set, or * to indicate that
+%       the text argument's natural width is to be used.
+%
+% text is the actual text.  If the width was set explicitly, the text will
+%       be set in a parbox of that width; you can use \\ to force linebreaks
+%       where you like.
+%
+%       If the width was given as * the text will be set in LR mode.  If you
+%       want a multiline entry in this case you should use a tabular or array
+%       in the text parameter.
+%
+%       The text is centered vertically within the range spanned by nrows.
+%
+% fixup is a length used for fine tuning:  The text will be raised (or
+%       lowered, if fixup is negative) by that length above (below) wherever
+%       it would otherwise have gone.
+%
+% For example (using both multirow and bigstrut)
+%
+% \newcommand{\minitab}[2][l]{\begin{tabular}{#1}#2\end{tabular}}
+% \begin{tabular}{|c|c|}
+% \hline
+% \multirow{4}{1in}{Common g text} & Column g2a\\
+%       & Column g2b \\
+%       & Column g2c \\
+%       & Column g2d \\
+% \hline
+% \multirow{3}[6]*{Common g text} & Column g2a\bigstrut\\\cline{2-2}
+%       & Column g2b \bigstrut\\\cline{2-2}
+%       & Column g2c \bigstrut\\
+% \hline
+% \multirow{4}[8]{1in}{Common g text} & Column g2a\bigstrut\\\cline{2-2}
+%       & Column g2b \bigstrut\\\cline{2-2}
+%       & Column g2c \bigstrut\\\cline{2-2}
+%       & Column g2d \bigstrut\\
+% \hline
+% \multirow{4}*{\minitab[c]{Common \\ g text}} & Column g2a\\
+%       & Column g2b \\
+%       & Column g2c \\
+%       & Column g2d \\
+% \hline
+% \end{tabular}
+%
+% If any of the spanned rows are unusually large, or if you're using
+% bigstrut.sty and \bigstrut's are used assymetrically about the centerline of
+% the spanned rows, the vertical centering may not come out right.  Use the
+% fixup argument in this case.
+%
+% Just before "text" is expanded, the \multirowsetup macro is expanded to
+% set up any special environment.  Initially, \multirowsetup contains just
+% \raggedright.  It can be redefined with \renewcommand.
+%
+% Bugs:  It's just about impossible to deal correctly with descenders.  The
+% text will be set up centered, but it may then have a baseline that doesn't
+% match the baseline of the stuff beside it, in particular if the stuff
+% beside it has descenders and "text" does not.  This may result in a small
+% missalignment.  About all that can be done is to do a final touchup on
+% "text", using the fixup optional argument.  (Hint:  If you use a measure
+% like .1ex, there's a reasonable chance that the fixup will still be correct
+% if you change the point size.)
+%
+% \multirow is mainly designed for use with table, as opposed to array,
+% environments.  It will not work well in an array environment since the lines
+% have an extra \jot of space between them which it won't account for.  Fixing
+% this is difficult in general, and doesn't seem worth it.  The bigstruts
+% argument can be used to provide a semi-automatic fix:  First set
+% \bigstrutjot to .5\jot.  Then simply repeat nrows as the bigstruts argument.
+% This will be close, but probably not exact; you can use the fixup argument
+% to refine the result.  (If you do this repeatedly, you'll probably want to
+% wrap these steps up in a simple macro.  Note that the modified \bigstrutjot
+% value will not give reasonable results if you have bigstruts and use this
+% argument for its intended purpose elsewhere.  In that case, you might want
+% to set it locally.)
+%
+% If you use \multirow with the colortbl package you have to take
+% precautions if you want to color the column that has the \multirow in it.
+% colortbl works by coloring each cell separately. So if you use \multirow
+% with a positive nrows value, colortbl will first color the top cell, then
+% \multirow will typeset nrows cells starting with this cell, and later
+% colortbl will color the other cells, effectively hiding the text in that
+% area. This can be solved by putting the \multirow is the last row with a
+% negative nrows value.
+% Example:
+%  
+%  \begin{tabular}{l>{\columncolor{yellow}}l}
+%    aaaa & \\
+%    cccc & \\
+%    dddd & \multirow{-3}*{bbbb}\\
+%  \end{tabular}
+%
+\def\multirowsetup{\raggedright} 
+\def\multirow#1{\relax\@ifnextchar
+  [{\@multirow{#1}}{\@multirow{#1}[0]}}
+\def\@multirow#1[#2]#3{\@ifnextchar [{\@xmultirow{#1}[#2]{#3}}%
+  {\@xmultirow{#1}[#2]{#3}[0pt]}}
+\def\@xmultirow#1[#2]#3[#4]#5{\@tempcnta=#1%
+  \@tempdima\@tempcnta\ht\@arstrutbox
+  \advance\@tempdima\@tempcnta\dp\@arstrutbox
+  \ifnum\@tempcnta<0\@tempdima=-\@tempdima\fi
+  \advance\@tempdima#2\bigstrutjot
+  \if*#3\setbox0\vtop to \@tempdima{\vfill\multirowsetup
+    \hbox{\strut#5\strut}\vfill}%
+  \else
+      \setbox0\vtop to \@tempdima{\hsize#3\@parboxrestore
+                \vfill \multirowsetup \strut#5\strut\par\vfill}%
+  \fi
+  \ht0\z@\dp0\z@
+  \ifnum\@tempcnta<0\advance\@tempdima-\dp\@arstrutbox
+  \else\@tempdima=\ht\@arstrutbox
+     \ifnum#2>0 \advance\@tempdima\bigstrutjot \fi
+  \fi
+  \advance\@tempdima#4\relax\leavevmode\vtop{\vskip-\@tempdima\box0\vss}}
+\@ifundefined{bigstrutjot}{\newdimen\bigstrutjot \bigstrutjot\jot}{}
Index: trunk/VUT/doc/SciReport/plots/makefile
===================================================================
--- trunk/VUT/doc/SciReport/plots/makefile	(revision 243)
+++ trunk/VUT/doc/SciReport/plots/makefile	(revision 243)
@@ -0,0 +1,32 @@
+
+FIG := $(shell ls *.fig)
+
+EPS := $(shell ls *.eps) ${FIG:.fig=.eps}
+
+PDF = ${EPS:.eps=.pdf} ${FIG:.fig=.pdf}
+
+
+DEFAULT: $(EPS) $(PDF)
+
+pdf:
+	@make $(PDF)
+
+eps:
+	@make $(EPS)
+
+clean:
+	rm -f ${FIG:.fig=.eps} $(PDF)
+
+
+.SUFFIXES: .fig .eps .pdf
+
+.fig.eps: 
+	@echo "Converting $< to $@ ..."
+	@fig2dev -L eps $< $@
+	@echo "done."
+
+.eps.pdf: 
+	@echo "Converting $< to $@ ..."
+	@epstopdf $<
+	@echo "done."
+
Index: trunk/VUT/doc/SciReport/preprocessing.tex
===================================================================
--- trunk/VUT/doc/SciReport/preprocessing.tex	(revision 243)
+++ trunk/VUT/doc/SciReport/preprocessing.tex	(revision 243)
@@ -0,0 +1,2 @@
+\chapter{Visibility Preprocessing}
+\section{Introduction}
Index: trunk/VUT/doc/SciReport/online.tex
===================================================================
--- trunk/VUT/doc/SciReport/online.tex	(revision 243)
+++ trunk/VUT/doc/SciReport/online.tex	(revision 243)
@@ -0,0 +1,1080 @@
+\chapter{Online Visibility Culling}
+%*****************************************************************************
+
+\section{Introduction}
+
+ Visibility culling is one of the major acceleration techniques for
+the real-time rendering of complex scenes. The ultimate goal of
+visibility culling techniques is to prevent invisible objects from
+being sent to the rendering pipeline. A standard visibility-culling
+technique is {\em view-frustum culling}, which eliminates objects
+outside of the current view frustum. View-frustum culling is a fast
+and simple technique, but it does not eliminate objects in the view
+frustum that are occluded by other objects. This can lead to significant
+{\em overdraw}, i.e., the same image area gets covered more than
+once. The overdraw causes a waste of computational effort both in the
+pixel and the vertex processing stages of modern graphic hardware.
+%that is, we render each pixel in the image several times. For many complex
+%scenes with high occlusion, the effort wasted on overdraw cannot simply be
+%eliminated by the increasing the raw computational power of the hardware.
+%This problem becomes even more apparent on recent graphics hardware with
+%programmable vertex and pixel shaders: all complex per-vertex or per-pixel
+%computations on object get completely wasted if the object is occluded.
+The elimination of occluded objects is addressed by {\em occlusion
+culling}. In an optimized rendering pipeline, occlusion culling complements
+other rendering acceleration techniques such as levels of detail or
+impostors.
+
+ Occlusion culling can either be applied offline or online.  When
+applied offline as a preprocess, we compute a potentially visible set
+(PVS) for cells of a fixed subdivision of the scene. At runtime, we
+can quickly identify a PVS for the given viewpoint. However, this
+approach suffers from four major problems: (1) the PVS is  valid only
+for the original static scene configuration, (2) for a given
+viewpoint, the corresponding cell-based PVS can be overly
+conservative, (3) computing all PVSs is computationally expensive, and (4)
+an accurate PVS computation is difficult to implement for general
+scenes. Online occlusion culling can solve these problems at the cost
+of applying extra computations at each frame. To make these additional
+computations efficient, most online occlusion culling methods rely on a
+number of assumptions about the scene structure and its occlusion
+characteristics (e.g. presence of large occluders, occluder
+connectivity, occlusion by few closest depth layers).
+
+Recent graphics hardware natively supports an \emph{occlusion query}
+to detect the visibility of an object against the current contents of the
+z-buffer.  Although the query itself is processed quickly using the
+raw power of the graphics processing unit (GPU), its result is not
+available immediately due to the delay between issuing the query and
+its actual processing in the graphics pipeline. As a result, a naive
+application of occlusion queries can even decrease the overall
+application performance due the associated CPU stalls and GPU
+starvation. In this paper, we present an algorithm that aims to
+overcome these problems by reducing the number of issued queries and
+eliminating the CPU stalls and GPU starvation. To schedule the
+queries, the algorithm makes use of both the spatial and the temporal
+coherence of visibility. A major strength of our technique is its
+simplicity and versatility: the method can be easily integrated in
+existing real-time rendering packages on architectures supporting the
+underlying occlusion query.
+
+%Using spatial and assuming temporal coherence
+
+\section{Related Work}
+
+With the demand for rendering scenes of ever increasing size, there
+have been a number of visibility culling methods developed in the
+last decade.  A comprehensive survey of visibility culling methods
+was presented by Cohen-Or et al.~\cite{Cohen:2002:survey}. Another
+recent survey of Bittner and Wonka~\cite{bittner03:jep} discusses
+visibility culling in a broader context of other visibility problems.
+
+According to the domain of visibility computation, we distinguish
+between {\em from-point} and {\em from-region} visibility algorithms.
+From-region algorithms compute a PVS and are applied offline in a
+preprocessing phase~\cite{Airey90,Teller91a,Leyvand:2003:RSF}.
+From-point algorithms are applied online for each particular
+viewpoint~\cite{Greene93a,Hudson97,EVL-1997-163,bittner98b,Wonka:1999:OSF,Klosowski:2001:ECV}.
+In our further discussion we focus on online occlusion culling methods
+that exploit graphics hardware.
+
+A conceptually important online occlusion culling method is the
+hierarchical z-buffer introduced by Greene et al.~\cite{Greene93a}. It
+organizes the z-buffer as a pyramid, where the standard z-buffer is
+the finest level. At all other levels, each z-value is the farthest in
+the window corresponding to the adjacent finer level. The hierarchical
+z-buffer allows to quickly determine if the geometry in question is
+occluded. To a certain extent this idea is used in the current
+generation of graphics hardware by applying early z-tests of
+fragments in the graphics pipeline (e.g., Hyper-Z technology of ATI or
+Z-cull of NVIDIA). However, the geometry still needs to be sent to the
+GPU, transformed, and coarsely rasterized even if it is later
+determined invisible.
+
+ Zhang~\cite{EVL-1997-163} proposed hierarchical occlusion maps, which
+do not rely on the hardware support for the z-pyramid, but instead
+make use of hardware texturing. The hierarchical occlusion map is
+computed on the GPU by rasterizing and down sampling a given set of
+occluders. The occlusion map is used for overlap tests whereas the
+depths are compared using a coarse depth estimation buffer. Wonka and
+Schmalstieg~\cite{Wonka:1999:OSF} use occluder shadows to compute
+from-point visibility in \m25d scenes with the help of the GPU. This
+method has been further extended to online computation of from-region
+visibility executed on a server~\cite{wonka:01:eg}.
+
+%% In
+%% parallel to rendering, the visibility server calculates visibility for
+%% the neighborhood of the given viewpoint and sends them back to the
+%% display host.
+
+%% A similar method designed by Aila and
+%% Miettinen~\cite{aila:00:msc}. The incremental occlusion maps are
+%% created on the CPU, which takes the CPU computational time but it does
+%% not suffer the problem of slow read-back from the GPU.
+
+%Klosowski:2001:ECV
+
+Bartz et al.~\cite{Bartz98} proposed an OpenGL extension for occlusion
+queries along with a discussion concerning a potential realization in
+hardware. A first hardware implementation of occlusion queries came
+with the VISUALIZE fx graphics hardware~\cite{Scott:1998:OVF}. The
+corresponding OpenGL extension is called \hpot{}. A more recent OpenGL
+extension, \nvoq{}, was introduced by NVIDIA with the GeForce 3 graphics
+card and it is now also available as an official ARB extension.
+
+%Both
+%extensions have been used in several several occlusion methods
+%algorithms~\cite{Meissner01,Hillesland02,Staneker:2004:OCO}.
+%\cite{Meissner01}
+
+ Hillesland et al.~\cite{Hillesland02} have proposed an algorithm
+which employs the \nvoq. They subdivide the scene using a uniform
+grid. Then the cubes are traversed in slabs roughly perpendicular to
+the viewport. The queries are issued for all cubes of a slab at once,
+after the visible geometry of this slab has been rendered. The method
+can also use nested grids: a cell of the grid contains another grid
+that is traversed if the cell is proven visible. This method however
+does not exploit temporal and spatial coherence of visibility and it
+is restricted to regular subdivision data structures. Our new method
+addresses both these problems and provides natural extensions to
+balance the accuracy of visibility classification and the associated
+computational costs.
+
+ Recently, Staneker et al.~\cite{Staneker:2004:OCO} developed a method
+integrating occlusion culling into the OpenSG scene graph
+framework. Their technique uses occupancy maps maintained in software
+to avoid queries on visible scene graph nodes, and temporal coherence
+to reduce the number of occlusion queries. The drawback of the method
+is that it performs the queries in a serial fashion and thus it
+suffers from the CPU stalls and GPU starvation.
+
+%% The methods proposed in this paper can be used to make use of temporal
+%% and spatial coherence in the scope of existing visibility algorithms,
+%% that utilise a spatial hierarchy. Examples of these are algorithms
+%% based on hierarchical occlusion maps~\cite{Zhang97}, coverage
+%% masks~\cite{Greene:1996:HPT}, shadow frusta~\cite{Hudson97}, and
+%% occlusion trees~\cite{bittner98b_long}.
+
+On a theoretical level, our paper is related to methods aiming to
+exploit the temporal coherence of visibility. Greene et
+al.~\cite{Greene93a} used the set of visible objects from one frame to
+initialize the z-pyramid in the next frame in order to reduce the
+overdraw of the hierarchical z-buffer. The algorithm of Coorg and
+Teller~\cite{Coorg96b} restricts the hierarchical traversal to nodes
+associated with visual events that were crossed between successive
+viewpoint positions. Another method of Coorg and Teller~\cite{Coorg97}
+exploits temporal coherence by caching occlusion relationships.
+Chrysanthou and Slater have proposed a probabilistic scheme for
+view-frustum culling~\cite{Chrysanthou:97}.
+
+The above mentioned methods for exploiting temporal coherence are
+tightly interwoven with the particular culling algorithm. On the
+contrary, Bittner et al.~\cite{bittner01:jvca} presented a general
+acceleration technique for exploiting spatial and temporal coherence
+in hierarchical visibility algorithms. The central idea, which is also
+vital for this paper, is to avoid repeated visibility tests of
+interior nodes of the hierarchy. The problem of direct adoption of
+this method is that it is designed for the use with instantaneous CPU
+based occlusion queries, whereas hardware occlusion queries exhibit
+significant latency. The method presented herein efficiently overcomes
+the problem of latency while keeping the benefits of a generality and
+simplicity of the original hierarchical technique. As a result we
+obtain a simple and efficient occlusion culling algorithm utilizing
+hardware occlusion queries.
+
+
+%In this paper we show how to overcome this problem while
+%keeping the benefits of exploiting.
+
+
+The rest of the paper is organized as follows:
+Section~\ref{sec:hwqueries} discusses hardware supported occlusion
+queries and a basic application of these queries using a kD-tree.
+Section~\ref{sec:hoq} presents our new algorithm and
+Section~\ref{sec:optimizations} describes several additional
+optimizations. Section~\ref{sec:results} presents results obtained by
+experimental evaluation of the method and discusses its
+behavior. Finally Section~\ref{sec:conclusion} concludes the paper.
+
+
+
+
+\section{Hardware Occlusion Queries}
+\label{sec:hwqueries}
+
+
+Hardware occlusion queries follow a simple pattern: To test visibility
+of an occludee, we send its bounding volume to the GPU. The volume is
+rasterized and its fragments are compared to the current contents of
+the z-buffer. The GPU then returns the number of visible
+fragments. If there is no visible fragment, the occludee is invisible
+and it need not be rendered.
+
+\subsection{Advantages of hardware occlusion queries}
+
+There are several advantages of hardware occlusion queries:
+
+\begin{itemize}
+
+\item {\em Generality of occluders.} We can use the original scene geometry
+as occluders, since the queries use the current contents of the z-buffer.
+
+
+\item {\em Occluder fusion.} The occluders are merged in the z-buffer,
+so the queries automatically account for occluder fusion. Additionally
+this fusion comes for free since we use the intermediate result of the
+rendering itself.
+
+\item {\em Generality of occludees.} We can use complex
+occludees. Anything that can be rasterized quickly is suitable.
+
+\item {\em Exploiting the GPU power.} The queries take full advantage of
+the high fill rates and internal parallelism provided by modern GPUs.
+
+\item {\em Simple use.} Hardware occlusion queries can be easily
+integrated into a rendering algorithm. They provide a powerful tool to
+minimize the implementation effort, especially when compared to
+CPU-based occlusion culling.
+
+
+\end{itemize}
+
+
+
+\subsection{Problems of hardware occlusion queries}
+
+ Currently there are two main hardware supported variants of occlusion
+queries: the HP test (\hpot) and the more recent NV query (\nvoq, now
+also available as \arboq). The most important difference between the
+HP test and the NV query is that multiple NV queries can be
+issued before asking for their results, while only one HP test is
+allowed at a time, which severely limits its possible algorithmic
+usage. Additionally the NV query returns the number of visible pixels
+whereas the HP test returns only a binary visibility
+classification.
+
+%% Issuing multiple independent NV queries is crucial for
+%% the design of algorithms that strive to exploit power of the GPU.
+
+ The main problem of both the HP test and the NV query is the latency
+between issuing the query and the availability of the result. The
+latency occurs due to the delayed processing of the query in a long
+graphics pipeline, the cost of processing the query itself, and the
+cost of transferring the result back to the CPU. The latency causes
+two major problems: CPU stalls and GPU starvation. After issuing the
+query, the CPU waits for its result and does not feed the GPU with new
+data. When the result finally becomes available, the GPU pipeline can
+already be empty. Thus the GPU needs to wait for the CPU to process
+the result of the query and to feed the GPU with new data.
+
+A major challenge when using hardware occlusion queries is to avoid
+the CPU stalls by filling the latency time with other tasks, such as
+rendering visible scene objects or issuing other, independent
+occlusion queries (see Figure~\ref{fig:latency})
+
+
+\begin{figure}[htb]
+  \centerline{
+    \includegraphics[width=0.5\textwidth,draft=\DRAFTFIGS]{figs/latency2}
+    }
+
+  \caption{(top) Illustration of CPU stalls and GPU starvation.
+    Qn, Rn, and Cn denote querying, rendering, and culling of object
+    n, respectively. Note that object 5 is found invisible by Q5 and
+    thus not rendered. (bottom) More efficient query scheduling. The
+    scheduling assumes that objects 4 and 6 will be visible in the
+    current frame and renders them without waiting for the result of
+    the corresponding queries. }
+  \label{fig:latency}
+\end{figure}
+
+
+
+
+
+\subsection{Hierarchical stop-and-wait method}
+\label{sec:basic}
+
+Many rendering algorithms rely on hierarchical structures in order to
+deal with complex scenes.  In the context of occlusion culling, such a
+data structure allows to efficiently cull large scene blocks, and thus
+to exploit spatial coherence of visibility and provide a key to
+achieving output sensitivity.
+
+This section outlines a naive application of occlusion queries in the
+scope of a hierarchical algorithm. We refer to this approach as the
+{\em hierarchical stop-and-wait} method. Our discussion is based on
+kD-trees, which proved to be efficient for point location, ray
+tracing, and visibility
+culling~\cite{MacDonald90,Hudson97,Coorg97,bittner01:jvca}. The
+concept applies to general hierarchical data structures as well, though.
+
+The hierarchical stop-and-wait method proceeds as follows: Once a
+kD-tree node passes view-frustum culling, it is tested for
+occlusion by issuing the occlusion query and waiting for its
+result. If the node is found visible, we continue by recursively
+testing its children in a front-to-back order. If the node is a
+leaf, we render its associated objects.
+
+ The problem with this approach is that we can continue the tree
+traversal only when the result of the last occlusion query becomes
+available. If the result is not available, we have to stall the CPU,
+which causes significant performance penalties. As we document in
+Section~\ref{sec:results}, these penalties together with the overhead
+of the queries themselves can even decrease the overall application
+performance compared to pure view-frustum culling. Our new method aims
+to eliminate this problem by issuing multiple occlusion queries for
+independent scene parts and exploiting temporal coherence of
+visibility classifications.
+
+
+\section{Coherent Hierarchical Culling}
+
+\label{sec:hoq}
+
+ In this section we first present an overview of our new
+algorithm. Then we discuss its steps in more detail.
+
+%and present a
+%generalization of the method to other spatial data structures.
+
+\subsection{Algorithm Overview}
+
+\label{sec:overview}
+
+
+Our method is based on exploiting temporal coherence of visibility
+classification. In particular, it is centered on the following
+three ideas:
+
+\begin{itemize}
+ \item We initiate occlusion queries on nodes of the hierarchy where
+   the traversal terminated in the last frame. Thus we avoid queries
+   on all previously visible interior nodes~\cite{bittner01:jvca}.
+ \item We assume that a previously visible leaf node remains visible
+   and render the associated geometry without waiting for the result
+   of the corresponding occlusion query.
+\item Issued occlusion queries are stored in a query queue until they are known to be carried out by the GPU. This allows
+  interleaving the queries with the rendering of visible geometry.
+\end{itemize}
+
+
+The algorithm performs a traversal of the hierarchy that is
+terminated either at leaf nodes or nodes that are classified as
+invisible. Let us call such nodes the {\em termination nodes}, and
+interior nodes that have been classified visible the {\em opened
+nodes}. We denote sets of termination and opened nodes in the $i$-th
+frame $\mathcal{T}_i$ and $\mathcal{ O}_i$, respectively. In the
+$i$-th frame, we traverse the kD-tree in a front-to-back order, skip
+all nodes of $\mathcal{ O}_{i-1}$ and apply occlusion queries first on
+the termination nodes $\mathcal{ T}_{i-1}$. When reaching a
+termination node, the algorithm proceeds as follows:
+
+\begin{itemize}
+\item For a previously visible node (this must be a leaf), we issue
+the occlusion query and store it in the query queue. Then we
+immediately render the associated geometry without waiting for the
+result of the query.
+ \item For a previously invisible node, we issue the query and store
+ it in the query queue.
+\end{itemize}
+
+\begin{figure}[htb]
+{\footnotesize
+  \input{code/pseudocode2}
+ }
+  \caption{Pseudo-code of coherent hierarchical culling.}
+  \label{fig:pseudocode}
+\end{figure}
+
+When the query queue is not empty, we check if the result of the
+oldest query in the queue is already available. If the query result is
+not available, we continue by recursively processing other nodes of
+the kD-tree as described above. If the query result is available, we
+fetch the result and remove the node from the query queue. If the node
+is visible, we process its children recursively. Otherwise, the whole
+subtree of the node is invisible and thus it is culled.
+
+
+In order to propagate changes in visibility upwards in the hierarchy,
+the visibility classification is \emph{pulled up} according to the
+following rule: An interior node is invisible only if all its children
+have been classified invisible. Otherwise, it remains visible and thus
+opened. The pseudo-code of the complete algorithm is given in
+Figure~\ref{fig:pseudocode}. An example of the behavior of the method
+on a small kD-tree for two subsequent frames is depicted
+Figure~\ref{fig:cut}.
+
+\begin{figure*}[htb]
+  \centerline{
+    \includegraphics[width=0.73\textwidth,draft=\DRAFTFIGS]{figs/cut} }
+  \caption{(left) Visibility classification of a node of the kD-tree and
+    the termination nodes. (right) Visibility classification after the
+    application of the occlusion test and the new set of termination nodes.
+    Nodes on which occlusion queries were applied are depicted with a
+    solid outline. Note the pull-up and pull-down due to visibility changes.}
+  \label{fig:cut}
+\end{figure*}
+
+
+
+The sets of opened nodes and termination nodes need not be maintained
+explicitly. Instead, these sets can be easily identified by
+associating with each node an information about its visibility and an
+id of the last frame when it was visited. The node is an opened node
+if it is an interior visible node that was visited in the last frame
+(line 23 in the pseudocode). Note that in the actual implementation of
+the pull up we can set all visited nodes to invisible by default and
+then pull up any changes from invisible to visible (lines 25 and line
+12 in Figure~\ref{fig:pseudocode}). This modification eliminates
+checking children for invisibility during the pull up.
+
+
+
+%% \begin{figure*}[htb]
+%% \centerline{\includegraphics[width=0.8\textwidth,draft=\DRAFTFIGS]{figs/basic}}
+%% \caption{Illustration of the hierarchy traversal. Initially the algorithm
+%% starts at the root of the hierarchy (left). In the second frame the
+%% opened nodes $\mathcal{ O}_0$ are skipped and the occlusion queries
+%% are first applied on the termination nodes $\mathcal{T}_0$. Visibility changes are propagated upwarsds in the hierarchy and a
+%% new set of termination nodes $\mathcal{ T}_1$ is established.}
+%% \label{fig:basic}
+%% \end{figure*}
+
+
+\subsection{Reduction of the number of queries}
+
+%Skipping the opened nodes and issuing occlusion queries for the
+%termination nodes assists in exploiting two main characteristics of
+%scene visibility:
+
+%Identifying the set of termination nodes assists in finding a subdivision
+
+Our method reduces the number of visibility queries in two ways:
+Firstly, as other hierarchical culling methods we consider only a
+subtree of the whole hierarchy (opened nodes + termination
+nodes). Secondly, by avoiding queries on opened nodes we eliminate
+part of the overhead of identification of this subtree. These
+reductions reflect the following coherence properties of scene
+visibility:
+
+\begin{itemize}
+
+
+\item {\em Spatial coherence.} The invisible termination nodes
+approximate the occluded part of the scene with the smallest number of
+nodes with respect to the given hierarchy, i.e., each invisible
+termination node has a visible parent. This induces an adaptive
+spatial subdivision that reflects spatial coherence of visibility,
+more precisely the coherence of occluded regions. The adaptive nature
+of the subdivision allows to minimize the number of subsequent
+occlusion queries by applying the queries on the largest spatial
+regions that are expected to remain occluded.
+
+%, and visible termination
+%nodes correspond to the smallest unoccluded regions (visible
+%leafs)
+
+\item {\em Temporal coherence.} If visibility remains constant the set
+of termination nodes needs no adaptation. If an occluded node becomes
+visible we recursively process its children (pull-down). If a visible
+node becomes occluded we propagate the change higher in the hierarchy
+(pull-up). A pull-down reflects a spatial growing of visible
+regions. Similarly, a pull-up reflects a spatial growing of occluded
+regions.
+
+
+%The first case corresponds to pull-down of the cut, the latter to pull-up.
+
+\end{itemize}
+
+By avoiding queries on the opened nodes, we can save $1/k$ of the queries
+for a hierarchy with branching factor $k$ (assuming visibility remains
+constant). Thus for the kD-tree, up to half of the queries can be
+saved. The actual savings in the total query time are even larger: the
+higher we are at the hierarchy, the larger boxes we would have to
+check for occlusion. Consequently, the higher is the fill rate that
+would have been required to rasterize the boxes. In particular,
+assuming that the sum of the screen space projected area for nodes at
+each level of the kD-tree is equal and the opened nodes form a
+complete binary subtree of depth $d$, the fill rate is reduced $(d+2)$
+times.
+
+
+
+\subsection{Reduction of CPU stalls and GPU starvation}
+
+\label{sec:latency}
+
+The reduction of CPU stalls and GPU starvation is achieved by
+interleaving occlusion queries with the rendering of visible geometry. The
+immediate rendering of previously visible termination nodes and the
+subsequent issuing of occlusion queries eliminates the requirement of
+waiting for the query result during the processing of the initial
+depth layers containing previously visible nodes. In an optimal case,
+new query results become available in between and thus we completely
+eliminate CPU stalls. In a static scenario, we achieve exactly the
+same visibility classification as the hierarchical stop-and-wait
+method.
+
+If the visibility is changing, the situation can be different: if the
+results of the queries arrive too late, it is possible that we
+initiated an occlusion query on a previously occluded node $A$ that is
+in fact occluded by another previously occluded node $B$ that became
+visible. If $B$ is still in the query queue, we do not capture a
+possible occlusion of $A$ by $B$ since the geometry associated with
+$B$ has not yet been rendered. In Section~\ref{sec:results} we show
+that the increase of the number of rendered objects compared to the
+stop-and-wait method is usually very small.
+
+%% It is possible that we have already traversed all previously
+%% visible nodes and we must stall the CPU by waiting for the result
+%% of the oldest occlusion query. A technique completely eliminating
+%% CPU stalls at the cost of an increase of the number of rendered
+%% objects will be discussed in Section~\ref{sec:full}.
+
+\subsection{Front-to-back scene traversal}
+
+For kD-trees the front-to-back scene traversal can be easily
+implemented using a depth first
+traversal~\cite{bittner01:jvca}. However, at a modest increase in
+computational cost we can also use a more general breadth-first
+traversal based on a priority queue. The priority of the node then
+corresponds to an inverse of the minimal distance of the viewpoint and
+the bounding box associated with the given node of the
+kD-tree~\cite{Klosowski:2001:ECV,Staneker:2004:OCO}.
+
+In the context of our culling algorithm, there are two main advantages
+of the breadth-first front-to-back traversal :
+
+\begin{itemize}
+\item {\em Better query scheduling.} By spreading the traversal of the
+scene in a breadth-first manner, we process the scene in depth
+layers. Within each layer, the node processing order is practically
+independent, which minimizes the problem of occlusion query
+dependence. The breadth-first traversal interleaves
+occlusion-independent nodes, which can provide a more accurate
+visibility classification if visibility changes quickly. In
+particular, it reduces the problem of false classifications due to
+missed occlusion by nodes waiting in the query queue (discussed in
+Section~\ref{sec:latency}).
+
+\item {\em Using other spatial data structures.} By using a
+breadth-first traversal, we are no longer restricted to the
+kD-tree. Instead we can use an arbitrary spatial data structure
+such as a bounding volume hierarchy, octree, grid, hierarchical grid,
+etc. Once we compute a distance from a node to the viewpoint, the
+node processing order is established by the priority queue.
+\end{itemize}
+
+ When using the priority queue, our culling algorithm can also be
+applied directly to the scene graph hierarchy, thus avoiding the
+construction of any auxiliary data structure for spatial
+partitioning. This is especially important for dynamic scenes, in
+which maintenance of a spatial classification of moving objects can be
+costly.
+
+\subsection{Checking the query result}
+
+  The presented algorithm repeatedly checks if the result of the
+ occlusion query is available before fetching any node from the
+ traversal stack (line 6 in Figure~\ref{fig:pseudocode}). Our
+ practical experiments have proven that the cost of this check is
+ negligible and thus it can used frequently without any performance
+ penalty. If the cost of this check were significantly higher, we could
+ delay asking for the query result by a time established by empirical
+ measurements for the particular hardware. This delay should also
+ reflect the size of the queried node to match the expected
+ availability of the query result as precise as possible.
+
+
+\section{Further Optimizations}
+
+\label{sec:optimizations}
+
+This section discusses a couple of optimizations of our method that
+can further improve the overall rendering performance. In contrast to
+the basic algorithm from the previous section, these optimizations
+rely on some user specified parameters that should be tuned for a
+particular scene and hardware configuration.
+
+
+\subsection{Conservative visibility testing}
+
+The first optimization addresses the reduction of the number of
+visibility tests at the cost of a possible increase in the number of
+rendered objects. This optimization is based on the idea of skipping
+some occlusion tests of visible nodes. We assume that whenever a node
+becomes visible, it remains visible for a number of frames. Within the
+given number of frames we avoid issuing occlusion queries and simply
+assume the node remains visible~\cite{bittner01:jvca}.
+
+This technique can significantly reduce the number of visibility tests
+applied on visible nodes of the hierarchy. Especially in the case of
+sparsely occluded scenes, there is a large number of visible nodes
+being tested, which does not provide any benefit since most of them
+remain visible. On the other hand, we do not immediately capture all
+changes from visibility to invisibility, and thus we may render
+objects that have already become invisible from the moment when the
+last occlusion test was issued.
+
+ In the simplest case, the number of frames a node is assumed visible
+can be a predefined constant. In a more complicated scenario this
+number should be influenced by the history of the success of occlusion
+queries and/or the current speed of camera movement.
+
+
+ \subsection{Approximate visibility}
+
+ The algorithm as presented computes a conservative visibility
+classification with respect to the resolution of the z-buffer. We
+can easily modify the algorithm to cull nodes more aggressively in
+cases when a small part of the node is visible. We compare the
+number of visible pixels returned by the occlusion query with a
+user specified constant and cull the node if this number drops
+below this constant.
+
+
+\subsection{Complete elimination of CPU stalls}
+
+\label{sec:full}
+
+ The basic algorithm eliminates CPU stalls unless the traversal stack
+is empty. If there is no node to traverse in the traversal stack and
+the result of the oldest query in the query queue is still not
+available, it stalls the CPU by waiting for the query result. To
+completely eliminate the CPU stalls, we can speculatively render some
+nodes with undecided visibility. In particular, we select a node from
+the query queue and render the geometry associated with the node (or
+the whole subtree if it is an interior node). The node is marked as
+rendered but the associated occlusion query is kept in the queue to
+fetch its result later. If we are unlucky and the node remains
+invisible, the effort of rendering the node's geometry is wasted. On
+the other hand, if the node has become visible, we have used the time
+slot before the next query arrives in an optimal manner.
+
+To avoid the problem of spending more time on rendering invisible
+nodes than would be spent by waiting for the result of the query, we
+select a node with the lowest estimated rendering cost and compare
+this cost with a user specified constant. If the cost is larger than
+the constant we conclude that it is too risky to render the node and
+wait till the result of the query becomes available.
+
+\section{Results}
+\label{sec:results}
+
+We have incorporated our method into an OpenGL-based scene graph
+library and tested it on three scenes of different types. All tests
+were conducted on a PC with a 3.2GHz P4, 1GB of memory, and a
+GeForce FX5950 graphics card.
+
+\subsection{Test scenes}
+
+The three test scenes comprise a synthetic arrangement of 5000
+randomly positioned teapots (11.6M polygons); an urban environment (1M
+polygons); and the UNC power plant model (13M polygons). The test
+scenes are depicted in Figure~\ref{fig:scenes}. All scenes were
+partitioned using a kD-tree constructed according to the surface-area
+heuristics~\cite{MacDonald90}.
+
+
+Although the teapot scene would intuitively offer good occlusion, it
+is a complicated case to handle for occlusion culling. Firstly, the
+teapots consist of small triangles and so only the effect of fused
+occlusion due to a large number of visible triangles can bring a
+culling benefit. Secondly, there are many thin holes through which it
+is possible to see quite far into the arrangement of teapots. Thirdly,
+the arrangement is long and thin and so we can see almost
+half of the teapots along the longer side of the arrangement.
+
+%Although the teapot scene would intuitively seem to offer good
+%occlusion, it is one of the more complicated cases for occlusion
+%culling. Due to the high number of very dense objects, a very fine
+%kD-tree subdivision was necessary, which in turn leads to higher costs
+%for testing many nodes in the hierarchy. Additionally, misclassifying
+%a single teapot can lead to a significant increase in frame time due
+%to the high polygon density (2,304 polygons per teapot). There are also
+%many locations where it is possible to see very far into the block of
+%teapots. This can be seen in the kD-tree node classification which is
+%shown in the accompanying video.
+
+The complete power plant model is quite challenging even to load into memory,
+but on the other hand it offers good
+occlusion. This scene is an interesting candidate for testing not only
+due to its size, but also due to significant changes in visibility and depth complexity in
+its different parts.
+
+%as can also be seen in the
+%walkthrough. A relatively coarse subdivision of the model triangles
+%into about 4,600 nodes was sufficient to capture most occlusion
+%interdependencies.
+
+The city scene is a classical target for occlusion culling
+algorithms. Due to the urban structure consisting of buildings and
+streets, most of the model is occluded when viewed from the
+streets. Note that the scene does not contain any detailed geometry
+inside the buildings. See Figure~\ref{fig:city_vis} for a
+visualization of the visibility classification of the kD-tree nodes
+for the city scene.
+
+%that
+%could further
+
+
+
+%% However, we still included a section in the walkthrough where the
+%% viewpoint is elevated above the building roofs in order to show that
+%% the algorithm continues to work without modification, albeit at some
+%% expense. It will be an interesting topic of research to automatically
+%% recognize such situations and decrease the frequency of visibility
+%% queries or turn the occlusion culling algorithm off completely.
+
+
+
+\begin{figure}
+\centering \includegraphics[width=0.32\textwidth,draft=\DRAFTIMAGES]{images/city_vis}
+\caption{Visibility classification of the kD-tree nodes in the city scene.
+  The orange nodes were found visible, all the other depicted nodes are invisible.
+  Note the increasing size of the occluded nodes with increasing distance from the visible set.}
+\label{fig:city_vis}
+\end{figure}
+
+
+\subsection{Basic tests}
+
+
+We have measured the frame times for rendering with only view-frustum culling
+(VFC), the hierarchical stop-and-wait method (S\&W), and our new
+coherent hierarchical culling method (CHC). Additionally, we have
+evaluated the time for an ``ideal'' algorithm. The ideal algorithm
+renders the visible objects found by the S\&W algorithm without
+performing any visibility tests. This is an optimal solution with
+respect to the given hierarchy, i.e., no occlusion culling algorithm
+operating on the same hierarchy can be faster. For the basic tests we
+did not apply any of the optimizations discussed in
+Section~\ref{sec:optimizations}, which require user specified
+parameters.
+
+%% In order to obtain repeatable and comparable timings, the process
+%% priority of our application was set to high, timings were obtained
+%% using the CPU cycle counter instruction, and the OpenGL {\tt Finish()}
+%% instruction was executed before each invocation of the timer at the
+%% start and the end of a frame. Furthermore, we did not include clear
+%% and buffer swapping times in our results, since they depend strongly
+%% on the windowing mode used.
+
+For each test scene, we have constructed a walkthrough which is shown
+in full in the accompanying
+video. Figures~\ref{fig:teapot_walkthrough},~\ref{fig:city_walkthrough},
+and~\ref{fig:plant_walkthrough} depict the frame times measured for
+the walkthroughs. Note that Figure~\ref{fig:plant_walkthrough} uses a
+logarithmic scale to capture the high variations in frame times during
+the power plant walkthrough.
+\begin{figure}
+\centering
+\includegraphics[width=0.5\textwidth,draft=\DRAFTFIGS]{images/teapotgraph1}
+\caption{Frame times for the teapot scene.}\label{fig:teapot_walkthrough}
+\end{figure}
+\begin{figure}
+\centering
+\includegraphics[width=0.5\textwidth,draft=\DRAFTFIGS]{images/citygraph1}
+\caption{Frame times for the city walkthrough. Note
+the spike around frame 1600, where the viewpoint was elevated above the roofs,
+practically eliminating any occlusion.}\label{fig:city_walkthrough}
+\end{figure}
+\begin{figure}
+\centering
+\includegraphics[width=0.5\textwidth,draft=\DRAFTFIGS]{images/plantgraph1log}
+\caption{Frame times for the power plant walkthrough.
+The plot shows the weakness of the S\&W method: when there is not much occlusion it becomes slower than VFC (near frame 2200).
+The CHC can keep up even in these situations and in the same time it can exploit occlusion when it appears
+(e.g. near frame 3700).}
+\label{fig:plant_walkthrough}
+\end{figure}
+To better demonstrate the behavior of our algorithm, all walkthroughs
+contain sections with both restricted and unrestricted visibility. For
+the teapots, we viewed the arrangement of teapots along the longer
+side of the arrangement (frames 25--90). In the city we elevated the
+viewpoint above the roofs and gained sight over most of the city
+(frames 1200--1800). The power plant walkthrough contains several
+viewpoints from which a large part of the model is visible (spikes in
+Figure~\ref{fig:plant_walkthrough} where all algorithms are slow),
+viewpoints along the border of the model directed outwards with low depth complexity (holes in
+Figure~\ref{fig:plant_walkthrough} where all algorithms are fast), and
+viewpoints inside the power plant with high depth complexity where occlusion culling produces a
+significant speedup over VFC (e.g. frame 3800).
+
+ As we can see for a number frames in the walkthroughs, the CHC method
+can produce a speedup of more than one order of magnitude compared to
+VFC. The maximum speedup for the teapots, the city, and the power
+plant walkthroughs is 8, 20, and 70, respectively. We can also observe
+that CHC maintains a significant gain over S\&W and in many cases it
+almost matches the performance of the ideal algorithm. In complicated
+scenarios the S\&W method caused a significant slowdown compared to
+VFC (e.g. frames 1200--1800 of
+Figure~\ref{fig:city_walkthrough}). Even in these cases, the CHC
+method maintained a good speedup over VFC except for a small number of
+frames.
+
+\begin{table*}
+\centering \footnotesize
+\begin{tabular}{|c|c|c|c|c|c|c|c|}
+ \hline\hline
+scene                  & method   & \#queries & wait time [ms] & rendered triangles & frame time [ms]  & speedup \\\hline\hline
+
+Teapots                & VFC      & ---        &  ---     & 11,139,928  & 310.42  & 1.0 \\\hhline{~|-|-|-|-|-|-|-|}
+11,520,000 triangles    & S\&W     & 4704     & 83.19  & 2,617,801  & 154.95 & 2.3 \\\hhline{~|-|-|-|-|-|-|-|}
+21,639 kD-Tree nodes   & {\bf CHC} &{\bf 2827} & {\bf 1.31}  & {\bf 2,852,514 } & {\bf 81,18 } & {\bf 4.6 } \\\hhline{~|-|-|-|-|-|-|-|}
+                       & Ideal    & ---        &  ---     & 2,617,801  & 72.19  & 5.2 \\
+                       \hline\hline
+City                   & VFC      & ---        &  ---     & 156,521    & 19.79 & 1.0   \\\hhline{~|-|-|-|-|-|-|-|}
+1,036,146 triangles    & S\&W     & 663      &  9.49  & 30,594     & 19.9  & 1.5 \\\hhline{~|-|-|-|-|-|-|-|}
+33,195 kD-Tree nodes   &{\bf CHC} & {\bf 345} & {\bf 0.18}   & {\bf 31,034}  & {\bf 8.47}  & {\bf 4.0}  \\\hhline{~|-|-|-|-|-|-|-|}
+                       & Ideal    & ---        &   ---   & 30,594     & 4.55  & 6.6  \\
+                       \hline\hline
+Power Plant            & VFC      & ---    &  ---   & 1,556,300 & 138.76 & 1.0 \\\hhline{~|-|-|-|-|-|-|-|}
+12,748,510 triangles    & S\&W    & 485   & 16.16  & 392,962  & 52.29 & 3.2 \\\hhline{~|-|-|-|-|-|-|-|}
+18,719 kD-Tree nodes    &{\bf CHC} & {\bf 263}  & {\bf 0.70}  & {\bf 397,920} & {\bf 38.73}  & {\bf 4.7} \\\hhline{~|-|-|-|-|-|-|-|}
+                       & Ideal    &    ---      &  ---   &   392,962    &  36.34  & 5.8 \\\hline\hline
+\end{tabular}
+\caption{Statistics for the three test scenes. VFC is rendering with only view-frustum culling, S\&W is the
+  hierarchical stop and wait method, CHC is our new method, and Ideal
+is a perfect method with respect to the given hierarchy. All values are averages over
+all frames (including the speedup).}
+\label{tab:averages}
+\end{table*}
+
+%VFC     S&W     CHC     Ideal
+%(01:50:59) salzrat: 1     3,243823523     4,744645293     5,765981148
+%(01:51:04) salzrat: for the powerplant
+% for the powerplant
+%(01:53:59) salzrat: 1     1,519898136     4,01897468     6,599413211
+%(01:54:01) salzrat: for the city
+%(01:55:15) salzrat: and
+%(01:55:15) salzrat: 1     2,321137905     4,646185621     5,199086993
+
+%salzrat: teapot: 1,977162565     1,128631431
+%(02:01:52) salzrat: city: 2,607396227     1,674188137
+%(02:02:59) salzrat: powerplant: 1,635036084     1,244446469
+
+
+ Next, we summarized the scene statistics and the average values per
+frame in Table~\ref{tab:averages}. The table shows the number of
+issued occlusion queries, the wait time representing the CPU stalls,
+the number of rendered triangles, the total frame time, and the
+speedup over VFC.
+
+
+We can see that the CHC method practically eliminates the CPU stalls
+(wait time) compared to the S\&W method. This is paid for by a slight
+increase in the number of rendered triangles. For the three
+walkthroughs, the CHC method produces average speedups of 4.6, 4.0, and
+4.7 over view frustum culling and average speedups of 2.0, 2.6, and
+1.6 over the S\&W method. CHC is only 1.1, 1.7, and 1.2 times
+slower than the ideal occlusion culling algorithm. Concerning the
+accuracy, the increase of the average number of rendered triangles for
+CHC method compared to S\&W was 9\%, 1.4\%, and 1.3\%. This increase
+was always recovered by the reduction of CPU stalls for the tested
+walkthroughs.
+
+%% While this number may be very low, the algorithm also incurs a
+%% non-negligible overhead which is caused by the graphics card
+%% reconfiguration required for the queries and rasterization of the
+%% bounding volume geometries.
+
+% triangles
+% 9%
+% 1.4%
+% 1.3%
+
+
+% speedup over SW
+% 1.9
+% 2.32
+% 1.33
+
+% compare to ideal
+% 1.13
+% 1.9
+% 1.05
+
+
+
+\subsection{Optimizations}
+
+First of all we have observed that the technique of complete
+elimination of CPU stalls discussed in Section~\ref{sec:full} has a
+very limited scope. In fact for all our tests the stalls were almost
+completely eliminated by the basic algorithm already (see wait time in
+Table~\ref{tab:averages}). We did not find constants that could
+produce additional speedup using this technique.
+
+The measurements for the other optimizations discussed in
+Section~\ref{sec:optimizations} are summarized in
+Table~\ref{tab:assumed}. We have measured the average number of issued queries
+and the average frame time in dependence on the number of frames a node is
+assumed visible and the pixel threshold of approximate visibility. We
+have observed that the effectiveness of the optimizations depends strongly on the scene. If
+the hierarchy is deep and the geometry associated with a leaf node is
+not too complex, the conservative visibility testing produces a
+significant speedup (city and power plant). For the teapot scene the
+penalty for false rendering of actually occluded objects became larger
+than savings achieved by the reduction of the number of queries. On the other
+hand since the teapot scene contains complex visible geometry the
+approximate visibility optimization produced a significant
+speedup. This is however paid for by introducing errors in the image
+proportional to the pixel threshold used.
+
+%Good parameters for these
+%optimizations have to be estimated on a scene-by-scene basis.
+
+
+
+
+%% , where we compare the reference frame time and
+%% number of queries already shown in the previous table to the
+%% approximate visibility optimization using a higher pixel threshold,
+%% and to the conservative visibility testing optimization assuming a
+%% node remains visible for 2 frames, both for the teapot and the city
+%% scene. These tests clearly show that a high visibility threshold
+%% improves frame times, albeit at the expense of image quality. The
+%% benefit of the conservative visibility optimization, is however
+%% limited. While the number of queries can be reduced significantly, the
+%% number of misclassified objects rises and increases the frame time
+%% again.
+
+
+
+%% \begin{table}
+%% \centering \footnotesize
+%% \begin{tabular}{|l|c|c|}
+%%  \hline\hline
+%%                 & Teapots & City \\\hline\hline
+%%  frame time CHC & 130.42  & 13.91\\\hline
+%%  \#queries      & 2267    & 94.04\\\hline\hline
+%%  \multicolumn{3}{|l|}{assume 2 frames visible}\\\hline
+%%  frame time      & 123.84 & 13.27 \\\hline
+%%  \#queries      & 1342    &  42 \\\hline\hline
+%%  \multicolumn{3}{|l|}{pixel threshold 50 pixels and assume 2 frames visible}\\\hline
+%%  frame time     & 73.22 & 11.47  \\\hline
+%%  \#queries      &  1132 &  50 \\\hline\hline
+%% \end{tabular}
+%% \caption{Influence of optimizations on two test scenes. All values are averages
+%% over all frames, frame times are in [ms].}\label{tab:assumed}
+%% \end{table}
+
+
+\begin{table}
+\centering \footnotesize
+\begin{tabular}{|l|c|c|c|c|}
+ \hline\hline
+scene                    & t$_{av}$ &  n$_{vp}$ & \#queries & frame time [ms]   \\ \hline\hline
+\multirow{3}{*}{Teapots} & 0        &    0         & 2827      & 81.18  \\ \hhline{~----}
+                         & 2       &    0         & 1769      &  86.31 \\ \hhline{~----}
+                         & 2       &    25         & 1468      & 55.90  \\ \hline\hline
+\multirow{3}{*}{City}    & 0        &    0         & 345        & 8.47  \\ \hhline{~----}
+                         & 2        &    0         & 192        & 6.70 \\ \hhline{~----}
+                         & 2       &    25         & 181       & 6.11  \\ \hline\hline
+\multirow{3}{*}{Power Plant}    & 0  &    0        & 263        & 38.73  \\ \hhline{~----}
+                         & 2        &    0         & 126        & 31.17 \\ \hhline{~----}
+                         & 2       &    25         & 120       & 36.62  \\ \hline\hline
+\end{tabular}
+
+\caption{Influence of optimizations on the CHC method.
+  $t_{av}$ is the number of assumed visibility frames for conservative
+  visibility testing, n$_{vp}$ is the pixel threshold for
+  approximate visibility.}\label{tab:assumed}
+\end{table}
+
+
+\subsection{Comparison to PVS-based rendering}
+
+ We also compared the CHC method against precalculated visibility. In
+particular, we used the PVS computed by an offline visibility
+algorithm~\cite{wonka00}. While the walkthrough using the PVS was
+1.26ms faster per frame on average, our method does not require costly
+precomputation and can be used at any general 3D position in the
+model, not only in a predefined view space.
+
+
+\section{Conclusion}
+\label{sec:conclusion}
+
+ We have presented a method for the optimized scheduling of hardware
+ accelerated occlusion queries. The method schedules occlusion queries
+ in order to minimize the number of the queries and their latency.
+ This is achieved by exploiting spatial and temporal coherence of
+ visibility. Our results show that the CPU stalls and GPU starvation
+ are almost completely eliminated at the cost of a slight increase in
+ the number of rendered objects.
+
+%Additionally it schedules the queries in an order
+%minimizing the overhead due to the latency of availability of query
+%results.
+
+ Our technique can be used with practically arbitrary scene
+ partitioning data structures such as kD-trees, bounding volume
+ hierarchies, or hierarchical grids. The implementation of the method
+ is straightforward as it uses a simple OpenGL interface to the
+ hardware occlusion queries. In particular, the method requires no
+ complicated geometrical operations or data structures. The algorithm
+ is suitable for application on scenes of arbitrary structure and it
+ requires no preprocessing or scene dependent tuning.
+
+ We have experimentally verified that the method is well suited to the
+ \nvoq{} supported on current consumer grade graphics hardware. We
+ have obtained an average speedup of 4.0--4.7 compared to pure view-frustum
+ culling and 1.6--2.6 compared to the hierarchical
+ stop-and-wait application of occlusion queries.
+
+  The major potential in improving the method is a better estimation
+ of changes in the visibility classification of hierarchy nodes. If
+ nodes tend to be mostly visible, we could automatically decrease the
+ frequency of occlusion tests and thus better adapt the method to the
+ actual occlusion in the scene. Another possibility for improvement is
+ better tuning for a particular graphics hardware by means of more
+ accurate rendering cost estimation. Skipping occlusion tests for
+ simpler geometry  can be faster than issuing comparably expensive
+ occlusion queries.
+
+
+
+\begin{figure*}[htb]
+  \centerline{
+     \hfill
+     \includegraphics[height=0.2\textwidth,draft=\DRAFTFIGS]{images/teapots}
+     \hfill
+     \includegraphics[height=0.2\textwidth,draft=\DRAFTFIGS]{images/city}
+     \hfill
+     \includegraphics[height=0.2\textwidth,draft=\DRAFTFIGS]{images/pplant}
+     \hfill
+   }
+   \caption{The test scenes: the teapots, the city, and the power plant.}
+   \label{fig:scenes}
+\end{figure*}
+
+%%  \begin{figure}[htb]
+%%    \centerline{
+%%      \includegraphics[width=0.2\textwidth,draft=\DRAFTFIGS]{images/city}
+%%   }
+%%   \caption{The the city scene.}
+%%   \label{fig:images1}
+%% \end{figure}
+
+%%  \begin{figure}[htb]
+%%    \centerline{
+%%      \includegraphics[width=0.25\textwidth,draft=\DRAFTFIGS]{images/teapots}
+%%   }
+%%   \caption{The the teapot scene.}
+%%   \label{fig:images2}
+%% \end{figure}
+
+%%  \begin{figure}[htb]
+%%    \centerline{
+%%      \includegraphics[width=0.2\textwidth,draft=\DRAFTFIGS]{images/pplant}
+%%   }
+%%   \caption{The the power plant scene.}
+%%   \label{fig:images3}
+%% \end{figure}
+
+
Index: trunk/VUT/doc/SciReport/images/makefile
===================================================================
--- trunk/VUT/doc/SciReport/images/makefile	(revision 243)
+++ trunk/VUT/doc/SciReport/images/makefile	(revision 243)
@@ -0,0 +1,103 @@
+
+PNG := $(shell ls *.png)
+
+JPG := $(shell ls *.jpg)
+
+GIF := $(shell ls *.gif)
+
+FIG := $(shell ls *.fig)
+
+OEPS := $(shell ls *.eps)
+
+EPS = ${PNG:.png=.eps} ${JPG:.jpg=.eps} ${GIF:.gif=.eps} ${FIG:.fig=.eps} 
+PDF = ${PNG:.png=.pdf} ${JPG:.jpg=.pdf} ${GIF:.gif=.pdf} ${FIG:.fig=.pdf} \
+	${OEPS:.eps=.pdf}
+
+
+DEFAULT: $(PDF) $(EPS)
+
+pdf:
+	@make $(PDF)
+
+eps:
+	@make $(EPS)
+
+
+.SUFFIXES: .fig .png .jpg .gif .eps .pdf  
+
+.fig.eps: 
+	@echo "Converting $< to $@ ..."
+	@fig2dev -L eps $< $@
+	@echo "done."
+
+# .fig.pdf: 
+# 	@echo "Converting $< to $@ ..."
+# 	@make $*.eps
+# 	@epstopdf -nogs $*.eps | \
+# 	ps2pdf -dPDFSETTINGS=/prepress \
+# 	-dAutoFilterColorImages=true \
+# 	-dEncodeColorImages=false \
+# 	- $@
+# 	@echo "done."
+
+# .png.pdf:
+# 	@echo "Converting $< to $@ ..."
+# 	@convert $< $@
+# 	@echo "done."
+
+# .jpg.pdf:
+# 	@echo "Converting $< to $@ ..."
+# 	@convert $< $@
+# 	@echo "done."
+
+# .gif.pdf:
+# 	@echo "Converting $< to $@ ..."
+# 	@convert $< $@
+# 	@echo "done."
+
+.png.eps:
+	@echo "Converting $< to $@ ..."
+#	@convert $< eps2:$@
+	@rm -f $@
+	@pngtopnm $< | pnmtops -noturn  > $@
+#-rle
+	@echo "done."
+
+.jpg.eps:
+	@echo "Converting $< to $@ ..."
+	@rm -f $@
+	@jpegtopnm $< | pnmtops -noturn  > $@
+#	@convert $< eps2:$@
+	@echo "done."
+
+.gif.eps:
+	@echo "Converting $< to $@ ..."
+#	@convert $< eps2:$@
+	@rm -f $@
+	@giftopnm $< | pnmtops -noturn  > $@
+	@echo "done."
+
+# the last rule should be used only for figs...
+.eps.pdf: 
+	@echo "Converting $< to $@ ..."
+	@epstopdf $<
+#	@epstopdf -nogs $*.eps | \
+#	ps2pdf -dPDFSETTINGS=/screen \
+#	- $@
+
+	@echo "done."
+
+
+clean:
+	rm -f $(EPS) $(PDF)
+
+#.eps.pdf:
+#	@echo "Converting $< to $@ ..."
+#	@epstopdf $<
+#	@echo "done."
+
+#.ps.pdf:
+#	@echo "Converting $< to $@ ..."
+#	@epstopdf $<
+#	@echo "done."
+
Index: trunk/VUT/doc/SciReport/is-alpha.bst
===================================================================
--- trunk/VUT/doc/SciReport/is-alpha.bst	(revision 243)
+++ trunk/VUT/doc/SciReport/is-alpha.bst	(revision 243)
@@ -0,0 +1,2020 @@
+%% =====================================================================
+%% WARNING: Do NOT edit this file.  It was produced automatically by
+%% Nelson H. F. Beebe <beebe@plot79.math.utah.edu>
+%% from file://plot79.math.utah.edu/u/sy/beebe/tex/bib/merge/xbtxbst.doc 
+%% on Wed May 15 10:36:04 MDT 1996.
+%% =====================================================================
+%%%=====================================================================
+%%% @BibTeX-style-file{
+%%%     author          = "Nelson H. F. Beebe",
+%%%     version         = "2.03",
+%%%     date            = "15 May 1996",
+%%%     time            = "10:35:51 MDT",
+%%%     filename        = "is-alpha.bst",
+%%%     address         = "Center for Scientific Computing
+%%%                        Department of Mathematics
+%%%                        University of Utah
+%%%                        Salt Lake City, UT 84112
+%%%                        USA",
+%%%     telephone       = "+1 801 581 5254",
+%%%     FAX             = "+1 801 581 4148",
+%%%     URL             = "http://www.math.utah.edu/~beebe",
+%%%     checksum        = "49675 2020 5086 41225",
+%%%     email           = "beebe@math.utah.edu (Internet)",
+%%%     codetable       = "ISO/ASCII",
+%%%     keywords        = "BibTeX, style, bibliography",
+%%%     supported       = "yes",
+%%%     docstring       = "This file is a modification of the standard
+%%%                        BibTeX btxbst.doc file, or is a .bst file
+%%%                        derived from that modification.  It contains
+%%%                        optional added support for CODEN, ISBN, ISSN,
+%%%                        LCCN, and PRICE fields, extended PAGES
+%%%                        fields, the PERIODICAL entry, and extended
+%%%                        citation label suffixing.
+%%%
+%%%                        In addition, date formatting supports a day
+%%%                        keyword, so that bibliography entries can be
+%%%                        written with
+%%%
+%%%                            day   = {23},
+%%%                            month = aug,
+%%%
+%%%                        instead of the language-dependent awkward
+%%%                        forms required by the standard styles
+%%%
+%%%                            month = {23~} # aug,
+%%%                            month = aug # {~23},
+%%%
+%%%                        These older forms are, of course, still
+%%%                        handled correctly.
+%%%
+%%%                        The UNIX C preprocessor can be used to
+%%%                        extract the standard styles, as follows:
+%%%
+%%%                            cpp -P -DPLAIN xbtxbst.doc >plain.bst
+%%%                            cpp -P -DUNSRT xbtxbst.doc >unsrt.bst
+%%%                            cpp -P -DALPHA xbtxbst.doc >alpha.bst
+%%%                            cpp -P -DABBRV xbtxbst.doc >abbrv.bst
+%%%
+%%%                        To obtain correct file header checksums, pipe
+%%%                        the output through the checksum program, e.g.
+%%%
+%%%                            cpp -P -DPLAIN xbtxbst.doc | checksum >plain.bst
+%%%
+%%%                        The accompanying UNIX Makefile automates this
+%%%                        job, and provides some extra leading comments
+%%%                        in the generated style files warning the user
+%%%                        not to modify them.
+%%%
+%%%                        Additional optional definitions are recognized
+%%%                        to provide extensions to the standard styles:
+%%%
+%%%                            -D_CODEN for CODEN output
+%%%
+%%%                            -D_ISBN for ISBN output
+%%%
+%%%                            -D_ISSN for ISSN output
+%%%
+%%%                            -D_LCCN for LCCN output
+%%%
+%%%                            -D_PRICE for price output,
+%%%
+%%%                            -D_BOOKPAGES for book, techreport, manual,
+%%%                            and thesis pages output.
+%%%
+%%%                            -D_URL to get World-Wide Web Uniform
+%%%                            Resource Locator (URL) output.
+%%%
+%%%                            -D_NUMERIC_SUFFIXES to get numeric
+%%%                            label suffixes -1, -2, ..., -26, instead of
+%%%                            letters a, b, ..., z, so as to correctly
+%%%                            handle alpha-style bibliographies with more
+%%%                            than 26 entries for a single author in one
+%%%                            year.  Change letter suffix code to switch
+%%%                            to numeric suffixes if more than 26 letters
+%%%                            are used, so that no matter which scheme is
+%%%                            selected, correct output will always be
+%%%                            obtained.
+%%%
+%%%                        The CODEN, ISBN, ISSN, LCCN, PRICE, and URL
+%%%                        values are wrapped inside macros \showCODEN{}
+%%%                        etc. that the user can provide alternate
+%%%                        definitions of to change the formatting, or
+%%%                        to suppress their output altogether.  That
+%%%                        way, output identical to that of the four
+%%%                        standard BibTeX style files can be obtained
+%%%                        with these extended files, if these macros
+%%%                        are defined to expand to empty strings.
+%%%
+%%%                        URL handling is slightly more complex,
+%%%                        because URLs can contain characters which TeX
+%%%                        must handle in verbatim mode in a typewriter
+%%%                        font, and such text cannot readily appear
+%%%                        inside nested macro arguments.  Consequently,
+%%%                        URLs are formatted in the .bbl file like
+%%%                        this:
+%%%                            \ifshowURL {\showURL \path|...|} \fi
+%%%                        where \showURL takes no argument, and
+%%%                        normally expands to the 4-character string
+%%%                        URL<space>.  The grouping braces ensure that
+%%%                        any font changes made by \showURL remain
+%%%                        localized.  Vertical bar is chosen as the
+%%%                        verbatim path delimiter, because it cannot
+%%%                        appear in URLs.  The other prohibited ISO
+%%%                        Latin 1 characters are the non-printing
+%%%                        control characters 0..31, plus those in the
+%%%                        range 128..255, plus the ten special
+%%%                        characters
+%%%
+%%%                            { } [ ] \ ^ ~ < > `
+%%%
+%%%                        See Internet RFC 1630 (June 1994) for more
+%%%                        details.  (Backquote is not even mentioned
+%%%                        there.)
+%%%
+%%%                        As an example of font changes, in LaTeX 2e
+%%%                        you might define
+%%%                            \newcommand{\showURL}{URL
+%%%                                \let \oldtt = \tt
+%%%                                \renewcommand{\tt}{\oldtt \itshape}}
+%%%                        to get URLs set in a typewriter italic font.
+%%%
+%%%                        If desired, a sed script can be used to
+%%%                        eliminate non-essential comments (this
+%%%                        reduces the file size by 2/3); a command
+%%%                        filter step like
+%%%                                sed -e '/^%$/d' -e '/^%[^%].*$/d'
+%%%                        will accomplish that job.
+%%%
+%%%                        The checksum field above contains a CRC-16
+%%%                        checksum as the first value, followed by the
+%%%                        equivalent of the standard UNIX wc (word
+%%%                        count) utility output of lines, words, and
+%%%                        characters.  This is produced by Robert
+%%%                        Solovay's checksum utility."
+%%%     }
+%%% ====================================================================
+%%% Revision history (reverse time order):
+%%%
+%%% 2.03 [15-May-1996]
+%%%      Add CODEN support, ISBN and ISSN output for Article entries,
+%%%      and ISBN output for TechReport entries (yes, these sometimes
+%%%      do have ISBNs).
+%%%
+%%%      Add wrapper macros \showXYZ{} (XYZ = CODEN, ISBN, ISSN, LCCN,
+%%%      PRICE, and URL) defined inside the thebibliography environment
+%%%      to expand to XYZ (except for PRICE) and their arguments,
+%%%      PROVIDED they are not already defined.  That way, the user can
+%%%      provide alternate definitions outside the thebibliography
+%%%      environment, for example, to suppress particular ones, or
+%%%      to alter the font used.
+%%%
+%%%      Substantially revise leading comments to better document the
+%%%      extensions.
+%%%
+%%% 2.02 [01-Apr-1996]
+%%%	 Add day keyword support with new code in format.date function.
+%%%	 Oren Patashnik will include this new keyword in standard styles
+%%%	 in BibTeX 1.0.
+%%%
+%%%	 Add new function collapse.pagerange, and use it to collapse
+%%%	 page ranges with identical initial and final numbers to a
+%%%	 single number, so that bibliography files can distinguish
+%%%	 between one-page documents, and documents missing final page
+%%%	 numbers.
+%%%
+%%% 2.01 [25-Oct-1994]
+%%%	 Add URL output support.
+%%%
+%%% 2.00 [12-Oct-1994]
+%%%	 Add support for pages in theses and manuals, treating them
+%%%	 like Book and InBook pages.
+%%%
+%%%	 Correct ISSN support: a typo caused output of ISBN instead of
+%%%	 ISSN.
+%%%
+%%%	 Wherever ISBNs are output, also output an ISSN, if one
+%%%	 exists, and vice versa.  The reason is that some periodicals
+%%%	 (e.g. The X Resource, published by O'Reilly and Associates)
+%%%	 have both ISSN and ISBN numbers, and can be purchased either
+%%%	 as journal subscriptions, or as single volumes.
+%%%
+%%%	 For InProceedings and Proceedings output, issue a warning for
+%%%	 a missing publisher: even though that field is optional, a
+%%%	 bibliographic reference without it is incomplete.
+%%%
+%%%	 Remove harmless, but unneeded, single horizontal space before
+%%%	 price output added with version 1.03.
+%%%
+%%%	 Change Proceedings and InProceedings to treat address values
+%%%	 as publisher addresses, as they are with every other document
+%%%	 type, rather than as conference addresses, which belong in
+%%%	 the title field (that is how major libraries, including OCLC
+%%%	 and Library of Congress, with nearly 60M holdings, represent
+%%%	 them).  The need for this change has been discussed with
+%%%	 BibTeX's author, Oren Patashnik, and there is a good
+%%%	 possibility that BibTeX 1.0 will contain the change
+%%%	 implemented here.  This is an INCOMPATIBLE change that will
+%%%	 produce different .bbl file formatting.  However, the TUG and
+%%%	 BibNet bibliography projects have consistently used address
+%%%	 to me publisher/organization/institution address, and so
+%%%	 already conform to the new practice.
+%%%
+%%% 1.05 [30-May-1994]
+%%%	 Add NUMERIC_SUFFIXES support.
+%%%
+%%%	 Change all preprocessor statements to put else and endif
+%%%	 labels inside C-style comments to conform to 1989 ISO/ANSI C
+%%%	 Standard.
+%%%
+%%% 1.04 [11-Nov-1993]
+%%%	 Add underscore prefix to new processor symbols to prevent
+%%%	 substitution in comments
+%%%
+%%% 1.03 [11-Oct-1993]
+%%%	 Add support for LCCN (Library of Congress Catalog Number)
+%%%	 and price fields, and make ISBN, ISSN, LCCN, and price
+%%%	 selectable by preprocessor conditionals.
+%%%
+%%% 1.02 [12-Sep-1991]
+%%%      Merge in Barbara N. Beeton's suggestion for hyphen-less
+%%%      line breaks around volume(number):page.
+%%%
+%%% 1.01 [10-Sep-1991]
+%%%      Update file comment header and use Solovay checksum program.
+%%%
+%%% 1.00 [17-Oct-1990]
+%%%      Original version merging hand-edits of is-xxx.bst files into
+%%%      this master file, xbtxbst.doc.
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
+%% BibTeX `plain' family
+%%       version 0.99b for BibTeX versions 0.99a or later, LaTeX version 2.09.
+%%       Copyright (C) 1985, all rights reserved.
+%%       Copying of this file is authorized only if either
+%%       (1) you make absolutely no changes to your copy, including name, or
+%%       (2) if you do make changes, you name it something other than
+%%       btxbst.doc, plain.bst, unsrt.bst, alpha.bst, and abbrv.bst.
+%%       This restriction helps ensure that all standard styles are identical.
+%%       The file btxbst.doc has the documentation for this style.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ENTRY
+  { address
+    author
+    booktitle
+    chapter
+
+    coden
+
+    day
+    edition
+    editor
+    howpublished
+    institution
+
+    isbn
+
+
+    issn
+
+    journal
+    key
+
+    lccn
+
+    month
+    note
+    number
+    organization
+    pages
+
+    price
+
+    publisher
+    school
+    series
+    title
+    type
+
+    URL
+
+    volume
+    year
+  }
+  {}
+
+
+  { label extra.label sort.label }
+
+
+
+
+INTEGERS { output.state before.all mid.sentence after.sentence after.block }
+
+FUNCTION {init.state.consts}
+{ #0 'before.all :=
+  #1 'mid.sentence :=
+  #2 'after.sentence :=
+  #3 'after.block :=
+}
+
+
+STRINGS { b e new.pages original.t s t }
+
+FUNCTION {output.nonnull}
+{ 's :=
+  output.state mid.sentence =
+    { ", " * write$ }
+    { output.state after.block =
+        { add.period$ write$
+          newline$
+          "\newblock " write$
+        }
+        { output.state before.all =
+            'write$
+            { add.period$ " " * write$ }
+          if$
+        }
+      if$
+      mid.sentence 'output.state :=
+    }
+  if$
+  s
+}
+
+FUNCTION {output}
+{ duplicate$ empty$
+    'pop$
+    'output.nonnull
+  if$
+}
+
+FUNCTION {output.check}
+{ 't :=
+  duplicate$ empty$
+    { pop$ "empty " t * " in " * cite$ * warning$ }
+    'output.nonnull
+  if$
+}
+
+FUNCTION {output.bibitem}
+{ newline$
+
+  "\bibitem[" write$
+  label write$
+  "]{" write$
+
+  cite$ write$
+  "}" write$
+  newline$
+  ""
+  before.all 'output.state :=
+}
+
+
+FUNCTION {fin.entry}
+{ add.period$
+  write$
+  newline$
+}
+
+FUNCTION {new.block}
+{ output.state before.all =
+    'skip$
+    { after.block 'output.state := }
+  if$
+}
+
+FUNCTION {new.sentence}
+{ output.state after.block =
+    'skip$
+    { output.state before.all =
+        'skip$
+        { after.sentence 'output.state := }
+      if$
+    }
+  if$
+}
+
+
+FUNCTION {not}
+{   { #0 }
+    { #1 }
+  if$
+}
+
+FUNCTION {and}
+{   'skip$
+    { pop$ #0 }
+  if$
+}
+
+FUNCTION {or}
+{   { pop$ #1 }
+    'skip$
+  if$
+}
+
+
+FUNCTION {new.block.checka}
+{ empty$
+    'skip$
+    'new.block
+  if$
+}
+
+FUNCTION {new.block.checkb}
+{ empty$
+  swap$ empty$
+  and
+    'skip$
+    'new.block
+  if$
+}
+
+
+FUNCTION {new.sentence.checka}
+{ empty$
+    'skip$
+    'new.sentence
+  if$
+}
+
+FUNCTION {new.sentence.checkb}
+{ empty$
+  swap$ empty$
+  and
+    'skip$
+    'new.sentence
+  if$
+}
+
+
+FUNCTION {field.or.null}
+{ duplicate$ empty$
+    { pop$ "" }
+    'skip$
+  if$
+}
+
+FUNCTION {emphasize}
+{ duplicate$ empty$
+    { pop$ "" }
+    { "{\em " swap$ * "}" * }
+  if$
+}
+
+INTEGERS { nameptr namesleft numnames }
+
+FUNCTION {format.names}
+{ 's :=
+  #1 'nameptr :=
+  s num.names$ 'numnames :=
+  numnames 'namesleft :=
+    { namesleft #0 > }
+
+    { s nameptr "{ff~}{vv~}{ll}{, jj}" format.name$ 't :=
+
+      nameptr #1 >
+        { namesleft #1 >
+            { ", " * t * }
+            { numnames #2 >
+                { "," * }
+                'skip$
+              if$
+              t "others" =
+                { " et~al." * }
+                { " and " * t * }
+              if$
+            }
+          if$
+        }
+        't
+      if$
+      nameptr #1 + 'nameptr :=
+      namesleft #1 - 'namesleft :=
+    }
+  while$
+}
+
+FUNCTION {format.authors}
+{ author empty$
+    { "" }
+    { author format.names }
+  if$
+}
+
+
+FUNCTION {format.coden}
+{ coden empty$
+    { "" }
+    { new.block "\showCODEN{" coden * "}" *}
+  if$
+}
+
+
+FUNCTION {format.editors}
+{ editor empty$
+    { "" }
+    { editor format.names
+      editor num.names$ #1 >
+        { ", editors" * }
+        { ", editor" * }
+      if$
+    }
+  if$
+}
+
+
+FUNCTION {format.isbn}
+{ isbn empty$
+    { "" }
+    { new.block "\showISBN{" isbn * "}" *}
+  if$
+}
+
+
+
+FUNCTION {format.issn}
+{ issn empty$
+    { "" }
+    { new.block "\showISSN{" issn * "}" *}
+  if$
+}
+
+
+
+FUNCTION {format.lccn}
+{ lccn empty$
+    { "" }
+    { new.block "\showLCCN{" lccn * "}" *}
+  if$
+}
+
+
+
+FUNCTION {format.price}
+{ price empty$
+    { "" }
+    { new.block "\showPRICE{" price * "}" *}
+  if$
+}
+
+
+
+FUNCTION {format.url}
+{ url empty$
+    { "" }
+    { new.block "\ifshowURL {\showURL \path|" url * "|}\fi" *}
+  if$
+}
+
+
+
+
+FUNCTION {format.title}
+{ title empty$
+    { "" }
+
+    { title "t" change.case$ }
+
+  if$
+}
+
+
+
+FUNCTION {collapse.pagerange}
+{ 't :=				% save input page range string
+  t 'original.t :=		% save original page range
+  "" 'b :=			% beginning page number
+  "" 'e :=			% ending page number
+    { t empty$ not }		% while-loop Boolean condition
+    {				% while-loop body
+      t #1 #2 substring$ "--" =	% have we found the en-dash?
+	{
+	   t #3 global.max$ substring$ 'e :=	% yes, save ending page number
+	   "" 't := 		% and set t to empty string to terminate loop
+	}
+	{
+	   b t #1 #1 substring$ * 'b := % no, just accumulate this character
+	   t #2 global.max$ substring$ 't := % and set t to the remaining string
+	}
+      if$
+    }
+  while$			% on exit, t has ending page number string
+  e b =				% are beginning and ending numbers the same?
+    { b	}			% yes, return the beginning page number string
+    { original.t }		% no, return the original page number string
+  if$
+}
+
+
+FUNCTION {n.dashify}
+{ 't :=
+  ""
+    { t empty$ not }
+    { t #1 #1 substring$ "-" =
+        { t #1 #2 substring$ "--" = not
+            { "--" *
+              t #2 global.max$ substring$ 't :=
+            }
+            {   { t #1 #1 substring$ "-" = }
+                { "-" *
+                  t #2 global.max$ substring$ 't :=
+                }
+              while$
+            }
+          if$
+        }
+        { t #1 #1 substring$ *
+          t #2 global.max$ substring$ 't :=
+        }
+      if$
+    }
+  while$
+}
+
+
+FUNCTION {format.date}
+{ year empty$
+    { month empty$
+        {
+	  day empty$
+	    { "" }
+	    { "there's a day but no month or year in " cite$ * warning$ }
+	  if$
+	}
+        { "there's a month but no year in " cite$ * warning$
+          month
+	  day empty$
+            { }
+	    { " " * day * }
+          if$
+        }
+      if$
+    }
+    { month empty$
+	{
+	  day empty$
+	    { year }
+	    { "there's a day and year but no month in " cite$ * warning$ }
+	  if$
+	}
+        {
+          month " " *
+	  day empty$
+            { }
+	    { day * ", " * }
+          if$
+          year *
+        }
+      if$
+    }
+  if$
+}
+
+
+FUNCTION {format.btitle}
+{ title emphasize
+}
+
+
+FUNCTION {tie.or.space.connect}
+{ duplicate$ text.length$ #3 <
+    { "~" }
+    { " " }
+  if$
+  swap$ * *
+}
+
+
+FUNCTION {either.or.check}
+{ empty$
+    'pop$
+    { "can't use both " swap$ * " fields in " * cite$ * warning$ }
+  if$
+}
+
+
+FUNCTION {format.bvolume}
+{ volume empty$
+    { "" }
+    { "volume" volume tie.or.space.connect
+      series empty$
+        'skip$
+        { " of " * series emphasize * }
+      if$
+      "volume and number" number either.or.check
+    }
+  if$
+}
+
+
+FUNCTION {format.number.series}
+{ volume empty$
+    { number empty$
+        { series field.or.null }
+        { output.state mid.sentence =
+            { "number" }
+            { "Number" }
+          if$
+          number tie.or.space.connect
+          series empty$
+            { "there's a number but no series in " cite$ * warning$ }
+            { " in " * series * }
+          if$
+        }
+      if$
+    }
+    { "" }
+  if$
+}
+
+
+FUNCTION {format.edition}
+{ edition empty$
+    { "" }
+    { output.state mid.sentence =
+        { edition "l" change.case$ " edition" * }
+        { edition "t" change.case$ " edition" * }
+      if$
+    }
+  if$
+}
+
+
+INTEGERS { multiresult }
+
+FUNCTION {multi.page.check}
+{ 't :=
+  #0 'multiresult :=
+    { multiresult not
+      t empty$ not
+      and
+    }
+    { t #1 #1 substring$
+      duplicate$ "-" =
+      swap$ duplicate$ "," =
+      swap$ "+" =
+      or or
+        { #1 'multiresult := }
+        { t #2 global.max$ substring$ 't := }
+      if$
+    }
+  while$
+  multiresult
+}
+
+
+FUNCTION {format.book.pages}
+{ pages empty$
+    { "" }
+    { new.block pages " pp." * }
+  if$
+}
+
+
+
+FUNCTION {format.pages}
+{ pages empty$
+    { "" }
+    {
+      pages multi.page.check
+        { pages collapse.pagerange 'new.pages := }
+	{ pages 'new.pages := }
+      if$
+      new.pages multi.page.check
+        { "pages" new.pages n.dashify tie.or.space.connect }
+        { "page" new.pages tie.or.space.connect }
+      if$
+    }
+  if$
+}
+
+
+FUNCTION {format.vol.num.pages}
+{ volume field.or.null
+  number empty$
+    'skip$
+    { "\penalty0 (" number * ")" * *
+      volume empty$
+        { "there's a number but no volume in " cite$ * warning$ }
+        'skip$
+      if$
+    }
+  if$
+  pages empty$
+    'skip$
+    { duplicate$ empty$
+        { pop$ format.pages }
+        { ":\penalty0 " * pages collapse.pagerange n.dashify * }
+      if$
+    }
+  if$
+}
+
+
+
+FUNCTION {format.chapter.pages}
+{ chapter empty$
+    'format.pages
+    { type empty$
+        { "chapter" }
+        { type "l" change.case$ }
+      if$
+      chapter tie.or.space.connect
+      pages empty$
+        'skip$
+        { ", " * format.pages * }
+      if$
+    }
+  if$
+}
+
+
+FUNCTION {format.in.ed.booktitle}
+{ booktitle empty$
+    { "" }
+    { editor empty$
+        { "In " booktitle emphasize * }
+        { "In " format.editors * ", " * booktitle emphasize * }
+      if$
+    }
+  if$
+}
+
+
+FUNCTION {empty.misc.check}
+{ author empty$ title empty$ howpublished empty$
+  month empty$ year empty$ note empty$
+  and and and and and
+
+  key empty$ not and
+
+    { "all relevant fields are empty in " cite$ * warning$ }
+    'skip$
+  if$
+}
+
+
+FUNCTION {format.thesis.type}
+{ type empty$
+    'skip$
+    { pop$
+      type "t" change.case$
+    }
+  if$
+}
+
+
+FUNCTION {format.tr.number}
+{ type empty$
+    { "Technical Report" }
+    'type
+  if$
+  number empty$
+    { "t" change.case$ }
+    { number tie.or.space.connect }
+  if$
+}
+
+
+FUNCTION {format.article.crossref}
+{ key empty$
+    { journal empty$
+        { "need key or journal for " cite$ * " to crossref " * crossref *
+          warning$
+          ""
+        }
+        { "In {\em " journal * "\/}" * }
+      if$
+    }
+    { "In " key * }
+  if$
+  " \cite{" * crossref * "}" *
+}
+
+
+FUNCTION {format.crossref.editor}
+{ editor #1 "{vv~}{ll}" format.name$
+  editor num.names$ duplicate$
+  #2 >
+    { pop$ " et~al." * }
+    { #2 <
+        'skip$
+        { editor #2 "{ff }{vv }{ll}{ jj}" format.name$ "others" =
+            { " et~al." * }
+            { " and " * editor #2 "{vv~}{ll}" format.name$ * }
+          if$
+        }
+      if$
+    }
+  if$
+}
+
+
+FUNCTION {format.book.crossref}
+{ volume empty$
+    { "empty volume in " cite$ * "'s crossref of " * crossref * warning$
+      "In "
+    }
+    { "Volume" volume tie.or.space.connect
+      " of " *
+    }
+  if$
+  editor empty$
+  editor field.or.null author field.or.null =
+  or
+    { key empty$
+        { series empty$
+            { "need editor, key, or series for " cite$ * " to crossref " *
+              crossref * warning$
+              "" *
+            }
+            { "{\em " * series * "\/}" * }
+          if$
+        }
+        { key * }
+      if$
+    }
+    { format.crossref.editor * }
+  if$
+  " \cite{" * crossref * "}" *
+}
+
+
+FUNCTION {format.incoll.inproc.crossref}
+{ editor empty$
+  editor field.or.null author field.or.null =
+  or
+    { key empty$
+        { booktitle empty$
+            { "need editor, key, or booktitle for " cite$ * " to crossref " *
+              crossref * warning$
+              ""
+            }
+            { "In {\em " booktitle * "\/}" * }
+          if$
+        }
+        { "In " key * }
+      if$
+    }
+    { "In " format.crossref.editor * }
+  if$
+  " \cite{" * crossref * "}" *
+}
+
+
+FUNCTION {article}
+{ output.bibitem
+  format.authors "author" output.check
+  new.block
+  format.title "title" output.check
+  new.block
+  crossref missing$
+    { journal emphasize "journal" output.check
+      format.vol.num.pages output
+      format.date "year" output.check
+    }
+    { format.article.crossref output.nonnull
+      format.pages output
+    }
+  if$
+
+  format.coden output
+
+
+  format.isbn output
+
+
+  format.issn output
+
+
+  format.url output
+
+  new.block
+  note output
+  fin.entry
+}
+
+FUNCTION {book}
+{ output.bibitem
+  author empty$
+    { format.editors "author and editor" output.check }
+    { format.authors output.nonnull
+      crossref missing$
+        { "author and editor" editor either.or.check }
+        'skip$
+      if$
+    }
+  if$
+  new.block
+  format.btitle "title" output.check
+  crossref missing$
+    { format.bvolume output
+      new.block
+      format.number.series output
+      new.sentence
+      publisher "publisher" output.check
+      address output
+    }
+    { new.block
+      format.book.crossref output.nonnull
+    }
+  if$
+  format.edition output
+  format.date "year" output.check
+
+  format.coden output
+
+
+  format.isbn output
+
+
+  format.issn output
+
+
+  format.book.pages output
+
+
+  format.lccn output
+
+
+  format.price output
+
+
+  format.url output
+
+  new.block
+  note output
+  fin.entry
+}
+
+
+FUNCTION {booklet}
+{ output.bibitem
+  format.authors output
+  new.block
+  format.title "title" output.check
+  howpublished address new.block.checkb
+  howpublished output
+  address output
+  format.date output
+
+  format.coden output
+
+
+  format.isbn output
+
+
+  format.issn output
+
+
+  format.book.pages output
+
+
+  format.lccn output
+
+
+  format.price output
+
+
+  format.url output
+
+  new.block
+  note output
+  fin.entry
+}
+
+
+
+FUNCTION {inbook}
+{ output.bibitem
+  author empty$
+    { format.editors "author and editor" output.check }
+    { format.authors output.nonnull
+      crossref missing$
+        { "author and editor" editor either.or.check }
+        'skip$
+      if$
+    }
+  if$
+  new.block
+  format.btitle "title" output.check
+  crossref missing$
+    { format.bvolume output
+      format.chapter.pages "chapter and pages" output.check
+      new.block
+      format.number.series output
+      new.sentence
+      publisher "publisher" output.check
+      address output
+    }
+    { format.chapter.pages "chapter and pages" output.check
+      new.block
+      format.book.crossref output.nonnull
+    }
+  if$
+  format.edition output
+  format.date "year" output.check
+
+  format.coden output
+
+
+  format.isbn output
+
+
+  format.issn output
+
+
+  format.lccn output
+
+
+  format.price output
+
+
+  format.url output
+
+  new.block
+  note output
+  fin.entry
+}
+
+
+FUNCTION {incollection}
+{ output.bibitem
+  format.authors "author" output.check
+  new.block
+  format.title "title" output.check
+  new.block
+  crossref missing$
+    { format.in.ed.booktitle "booktitle" output.check
+      format.bvolume output
+      format.number.series output
+      format.chapter.pages output
+      new.sentence
+      publisher "publisher" output.check
+      address output
+      format.edition output
+      format.date "year" output.check
+    }
+    { format.incoll.inproc.crossref output.nonnull
+      format.chapter.pages output
+    }
+  if$
+
+  format.coden output
+
+
+  format.isbn output
+
+
+  format.issn output
+
+
+  format.lccn output
+
+
+  format.price output
+
+
+  format.url output
+
+  new.block
+  note output
+  fin.entry
+}
+
+
+FUNCTION {inproceedings}
+{ output.bibitem
+  format.authors "author" output.check
+  new.block
+  format.title "title" output.check
+  new.block
+  crossref missing$
+    { format.in.ed.booktitle "booktitle" output.check
+      format.bvolume output
+      format.number.series output
+      format.pages output
+      address empty$
+        { organization publisher new.sentence.checkb
+          organization output
+          publisher "publisher" output.check
+          format.date "year" output.check
+        }
+        { new.sentence
+          organization output
+          publisher "publisher" output.check
+          address output.nonnull
+          format.date "year" output.check
+        }
+      if$
+    }
+    { format.incoll.inproc.crossref output.nonnull
+      format.pages output
+    }
+  if$
+
+  format.coden output
+
+
+  format.isbn output
+
+
+  format.issn output
+
+
+  format.lccn output
+
+
+  format.price output
+
+
+  format.url output
+
+  new.block
+  note output
+  fin.entry
+}
+
+
+FUNCTION {conference} { inproceedings }
+
+
+FUNCTION {manual}
+{ output.bibitem
+  author empty$
+    { organization empty$
+        'skip$
+        { organization output.nonnull
+          address output
+        }
+      if$
+    }
+    { format.authors output.nonnull }
+  if$
+  new.block
+  format.btitle "title" output.check
+  author empty$
+    { organization empty$
+        { address new.block.checka
+          address output
+        }
+        'skip$
+      if$
+    }
+    { organization address new.block.checkb
+      organization output
+      address output
+    }
+  if$
+  format.edition output
+  format.date output
+
+  format.book.pages output
+
+
+  format.price output
+
+
+  format.url output
+
+  new.block
+  note output
+  fin.entry
+}
+
+
+FUNCTION {mastersthesis}
+{ output.bibitem
+  format.authors "author" output.check
+  new.block
+  format.title "title" output.check
+  new.block
+  "Master's thesis" format.thesis.type output.nonnull
+  school "school" output.check
+  address output
+  format.date "year" output.check
+
+  format.book.pages output
+
+
+  format.url output
+
+  new.block
+  note output
+  fin.entry
+}
+
+
+FUNCTION {misc}
+{ output.bibitem
+  format.authors output
+  title howpublished new.block.checkb
+  format.title output
+  howpublished new.block.checka
+  howpublished output
+  format.date output
+
+  format.coden output
+
+
+  format.isbn output
+
+
+  format.issn output
+
+
+  format.price output
+
+
+  format.url output
+
+  new.block
+  note output
+  fin.entry
+  empty.misc.check
+}
+
+
+FUNCTION {phdthesis}
+{ output.bibitem
+  format.authors "author" output.check
+  new.block
+  format.btitle "title" output.check
+  new.block
+  "PhD thesis" format.thesis.type output.nonnull
+  school "school" output.check
+  address output
+  format.date "year" output.check
+
+  format.book.pages output
+
+
+  format.url output
+
+  new.block
+  note output
+  fin.entry
+}
+
+
+FUNCTION {periodical}
+{ output.bibitem
+  editor empty$
+    { organization output }
+    { format.editors output.nonnull }
+  if$
+  new.block
+  title emphasize "title" output.check
+  format.vol.num.pages output
+  format.date output
+
+  format.coden output
+
+
+  format.isbn output
+
+
+  format.issn output
+
+
+  format.price output
+
+
+  format.url output
+
+  new.sentence
+  publisher output
+  address output
+  howpublished new.block.checka
+  howpublished output
+  new.block
+  note output
+  fin.entry
+}
+
+
+FUNCTION {proceedings}
+{ output.bibitem
+  editor empty$
+    { organization output }
+    { format.editors output.nonnull }
+  if$
+  new.block
+  format.btitle "title" output.check
+  format.bvolume output
+  format.number.series output
+  address empty$
+    { editor empty$
+        { publisher new.sentence.checka }
+        { organization publisher new.sentence.checkb
+          organization output
+        }
+      if$
+      publisher "publisher" output.check %%% <- new check for missing
+      format.date "year" output.check
+    }
+    { new.sentence
+      editor empty$
+        'skip$
+        { organization output }
+      if$
+      publisher "publisher" output.check
+      address output.nonnull
+      format.date "year" output.check
+    }
+  if$
+
+  format.coden output
+
+
+  format.isbn output
+
+
+  format.issn output
+
+
+  format.lccn output
+
+
+  format.price output
+
+
+  format.url output
+
+  new.block
+  note output
+  fin.entry
+}
+
+
+FUNCTION {techreport}
+{ output.bibitem
+  format.authors "author" output.check
+  new.block
+  format.title "title" output.check
+  new.block
+  format.tr.number output.nonnull
+  institution "institution" output.check
+  address output
+  format.date "year" output.check
+
+  format.isbn output		% NB: TechReports occasionally have ISBNs
+
+
+  format.book.pages output
+
+
+  format.price output
+
+
+  format.url output
+
+  new.block
+  note output
+  fin.entry
+}
+
+
+FUNCTION {unpublished}
+{ output.bibitem
+  format.authors "author" output.check
+  new.block
+  format.title "title" output.check
+  new.block
+  note "note" output.check
+  format.date output
+
+  format.url output
+
+  fin.entry
+}
+
+
+FUNCTION {default.type} { misc }
+
+
+
+
+MACRO {jan} {"January"}
+
+MACRO {feb} {"February"}
+
+MACRO {mar} {"March"}
+
+MACRO {apr} {"April"}
+
+MACRO {may} {"May"}
+
+MACRO {jun} {"June"}
+
+MACRO {jul} {"July"}
+
+MACRO {aug} {"August"}
+
+MACRO {sep} {"September"}
+
+MACRO {oct} {"October"}
+
+MACRO {nov} {"November"}
+
+MACRO {dec} {"December"}
+
+
+
+
+
+
+MACRO {acmcs} {"ACM Computing Surveys"}
+
+MACRO {acta} {"Acta Informatica"}
+
+MACRO {cacm} {"Communications of the ACM"}
+
+MACRO {ibmjrd} {"IBM Journal of Research and Development"}
+
+MACRO {ibmsj} {"IBM Systems Journal"}
+
+MACRO {ieeese} {"IEEE Transactions on Software Engineering"}
+
+MACRO {ieeetc} {"IEEE Transactions on Computers"}
+
+MACRO {ieeetcad}
+ {"IEEE Transactions on Computer-Aided Design of Integrated Circuits"}
+
+MACRO {ipl} {"Information Processing Letters"}
+
+MACRO {jacm} {"Journal of the ACM"}
+
+MACRO {jcss} {"Journal of Computer and System Sciences"}
+
+MACRO {scp} {"Science of Computer Programming"}
+
+MACRO {sicomp} {"SIAM Journal on Computing"}
+
+MACRO {tocs} {"ACM Transactions on Computer Systems"}
+
+MACRO {tods} {"ACM Transactions on Database Systems"}
+
+MACRO {tog} {"ACM Transactions on Graphics"}
+
+MACRO {toms} {"ACM Transactions on Mathematical Software"}
+
+MACRO {toois} {"ACM Transactions on Office Information Systems"}
+
+MACRO {toplas} {"ACM Transactions on Programming Languages and Systems"}
+
+MACRO {tcs} {"Theoretical Computer Science"}
+
+
+
+
+READ
+
+
+
+
+FUNCTION {sortify}
+{ purify$
+  "l" change.case$
+}
+
+INTEGERS { len }
+
+FUNCTION {chop.word}
+{ 's :=
+  'len :=
+  s #1 len substring$ =
+    { s len #1 + global.max$ substring$ }
+    's
+  if$
+}
+
+
+
+
+
+
+INTEGERS { et.al.char.used }
+
+FUNCTION {initialize.et.al.char.used}
+{ #0 'et.al.char.used :=
+}
+
+EXECUTE {initialize.et.al.char.used}
+
+FUNCTION {format.lab.names}
+{ 's :=
+  s num.names$ 'numnames :=
+  numnames #1 >
+    { numnames #4 >
+        { #3 'namesleft := }
+        { numnames 'namesleft := }
+      if$
+      #1 'nameptr :=
+      ""
+        { namesleft #0 > }
+        { nameptr numnames =
+            { s nameptr "{ff }{vv }{ll}{ jj}" format.name$ "others" =
+                { "{\etalchar{+}}" *
+                  #1 'et.al.char.used :=
+                }
+                { s nameptr "{v{}}{l{}}" format.name$ * }
+              if$
+            }
+            { s nameptr "{v{}}{l{}}" format.name$ * }
+          if$
+          nameptr #1 + 'nameptr :=
+          namesleft #1 - 'namesleft :=
+        }
+      while$
+      numnames #4 >
+        { "{\etalchar{+}}" *
+          #1 'et.al.char.used :=
+        }
+        'skip$
+      if$
+    }
+    { s #1 "{v{}}{l{}}" format.name$
+      duplicate$ text.length$ #2 <
+        { pop$ s #1 "{ll}" format.name$ #3 text.prefix$ }
+        'skip$
+      if$
+    }
+  if$
+}
+
+FUNCTION {author.key.label}
+{ author empty$
+    { key empty$
+
+        { cite$ #1 #3 substring$ }
+
+        { key #3 text.prefix$ }
+      if$
+    }
+    { author format.lab.names }
+  if$
+}
+
+FUNCTION {author.editor.key.label}
+{ author empty$
+    { editor empty$
+        { key empty$
+
+            { cite$ #1 #3 substring$ }
+
+            { key #3 text.prefix$ }
+          if$
+        }
+        { editor format.lab.names }
+      if$
+    }
+    { author format.lab.names }
+  if$
+}
+
+FUNCTION {author.key.organization.label}
+{ author empty$
+    { key empty$
+        { organization empty$
+
+            { cite$ #1 #3 substring$ }
+
+            { "The " #4 organization chop.word #3 text.prefix$ }
+          if$
+        }
+        { key #3 text.prefix$ }
+      if$
+    }
+    { author format.lab.names }
+  if$
+}
+
+FUNCTION {editor.key.organization.label}
+{ editor empty$
+    { key empty$
+        { organization empty$
+
+            { cite$ #1 #3 substring$ }
+
+            { "The " #4 organization chop.word #3 text.prefix$ }
+          if$
+        }
+        { key #3 text.prefix$ }
+      if$
+    }
+    { editor format.lab.names }
+  if$
+}
+
+FUNCTION {calc.label}
+{ type$ "book" =
+  type$ "inbook" =
+  or
+    'author.editor.key.label
+    { type$ "proceedings" =
+        'editor.key.organization.label
+        { type$ "manual" =
+            'author.key.organization.label
+            'author.key.label
+          if$
+        }
+      if$
+    }
+  if$
+  duplicate$
+  year field.or.null purify$ #-1 #2 substring$
+  *
+  'label :=
+  year field.or.null purify$ #-1 #4 substring$
+  *
+  sortify 'sort.label :=
+}
+
+
+
+
+
+
+
+
+
+FUNCTION {sort.format.names}
+{ 's :=
+  #1 'nameptr :=
+  ""
+  s num.names$ 'numnames :=
+  numnames 'namesleft :=
+    { namesleft #0 > }
+    { nameptr #1 >
+        { "   " * }
+        'skip$
+      if$
+
+      s nameptr "{vv{ } }{ll{ }}{  ff{ }}{  jj{ }}" format.name$ 't :=
+
+      nameptr numnames = t "others" = and
+        { "et al" * }
+        { t sortify * }
+      if$
+      nameptr #1 + 'nameptr :=
+      namesleft #1 - 'namesleft :=
+    }
+  while$
+}
+
+
+FUNCTION {sort.format.title}
+{ 't :=
+  "A " #2
+    "An " #3
+      "The " #4 t chop.word
+    chop.word
+  chop.word
+  sortify
+  #1 global.max$ substring$
+}
+
+
+FUNCTION {author.sort}
+{ author empty$
+    { key empty$
+        { "to sort, need author or key in " cite$ * warning$
+          ""
+        }
+        { key sortify }
+      if$
+    }
+    { author sort.format.names }
+  if$
+}
+
+FUNCTION {author.editor.sort}
+{ author empty$
+    { editor empty$
+        { key empty$
+            { "to sort, need author, editor, or key in " cite$ * warning$
+              ""
+            }
+            { key sortify }
+          if$
+        }
+        { editor sort.format.names }
+      if$
+    }
+    { author sort.format.names }
+  if$
+}
+
+FUNCTION {author.organization.sort}
+{ author empty$
+    { organization empty$
+        { key empty$
+            { "to sort, need author, organization, or key in " cite$ * warning$
+              ""
+            }
+            { key sortify }
+          if$
+        }
+        { "The " #4 organization chop.word sortify }
+      if$
+    }
+    { author sort.format.names }
+  if$
+}
+
+FUNCTION {editor.organization.sort}
+{ editor empty$
+    { organization empty$
+        { key empty$
+            { "to sort, need editor, organization, or key in " cite$ * warning$
+              ""
+            }
+            { key sortify }
+          if$
+        }
+        { "The " #4 organization chop.word sortify }
+      if$
+    }
+    { editor sort.format.names }
+  if$
+}
+
+
+FUNCTION {presort}
+
+{ calc.label
+  sort.label
+  "    "
+  *
+  type$ "book" =
+
+  type$ "inbook" =
+  or
+    'author.editor.sort
+    { type$ "proceedings" =
+        'editor.organization.sort
+        { type$ "manual" =
+            'author.organization.sort
+            'author.sort
+          if$
+        }
+      if$
+    }
+  if$
+
+  *
+
+  "    "
+  *
+  year field.or.null sortify
+  *
+  "    "
+  *
+  title field.or.null
+  sort.format.title
+  *
+  #1 entry.max$ substring$
+  'sort.key$ :=
+}
+
+ITERATE {presort}
+
+
+SORT
+
+
+
+
+
+
+
+
+STRINGS { longest.label last.sort.label next.extra }
+
+INTEGERS { longest.label.width last.extra.num }
+
+FUNCTION {initialize.longest.label}
+{ "" 'longest.label :=
+  #0 int.to.chr$ 'last.sort.label :=
+  "" 'next.extra :=
+  #0 'longest.label.width :=
+  #0 'last.extra.num :=
+}
+
+FUNCTION {forward.pass}
+{ last.sort.label sort.label =
+    { last.extra.num #1 + 'last.extra.num :=
+
+      last.extra.num "z" chr.to.int$ >
+
+	% Generate -1, -2, ... suffixes
+	{ "-" last.extra.num "a" chr.to.int$ - #1 + int.to.str$ * 'extra.label := }
+	% Generate a, b, ..., z suffixes
+        { last.extra.num int.to.chr$ 'extra.label := }
+      if$
+    }
+    { "a" chr.to.int$ 'last.extra.num :=
+      "" 'extra.label :=
+      sort.label 'last.sort.label :=
+    }
+  if$
+}
+
+FUNCTION {reverse.pass}
+{
+
+  next.extra "b" =
+    { "a" 'extra.label := }
+    'skip$
+  if$
+
+  label extra.label * 'label :=
+  label width$ longest.label.width >
+    { label 'longest.label :=
+      label width$ 'longest.label.width :=
+    }
+    'skip$
+  if$
+  extra.label 'next.extra :=
+}
+
+EXECUTE {initialize.longest.label}
+
+ITERATE {forward.pass}
+
+REVERSE {reverse.pass}
+
+
+
+
+
+
+FUNCTION {begin.bib}
+
+{ et.al.char.used
+    { "\newcommand{\etalchar}[1]{$^{#1}$}" write$ newline$ }
+    'skip$
+  if$
+  preamble$ empty$
+
+    'skip$
+    { preamble$ write$ newline$ }
+  if$
+  "\begin{thebibliography}{"  longest.label  * "}" * write$ newline$
+
+  "\ifx \showCODEN  \undefined \def \showCODEN #1{CODEN #1}  \fi" write$ newline$
+
+
+  "\ifx \showISBN   \undefined \def \showISBN  #1{ISBN #1}   \fi" write$ newline$
+
+
+  "\ifx \showISSN   \undefined \def \showISSN  #1{ISSN #1}   \fi" write$ newline$
+
+
+  "\ifx \showLCCN   \undefined \def \showLCCN  #1{LCCN #1}   \fi" write$ newline$
+
+
+  "\ifx \showPRICE  \undefined \def \showPRICE #1{#1}        \fi" write$ newline$
+
+
+  "\ifx \showURL    \undefined \def \showURL {URL }          \fi" write$ newline$
+  "\ifx \path       \undefined \input path.sty               \fi" write$ newline$
+  "\ifx \ifshowURL \undefined" write$ newline$
+  "     \newif \ifshowURL"     write$ newline$
+  "     \showURLtrue"          write$ newline$
+  "\fi" write$ newline$
+
+}
+
+EXECUTE {begin.bib}
+
+EXECUTE {init.state.consts}
+
+
+ITERATE {call.type$}
+
+
+FUNCTION {end.bib}
+{ newline$
+  "\end{thebibliography}" write$ newline$
+}
+
+EXECUTE {end.bib}
Index: trunk/VUT/doc/SciReport/rotating.sty
===================================================================
--- trunk/VUT/doc/SciReport/rotating.sty	(revision 243)
+++ trunk/VUT/doc/SciReport/rotating.sty	(revision 243)
@@ -0,0 +1,211 @@
+%%
+%% This is file `rotating.sty',
+%% generated with the docstrip utility.
+%%
+%% The original source files were:
+%%
+%% rotating.dtx  (with options: `package')
+%% Copyright (C) 1994 Sebastian Rahtz and Leonor Barroca. All
+%% rights reserved.  Permission is granted to to customize the
+%% declarations in this file to serve the needs of your installation.
+%% However, no permission is granted to distribute a modified version of
+%% this file under its original name.
+%% 
+\def\RInfo{1997/09/26, v2.13}
+%% File: rotating.dtx Copyright (C) 1995--1999
+\ProvidesPackage{rotating}[\RInfo\space Rotation package]
+\NeedsTeXFormat{LaTeX2e}
+\newif\if@rot@twoside
+\DeclareOption{clockwise}{% this is for compatibility
+ \AtBeginDocument{\setkeys{Grot}{units=360}}%
+}
+\DeclareOption{counterclockwise}{%
+ \AtBeginDocument{\setkeys{Grot}{units=-360}}%
+}
+\DeclareOption{figuresleft}{%
+  \@rot@twosidefalse
+  \def\rot@LR{0}%
+}
+\DeclareOption{figuresright}{%
+ \@rot@twosidefalse
+ \def\rot@LR{-1}%
+}
+\DeclareOption*{\PassOptionsToPackage{\CurrentOption}{graphics}}
+\ExecuteOptions{clockwise}
+\if@twoside
+  \@rot@twosidetrue
+\else
+  \@rot@twosidefalse
+\fi
+\def\rot@LR{-1}
+\ProcessOptions
+\RequirePackage{graphicx}
+\RequirePackage{ifthen}
+\def\rotdriver#1{\makeatletter\input{#1.def}\makeatother}
+\newcounter{r@tfl@t}
+\setcounter{r@tfl@t}{0}
+\def\sideways{%
+  \Grot@setangle{90}%
+  \setbox\z@\hbox\bgroup\ignorespaces}
+\def\endsideways{%
+  \unskip\egroup
+  \Grot@x\z@
+  \Grot@y\z@
+  \Grot@box
+}
+\def\turn#1{%
+  \Grot@setangle{#1}%
+  \setbox\z@\hbox\bgroup\ignorespaces}
+\def\endturn{%
+  \unskip\egroup
+  \Grot@x\z@
+  \Grot@y\z@
+  \Grot@box
+}
+\def\rotate#1{%
+  \Grot@setangle{#1}%
+  \setbox\z@\hbox\bgroup\ignorespaces}
+\def\endrotate{%
+  \unskip\egroup
+  \Grot@x\z@
+  \Grot@y\z@
+  \wd0\z@\dp0\z@\ht0\z@
+  \Grot@box
+}
+\def\turnbox#1#2{%
+  \Grot@setangle{#1}%
+  \setbox\z@\hbox{{#2}}%
+  \Grot@x\z@\Grot@y\z@
+  \wd0\z@\dp0\z@\ht0\z@
+  \Grot@box
+}
+\newsavebox\rot@float@box
+\def\@rotfloat#1{%
+  \@ifnextchar[%
+    {\@xrotfloat{#1}}%
+    {\edef\@tempa{\noexpand\@xrotfloat{#1}[\csname fps@#1\endcsname]}\@tempa}%
+}
+\def\@xrotfloat#1[#2]{%
+  \@float{#1}[#2]%
+  \begin{lrbox}\rot@float@box
+  \begin{minipage}\textheight
+ }
+\def\end@rotfloat{%
+   \end{minipage}\end{lrbox}%
+   \global\addtocounter{r@tfl@t}{1}%
+   \rot@label{RF\ther@tfl@t}%
+   \message{Adding sideways figure on }%
+   \def\R@@page{\pageref{RF\ther@tfl@t}}%
+   \wd\rot@float@box\z@
+   \ht\rot@float@box\z@
+   \dp\rot@float@box\z@
+   \vbox to \textheight{%
+    \setkeys{Grot}{units=360}%
+    \if@rot@twoside
+      \def\R@@page{\pageref{RF\ther@tfl@t}}%
+    \else
+      \let\R@@page\rot@LR
+    \fi
+    \ifthenelse{\isodd{\R@@page}}{%
+    \message{right hand page}%
+    \vfill
+    \centerline{\rotatebox{90}{\box\rot@float@box}}%
+         }{%
+    \message{left hand page}%
+    \centerline{\rotatebox{-90}{\box\rot@float@box}}%
+     \vfill
+         }%
+ }%
+   \end@float
+}
+\def\sidewaysfigure{\@rotfloat{figure}}
+\let\endsidewaysfigure\end@rotfloat
+\def\sidewaystable{\@rotfloat{table}}
+\let\endsidewaystable\end@rotfloat
+\def\@rotdblfloat{%
+  \if@twocolumn\let\reserved@a\@rotdbflt\else\let\reserved@a\@rotfloat\fi
+  \reserved@a}
+\def\@rotdbflt#1{\@ifnextchar[{\@rotxdblfloat{#1}}{\@rotxdblfloat{#1}[tp]}}
+\def\@rotxdblfloat#1[#2]{%
+  \hsize\textwidth\linewidth\textwidth
+  \@float{#1}[#2]%
+  \begin{lrbox}\rot@float@box
+  \begin{minipage}\textheight
+}
+\def\end@rotdblfloat{%
+   \end{minipage}\end{lrbox}%
+   \global\addtocounter{r@tfl@t}{1}%
+   \rot@label{RF\ther@tfl@t}%
+   \message{Adding sideways figure on }%
+   \def\R@@page{\pageref{RF\ther@tfl@t}}%
+   \@tempdima\ht\rot@float@box
+   \advance\@tempdima by \dp\rot@float@box
+\typeout{BOX wd: \the\wd\rot@float@box, ht: \the\ht\rot@float@box, dp: \the\dp\rot@float@box: so shift by .5 of \the\@tempdima}%
+   \wd\rot@float@box\z@
+   \ht\rot@float@box\z@
+   \dp\rot@float@box\z@
+   \vbox to \textheight{%
+    \setkeys{Grot}{units=360}%
+    \if@rot@twoside
+      \def\R@@page{\pageref{RF\ther@tfl@t}}%
+    \else
+      \let\R@@page\rot@LR
+    \fi
+    \ifthenelse{\isodd{\R@@page}}{%
+    \message{right hand page}%
+    \vfill
+    \hbox to\textwidth{\hfill\rotatebox{90}{\box\rot@float@box}\hfill}%
+         }{%
+    \message{left hand page}%
+    \hbox to \textwidth{\hfill\rotatebox{-90}{\box\rot@float@box}\hfill}%
+     \vfill
+         }%
+ }%
+   \end@dblfloat
+}
+\newenvironment{sidewaystable*}
+               {\@rotdblfloat{table}}
+               {\end@rotdblfloat}
+\newenvironment{sidewaysfigure*}
+               {\@rotdblfloat{figure}}
+               {\end@rotdblfloat}
+
+\long\def \r@protected@write#1#2#3{%
+      \begingroup
+       \let\therpage\relax
+       #2%
+       \let\protect\@unexpandable@protect
+       \edef\reserved@a{\write#1{#3}}%
+       \reserved@a
+      \endgroup
+      \if@nobreak\ifvmode\nobreak\fi\fi
+}
+\def\therpage{\arabic{page}}
+\def\rot@label#1{\@bsphack
+  \r@protected@write\@auxout{}%
+         {\string\newlabel{#1}{{\@currentlabel}{\therpage}}}%
+  \@esphack}
+\def\rotcaption{\refstepcounter\@captype\@dblarg{\@rotcaption\@captype}}
+\long\def\@rotcaption#1[#2]#3{%
+\addcontentsline{\csname ext@#1\endcsname}{#1}{%
+ \protect\numberline{\csname the#1\endcsname}{\ignorespaces #2}}%
+  \par
+  \begingroup
+    \@parboxrestore
+    \normalsize
+    \@makerotcaption{\csname fnum@#1\endcsname}{#3}%
+  \endgroup}
+\long\def\@makerotcaption#1#2{%
+ \setbox\@tempboxa\hbox{#1: #2}%
+ \ifdim \wd\@tempboxa > .8\vsize
+    \rotatebox{90}{%
+    \begin{minipage}{.8\textheight}#1: #2\end{minipage}%
+    }\par
+ \else%
+    \rotatebox{90}{\box\@tempboxa}%
+ \fi
+ \hspace{12pt}%
+}
+\endinput
+%%
+%% End of file `rotating.sty'.
Index: trunk/VUT/doc/SciReport/ifpdf.sty
===================================================================
--- trunk/VUT/doc/SciReport/ifpdf.sty	(revision 243)
+++ trunk/VUT/doc/SciReport/ifpdf.sty	(revision 243)
@@ -0,0 +1,8 @@
+
+\newif\ifpdf
+\ifx\pdfoutput\undefined
+\pdffalse % we are not running PDFLaTeX
+\else
+\pdfoutput=1 % we are running PDFLaTeX
+\pdftrue
+\fi
Index: trunk/VUT/doc/SciReport/figs/cut.eps
===================================================================
--- trunk/VUT/doc/SciReport/figs/cut.eps	(revision 243)
+++ trunk/VUT/doc/SciReport/figs/cut.eps	(revision 243)
@@ -0,0 +1,764 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: cut.fig
+%%Creator: fig2dev Version 3.2 Patchlevel 4
+%%CreationDate: Mon Aug 22 13:04:52 2005
+%%For: bittner@NOTES (Jiri Bittner,U-NOTES\bittner,S-1-5-21-1914904292-1436553889-1205156892-1000)
+%%BoundingBox: 0 0 979 330
+%%Magnification: 1.0000
+%%EndComments
+/$F2psDict 200 dict def
+$F2psDict begin
+$F2psDict /mtrx matrix put
+/col-1 {0 setgray} bind def
+/col0 {0.000 0.000 0.000 srgb} bind def
+/col1 {0.000 0.000 1.000 srgb} bind def
+/col2 {0.000 1.000 0.000 srgb} bind def
+/col3 {0.000 1.000 1.000 srgb} bind def
+/col4 {1.000 0.000 0.000 srgb} bind def
+/col5 {1.000 0.000 1.000 srgb} bind def
+/col6 {1.000 1.000 0.000 srgb} bind def
+/col7 {1.000 1.000 1.000 srgb} bind def
+/col8 {0.000 0.000 0.560 srgb} bind def
+/col9 {0.000 0.000 0.690 srgb} bind def
+/col10 {0.000 0.000 0.820 srgb} bind def
+/col11 {0.530 0.810 1.000 srgb} bind def
+/col12 {0.000 0.560 0.000 srgb} bind def
+/col13 {0.000 0.690 0.000 srgb} bind def
+/col14 {0.000 0.820 0.000 srgb} bind def
+/col15 {0.000 0.560 0.560 srgb} bind def
+/col16 {0.000 0.690 0.690 srgb} bind def
+/col17 {0.000 0.820 0.820 srgb} bind def
+/col18 {0.560 0.000 0.000 srgb} bind def
+/col19 {0.690 0.000 0.000 srgb} bind def
+/col20 {0.820 0.000 0.000 srgb} bind def
+/col21 {0.560 0.000 0.560 srgb} bind def
+/col22 {0.690 0.000 0.690 srgb} bind def
+/col23 {0.820 0.000 0.820 srgb} bind def
+/col24 {0.500 0.190 0.000 srgb} bind def
+/col25 {0.630 0.250 0.000 srgb} bind def
+/col26 {0.750 0.380 0.000 srgb} bind def
+/col27 {1.000 0.500 0.500 srgb} bind def
+/col28 {1.000 0.630 0.630 srgb} bind def
+/col29 {1.000 0.750 0.750 srgb} bind def
+/col30 {1.000 0.880 0.880 srgb} bind def
+/col31 {1.000 0.840 0.000 srgb} bind def
+
+end
+save
+newpath 0 330 moveto 0 0 lineto 979 0 lineto 979 330 lineto closepath clip newpath
+12.7 381.9 translate
+1 -1 scale
+
+/cp {closepath} bind def
+/ef {eofill} bind def
+/gr {grestore} bind def
+/gs {gsave} bind def
+/sa {save} bind def
+/rs {restore} bind def
+/l {lineto} bind def
+/m {moveto} bind def
+/rm {rmoveto} bind def
+/n {newpath} bind def
+/s {stroke} bind def
+/sh {show} bind def
+/slc {setlinecap} bind def
+/slj {setlinejoin} bind def
+/slw {setlinewidth} bind def
+/srgb {setrgbcolor} bind def
+/rot {rotate} bind def
+/sc {scale} bind def
+/sd {setdash} bind def
+/ff {findfont} bind def
+/sf {setfont} bind def
+/scf {scalefont} bind def
+/sw {stringwidth} bind def
+/tr {translate} bind def
+/tnt {dup dup currentrgbcolor
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add srgb}
+  bind def
+/shd {dup dup currentrgbcolor 4 -2 roll mul 4 -2 roll mul
+  4 -2 roll mul srgb} bind def
+ /DrawEllipse {
+	/endangle exch def
+	/startangle exch def
+	/yrad exch def
+	/xrad exch def
+	/y exch def
+	/x exch def
+	/savematrix mtrx currentmatrix def
+	x y tr xrad yrad sc 0 0 1 startangle endangle arc
+	closepath
+	savematrix setmatrix
+	} def
+
+/$F2psBegin {$F2psDict begin /$F2psEnteredState save def} def
+/$F2psEnd {$F2psEnteredState restore end} def
+
+$F2psBegin
+10 setmiterlimit
+0 slj 0 slc
+ 0.06000 0.06000 sc
+%
+% Fig objects follow
+%
+% 
+% here starts figure with depth 55
+/Times-Roman ff 360.00 scf sf
+2792 3750 m
+gs 1 -1 sc (V) col0 sh gr
+% Polyline
+15.000 slw
+n 14026 2733 m
+ 13651 3258 l gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+12417 1400 m
+gs 1 -1 sc (V) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+15093 3783 m
+gs 1 -1 sc (V) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+11493 3783 m
+gs 1 -1 sc (V) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+14193 2583 m
+gs 1 -1 sc (V) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+10593 2583 m
+gs 1 -1 sc (V) col0 sh gr
+% Polyline
+n 14626 2733 m
+ 15001 3258 l gs col0 s gr 
+% Polyline
+n 9676 3933 m
+ 9376 4458 l gs col0 s gr 
+% Polyline
+n 10126 3933 m
+ 10351 4458 l gs col0 s gr 
+% Polyline
+n 13201 3933 m
+ 12901 4458 l gs col0 s gr 
+% Polyline
+n 13651 3933 m
+ 13876 4458 l gs col0 s gr 
+% Polyline
+n 13801 5133 m
+ 13501 5658 l gs col0 s gr 
+% Polyline
+n 14251 5133 m
+ 14476 5658 l gs col0 s gr 
+% Polyline
+n 5325 2700 m
+ 4950 3225 l gs col0 s gr 
+% Polyline
+n 5925 2700 m
+ 6300 3225 l gs col0 s gr 
+% Polyline
+n 975 3900 m
+ 675 4425 l gs col0 s gr 
+% Polyline
+n 1425 3900 m
+ 1650 4425 l gs col0 s gr 
+% Polyline
+n 4500 3900 m
+ 4200 4425 l gs col0 s gr 
+% Polyline
+n 4950 3900 m
+ 5175 4425 l gs col0 s gr 
+% Polyline
+n 5100 5100 m
+ 4800 5625 l gs col0 s gr 
+% Polyline
+n 3600 1425 m
+ 2325 2100 l gs col0 s gr 
+% Polyline
+n 1725 2700 m
+ 1350 3225 l gs col0 s gr 
+% Polyline
+n 2325 2700 m
+ 2700 3225 l gs col0 s gr 
+% Polyline
+n 5550 5100 m
+ 5775 5625 l gs col0 s gr 
+% Polyline
+n 12301 1458 m
+ 11026 2133 l gs col0 s gr 
+% Polyline
+n 10426 2733 m
+ 10051 3258 l gs col0 s gr 
+% Polyline
+n 11026 2733 m
+ 11401 3258 l gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+1892 2550 m
+gs 1 -1 sc (V) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+3716 1367 m
+gs 1 -1 sc (V) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+1058 3750 m
+gs 1 -1 sc (V) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+5492 2550 m
+gs 1 -1 sc (V) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+409 4967 m
+gs 1 -1 sc (V) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+6392 3750 m
+gs 1 -1 sc (V) col0 sh gr
+% here ends figure;
+% 
+% here starts figure with depth 50
+% Polyline
+45.000 slw
+gs  clippath
+9960 3960 m 9840 3960 l 9840 4247 l 9900 4007 l 9960 4247 l cp
+eoclip
+n 9900 4950 m
+ 9900 3975 l gs col0 s gr gr
+
+% arrowhead
+15.000 slw
+n 9960 4247 m 9900 4007 l 9840 4247 l 9960 4247 l  cp gs 0.00 setgray ef gr  col0 s
+% Polyline
+45.000 slw
+gs  clippath
+13365 4965 m 13485 4965 l 13485 4678 l 13425 4918 l 13365 4678 l cp
+eoclip
+n 13425 4950 m
+ 13425 3975 l gs col0 s gr gr
+
+% arrowhead
+15.000 slw
+n 13365 4678 m 13425 4918 l 13485 4678 l 13365 4678 l  cp gs 0.00 setgray ef gr  col0 s
+% Polyline
+gs  clippath
+7184 2930 m 7269 3015 l 7473 2811 l 7261 2939 l 7388 2726 l cp
+eoclip
+n 7688 2512 m
+ 7238 2962 l gs col0 s gr gr
+
+% arrowhead
+n 7388 2726 m 7261 2939 l 7473 2811 l 7388 2726 l  cp gs 0.00 setgray ef gr  col0 s
+% Polyline
+gs  clippath
+9455 3015 m 9540 2930 l 9336 2726 l 9464 2939 l 9251 2811 l cp
+eoclip
+n 9037 2512 m
+ 9487 2962 l gs col0 s gr gr
+
+% arrowhead
+n 9251 2811 m 9464 2939 l 9336 2726 l 9251 2811 l  cp gs 0.00 setgray ef gr  col0 s
+% Polyline
+2 slj
+ [90] 0 sd
+n 8531 4837 m 8534 4818 l 8538 4800 l 8544 4781 l 8550 4762 l 8557 4743 l
+ 8566 4724 l 8576 4704 l 8587 4684 l 8600 4665 l 8614 4645 l
+ 8629 4625 l 8645 4606 l 8662 4587 l 8681 4568 l 8700 4550 l
+ 8720 4532 l 8741 4515 l 8763 4499 l 8785 4484 l 8808 4469 l
+ 8831 4455 l 8855 4443 l 8880 4431 l 8905 4419 l 8930 4409 l
+ 8956 4400 l 8979 4392 l 9003 4384 l 9028 4378 l 9053 4371 l
+ 9080 4365 l 9107 4359 l 9135 4354 l 9165 4349 l 9195 4344 l
+ 9226 4339 l 9257 4335 l 9290 4331 l 9323 4327 l 9356 4324 l
+ 9390 4321 l 9424 4318 l 9458 4315 l 9492 4312 l 9525 4310 l
+ 9559 4307 l 9592 4305 l 9625 4303 l 9657 4301 l 9689 4299 l
+ 9720 4297 l 9751 4295 l 9781 4293 l 9811 4291 l 9840 4289 l
+ 9869 4287 l 9899 4284 l 9930 4282 l 9960 4279 l 9991 4275 l
+ 10021 4272 l 10052 4268 l 10083 4263 l 10114 4258 l 10146 4252 l
+ 10177 4246 l 10208 4240 l 10239 4232 l 10269 4225 l 10299 4216 l
+ 10329 4207 l 10358 4198 l 10386 4187 l 10413 4176 l 10440 4165 l
+ 10465 4153 l 10489 4141 l 10512 4128 l 10535 4114 l 10556 4100 l
+ 10576 4085 l 10595 4070 l 10613 4054 l 10631 4037 l 10648 4019 l
+ 10664 4001 l 10680 3981 l 10696 3961 l 10711 3939 l 10726 3917 l
+ 10741 3893 l 10755 3869 l 10770 3844 l 10784 3818 l 10799 3791 l
+ 10813 3764 l 10828 3736 l 10842 3709 l 10856 3681 l 10870 3653 l
+ 10884 3625 l 10898 3598 l 10912 3571 l 10926 3545 l 10940 3519 l
+ 10955 3494 l 10969 3470 l 10983 3447 l 10998 3424 l 11013 3403 l
+ 11028 3382 l 11044 3362 l 11060 3343 l 11077 3324 l 11095 3306 l
+ 11113 3288 l 11133 3271 l 11153 3254 l 11175 3237 l 11198 3221 l
+ 11222 3205 l 11247 3190 l 11272 3175 l 11299 3161 l 11327 3147 l
+ 11355 3135 l 11384 3122 l 11414 3111 l 11444 3100 l 11475 3089 l
+ 11506 3080 l 11537 3071 l 11569 3063 l 11601 3056 l 11632 3049 l
+ 11664 3043 l 11696 3038 l 11728 3033 l 11761 3028 l 11794 3025 l
+ 11818 3022 l 11843 3020 l 11869 3017 l 11895 3015 l 11922 3014 l
+ 11949 3012 l 11978 3011 l 12007 3009 l 12037 3008 l 12069 3007 l
+ 12101 3006 l 12134 3006 l 12168 3005 l 12204 3005 l 12240 3005 l
+ 12277 3004 l 12315 3004 l 12354 3005 l 12394 3005 l 12434 3005 l
+ 12476 3005 l 12518 3006 l 12560 3006 l 12604 3007 l 12647 3007 l
+ 12692 3008 l 12736 3008 l 12781 3009 l 12827 3009 l 12873 3010 l
+ 12919 3010 l 12965 3011 l 13012 3011 l 13060 3011 l 13108 3012 l
+ 13156 3012 l 13206 3012 l 13256 3012 l 13298 3012 l 13341 3012 l
+ 13385 3012 l 13430 3012 l 13475 3011 l 13521 3011 l 13569 3011 l
+ 13617 3011 l 13666 3010 l 13716 3010 l 13767 3010 l 13818 3009 l
+ 13871 3009 l 13924 3009 l 13978 3009 l 14032 3009 l 14087 3009 l
+ 14142 3009 l 14197 3009 l 14253 3009 l 14308 3009 l 14364 3009 l
+ 14419 3010 l 14474 3010 l 14529 3011 l 14584 3012 l 14637 3013 l
+ 14690 3014 l 14743 3015 l 14794 3017 l 14844 3018 l 14894 3020 l
+ 14942 3022 l 14989 3024 l 15035 3026 l 15080 3028 l 15123 3031 l
+ 15166 3033 l 15206 3036 l 15246 3039 l 15284 3042 l 15321 3046 l
+ 15357 3050 l 15391 3054 l 15424 3058 l 15456 3062 l 15503 3069 l
+ 15547 3077 l 15589 3085 l 15630 3095 l 15668 3104 l 15704 3115 l
+ 15738 3126 l 15771 3138 l 15802 3151 l 15831 3164 l 15858 3178 l
+ 15883 3192 l 15906 3207 l 15928 3222 l 15947 3238 l 15965 3255 l
+ 15982 3271 l 15996 3288 l 16009 3305 l 16020 3322 l 16030 3339 l
+ 16038 3356 l 16045 3372 l 16051 3389 l 16056 3406 l 16060 3422 l
+ 16063 3439 l 16065 3455 l 16067 3471 l 16069 3487 l 16070 3509 l
+ 16070 3531 l 16070 3553 l 16069 3576 l 16068 3599 l 16065 3623 l
+ 16062 3646 l 16058 3670 l 16054 3695 l 16048 3719 l 16042 3743 l
+ 16035 3766 l 16028 3789 l 16020 3812 l 16012 3834 l 16003 3855 l
+ 15994 3875 l 15985 3894 l 15975 3912 l 15965 3929 l 15954 3946 l
+ 15944 3962 l 15935 3973 l 15927 3984 l 15918 3995 l 15908 4006 l
+ 15898 4016 l 15887 4027 l 15874 4037 l 15861 4047 l 15847 4056 l
+ 15831 4066 l 15813 4075 l 15795 4084 l 15775 4093 l 15753 4101 l
+ 15729 4109 l 15704 4116 l 15678 4124 l 15649 4130 l 15620 4136 l
+ 15588 4142 l 15555 4147 l 15520 4152 l 15484 4157 l 15446 4160 l
+ 15406 4164 l 15365 4167 l 15322 4169 l 15277 4171 l 15230 4173 l
+ 15181 4175 l 15148 4175 l 15113 4176 l 15077 4176 l 15040 4176 l
+ 15002 4176 l 14963 4176 l 14922 4176 l 14881 4176 l 14838 4175 l
+ 14793 4175 l 14748 4174 l 14701 4174 l 14653 4173 l 14604 4172 l
+ 14555 4171 l 14504 4170 l 14452 4168 l 14400 4167 l 14347 4166 l
+ 14293 4165 l 14239 4163 l 14184 4162 l 14130 4160 l 14075 4159 l
+ 14020 4157 l 13965 4156 l 13910 4154 l 13856 4153 l 13802 4151 l
+ 13748 4150 l 13695 4149 l 13643 4147 l 13591 4146 l 13541 4145 l
+ 13491 4144 l 13442 4143 l 13394 4142 l 13347 4141 l 13301 4140 l
+ 13256 4139 l 13212 4138 l 13169 4138 l 13127 4138 l 13085 4137 l
+ 13045 4137 l 13006 4137 l 12954 4137 l 12904 4137 l 12854 4138 l
+ 12806 4139 l 12758 4140 l 12711 4142 l 12665 4143 l 12620 4145 l
+ 12576 4148 l 12532 4150 l 12489 4154 l 12447 4157 l 12406 4161 l
+ 12366 4165 l 12326 4169 l 12288 4174 l 12251 4179 l 12215 4185 l
+ 12180 4191 l 12146 4197 l 12113 4203 l 12082 4210 l 12052 4217 l
+ 12023 4225 l 11996 4232 l 11970 4240 l 11944 4248 l 11920 4257 l
+ 11897 4265 l 11875 4274 l 11853 4283 l 11833 4292 l 11813 4302 l
+ 11794 4312 l 11769 4326 l 11744 4340 l 11721 4355 l 11697 4370 l
+ 11674 4387 l 11651 4404 l 11628 4422 l 11605 4441 l 11583 4461 l
+ 11561 4481 l 11540 4502 l 11519 4524 l 11498 4546 l 11478 4568 l
+ 11459 4590 l 11441 4613 l 11423 4635 l 11406 4657 l 11389 4679 l
+ 11374 4701 l 11359 4722 l 11345 4743 l 11331 4764 l 11318 4784 l
+ 11306 4805 l 11294 4825 l 11282 4844 l 11270 4864 l 11258 4884 l
+ 11246 4904 l 11234 4924 l 11221 4945 l 11208 4965 l 11194 4986 l
+ 11179 5006 l 11164 5027 l 11147 5047 l 11129 5067 l 11111 5087 l
+ 11091 5107 l 11070 5126 l 11048 5144 l 11024 5162 l 11000 5179 l
+ 10974 5195 l 10947 5211 l 10919 5225 l 10889 5239 l 10858 5252 l
+ 10826 5265 l 10792 5276 l 10756 5287 l 10729 5294 l 10700 5302 l
+ 10670 5309 l 10639 5315 l 10607 5322 l 10574 5328 l 10539 5334 l
+ 10503 5340 l 10465 5345 l 10427 5351 l 10387 5356 l 10347 5361 l
+ 10305 5366 l 10263 5370 l 10220 5374 l 10176 5378 l 10132 5382 l
+ 10088 5386 l 10044 5389 l 10000 5392 l 9956 5395 l 9912 5397 l
+ 9869 5400 l 9827 5402 l 9785 5404 l 9744 5405 l 9704 5407 l
+ 9665 5408 l 9627 5409 l 9590 5410 l 9555 5411 l 9520 5411 l
+ 9487 5411 l 9455 5412 l 9424 5412 l 9394 5412 l 9350 5412 l
+ 9309 5411 l 9269 5411 l 9230 5410 l 9193 5408 l 9157 5407 l
+ 9122 5404 l 9089 5402 l 9056 5398 l 9025 5395 l 8996 5390 l
+ 8967 5386 l 8941 5380 l 8915 5374 l 8891 5368 l 8869 5361 l
+ 8848 5353 l 8828 5345 l 8810 5337 l 8792 5328 l 8776 5319 l
+ 8760 5309 l 8745 5298 l 8731 5287 l 8717 5275 l 8703 5263 l
+ 8689 5249 l 8675 5235 l 8662 5220 l 8648 5203 l 8635 5186 l
+ 8622 5168 l 8610 5150 l 8598 5130 l 8587 5110 l 8577 5089 l
+ 8567 5068 l 8559 5047 l 8551 5025 l 8544 5003 l 8539 4982 l
+ 8534 4960 l 8531 4939 l 8529 4918 l 8528 4898 l 8528 4877 l
+ 8529 4857 l
+ cp gs col0 s gr  [] 0 sd
+% Polyline
+30.000 slw
+n 9428 3194 m 9440 3186 l 9452 3178 l 9465 3171 l 9479 3163 l 9493 3156 l
+ 9509 3149 l 9525 3143 l 9544 3136 l 9563 3130 l 9584 3123 l
+ 9607 3117 l 9631 3112 l 9656 3106 l 9683 3101 l 9712 3097 l
+ 9742 3092 l 9774 3088 l 9807 3085 l 9841 3081 l 9878 3078 l
+ 9916 3075 l 9956 3072 l 9984 3071 l 10012 3069 l 10042 3067 l
+ 10073 3066 l 10105 3064 l 10139 3063 l 10173 3062 l 10209 3061 l
+ 10247 3059 l 10285 3058 l 10324 3057 l 10365 3056 l 10406 3055 l
+ 10448 3055 l 10490 3054 l 10533 3053 l 10576 3053 l 10620 3053 l
+ 10663 3052 l 10706 3052 l 10749 3052 l 10791 3052 l 10833 3052 l
+ 10873 3053 l 10914 3053 l 10953 3054 l 10991 3054 l 11028 3055 l
+ 11064 3056 l 11099 3057 l 11132 3058 l 11165 3059 l 11197 3060 l
+ 11228 3062 l 11267 3064 l 11304 3066 l 11341 3069 l 11377 3071 l
+ 11412 3074 l 11446 3078 l 11480 3082 l 11513 3086 l 11545 3090 l
+ 11576 3095 l 11607 3100 l 11636 3106 l 11665 3112 l 11692 3119 l
+ 11719 3126 l 11744 3133 l 11768 3141 l 11791 3149 l 11813 3157 l
+ 11834 3165 l 11854 3174 l 11873 3183 l 11891 3192 l 11909 3202 l
+ 11925 3212 l 11942 3222 l 11961 3235 l 11980 3249 l 11999 3263 l
+ 12017 3278 l 12036 3295 l 12055 3312 l 12074 3330 l 12093 3348 l
+ 12112 3368 l 12130 3388 l 12149 3409 l 12167 3430 l 12184 3451 l
+ 12201 3473 l 12218 3494 l 12234 3515 l 12249 3536 l 12264 3557 l
+ 12278 3577 l 12291 3597 l 12304 3617 l 12317 3637 l 12328 3655 l
+ 12339 3673 l 12351 3691 l 12363 3710 l 12375 3729 l 12387 3748 l
+ 12400 3768 l 12414 3787 l 12428 3807 l 12444 3827 l 12460 3847 l
+ 12476 3867 l 12494 3887 l 12512 3906 l 12531 3925 l 12551 3943 l
+ 12572 3961 l 12593 3978 l 12616 3995 l 12639 4011 l 12663 4026 l
+ 12688 4041 l 12714 4055 l 12742 4069 l 12765 4080 l 12789 4090 l
+ 12814 4100 l 12841 4111 l 12869 4121 l 12898 4130 l 12928 4140 l
+ 12959 4150 l 12992 4159 l 13025 4168 l 13059 4177 l 13095 4186 l
+ 13131 4194 l 13167 4202 l 13204 4209 l 13241 4216 l 13278 4223 l
+ 13315 4229 l 13352 4235 l 13388 4240 l 13424 4244 l 13459 4248 l
+ 13493 4252 l 13527 4255 l 13559 4257 l 13591 4259 l 13622 4261 l
+ 13652 4261 l 13681 4262 l 13710 4262 l 13745 4261 l 13779 4259 l
+ 13812 4257 l 13845 4254 l 13878 4250 l 13910 4245 l 13942 4239 l
+ 13973 4233 l 14004 4225 l 14034 4217 l 14063 4208 l 14092 4198 l
+ 14119 4187 l 14146 4176 l 14171 4164 l 14195 4152 l 14217 4139 l
+ 14239 4126 l 14259 4112 l 14278 4098 l 14295 4084 l 14312 4070 l
+ 14327 4055 l 14342 4041 l 14357 4024 l 14372 4006 l 14386 3988 l
+ 14399 3969 l 14413 3949 l 14425 3929 l 14438 3907 l 14450 3885 l
+ 14461 3862 l 14473 3839 l 14484 3816 l 14494 3792 l 14504 3768 l
+ 14514 3745 l 14523 3721 l 14532 3698 l 14541 3676 l 14549 3654 l
+ 14557 3633 l 14565 3612 l 14573 3592 l 14581 3573 l 14589 3553 l
+ 14598 3533 l 14606 3514 l 14616 3494 l 14626 3475 l 14636 3455 l
+ 14647 3435 l 14659 3415 l 14672 3396 l 14686 3376 l 14700 3357 l
+ 14715 3338 l 14730 3320 l 14747 3302 l 14764 3286 l 14781 3270 l
+ 14799 3254 l 14818 3240 l 14837 3227 l 14857 3214 l 14877 3202 l
+ 14899 3190 l 14919 3180 l 14941 3171 l 14963 3161 l 14987 3152 l
+ 15012 3144 l 15038 3136 l 15065 3128 l 15093 3121 l 15122 3114 l
+ 15152 3108 l 15182 3102 l 15213 3097 l 15244 3093 l 15274 3090 l
+ 15305 3087 l 15335 3085 l 15364 3084 l 15393 3084 l 15420 3084 l
+ 15447 3085 l 15473 3087 l 15498 3090 l 15522 3093 l 15545 3097 l
+ 15568 3102 l 15590 3108 l 15612 3115 l 15633 3122 l 15654 3131 l
+ 15675 3140 l 15695 3151 l 15715 3163 l 15734 3176 l 15753 3190 l
+ 15771 3205 l 15788 3221 l 15805 3238 l 15820 3256 l 15835 3275 l
+ 15849 3294 l 15861 3314 l 15873 3335 l 15883 3356 l 15893 3377 l
+ 15901 3399 l 15908 3422 l 15915 3445 l 15921 3468 l 15926 3491 l
+ 15930 3514 l 15933 3539 l 15936 3564 l 15938 3590 l 15939 3617 l
+ 15940 3646 l 15940 3675 l 15939 3705 l 15938 3736 l 15935 3767 l
+ 15932 3799 l 15928 3831 l 15924 3863 l 15918 3896 l 15912 3928 l
+ 15905 3959 l 15898 3991 l 15890 4021 l 15881 4051 l 15872 4080 l
+ 15862 4108 l 15851 4135 l 15841 4162 l 15829 4188 l 15817 4213 l
+ 15805 4236 l 15793 4259 l 15780 4282 l 15766 4304 l 15751 4327 l
+ 15735 4349 l 15719 4372 l 15701 4394 l 15683 4417 l 15663 4440 l
+ 15643 4462 l 15622 4485 l 15600 4507 l 15578 4530 l 15554 4552 l
+ 15530 4573 l 15506 4595 l 15481 4616 l 15456 4636 l 15431 4656 l
+ 15405 4676 l 15379 4696 l 15354 4714 l 15327 4733 l 15301 4751 l
+ 15275 4769 l 15248 4787 l 15221 4804 l 15195 4821 l 15168 4837 l
+ 15141 4854 l 15114 4871 l 15085 4888 l 15056 4905 l 15026 4923 l
+ 14995 4940 l 14964 4958 l 14932 4976 l 14900 4994 l 14868 5012 l
+ 14835 5029 l 14802 5047 l 14769 5064 l 14736 5082 l 14704 5098 l
+ 14672 5115 l 14641 5131 l 14610 5146 l 14580 5161 l 14551 5175 l
+ 14523 5189 l 14496 5202 l 14469 5214 l 14444 5226 l 14420 5237 l
+ 14397 5247 l 14375 5257 l 14353 5266 l 14325 5278 l 14298 5289 l
+ 14272 5300 l 14247 5309 l 14222 5319 l 14197 5327 l 14172 5335 l
+ 14148 5342 l 14123 5348 l 14099 5354 l 14075 5360 l 14050 5365 l
+ 14026 5369 l 14002 5372 l 13978 5375 l 13953 5378 l 13929 5380 l
+ 13904 5382 l 13879 5384 l 13853 5385 l 13826 5386 l 13799 5387 l
+ 13776 5388 l 13753 5388 l 13728 5389 l 13703 5389 l 13676 5390 l
+ 13648 5390 l 13619 5390 l 13589 5390 l 13558 5391 l 13526 5390 l
+ 13492 5390 l 13459 5390 l 13424 5390 l 13390 5389 l 13355 5388 l
+ 13319 5387 l 13284 5386 l 13249 5385 l 13215 5384 l 13181 5383 l
+ 13147 5381 l 13114 5379 l 13082 5377 l 13051 5375 l 13020 5373 l
+ 12990 5371 l 12960 5368 l 12931 5366 l 12900 5362 l 12870 5359 l
+ 12839 5355 l 12809 5351 l 12778 5347 l 12748 5342 l 12717 5336 l
+ 12686 5330 l 12656 5324 l 12625 5317 l 12594 5310 l 12564 5302 l
+ 12533 5293 l 12504 5284 l 12474 5275 l 12446 5264 l 12418 5254 l
+ 12391 5243 l 12365 5232 l 12339 5220 l 12315 5208 l 12291 5195 l
+ 12268 5182 l 12246 5169 l 12224 5155 l 12203 5141 l 12182 5126 l
+ 12161 5110 l 12140 5093 l 12119 5076 l 12098 5058 l 12077 5039 l
+ 12056 5019 l 12035 4998 l 12014 4977 l 11993 4955 l 11972 4932 l
+ 11951 4910 l 11930 4887 l 11910 4863 l 11890 4840 l 11871 4817 l
+ 11852 4794 l 11834 4772 l 11816 4750 l 11799 4728 l 11783 4707 l
+ 11767 4687 l 11752 4667 l 11738 4648 l 11723 4630 l 11710 4612 l
+ 11694 4591 l 11678 4571 l 11662 4551 l 11647 4531 l 11631 4511 l
+ 11616 4492 l 11600 4473 l 11584 4454 l 11568 4436 l 11552 4418 l
+ 11536 4400 l 11521 4384 l 11505 4368 l 11490 4353 l 11475 4338 l
+ 11460 4325 l 11445 4312 l 11430 4301 l 11416 4290 l 11402 4280 l
+ 11388 4270 l 11374 4262 l 11359 4253 l 11344 4245 l 11329 4238 l
+ 11313 4231 l 11296 4224 l 11278 4218 l 11259 4212 l 11239 4206 l
+ 11217 4201 l 11195 4196 l 11172 4191 l 11148 4187 l 11123 4184 l
+ 11098 4180 l 11072 4177 l 11045 4175 l 11017 4172 l 10989 4170 l
+ 10961 4169 l 10931 4167 l 10901 4166 l 10870 4165 l 10845 4165 l
+ 10819 4164 l 10791 4164 l 10763 4163 l 10734 4163 l 10703 4163 l
+ 10672 4162 l 10639 4162 l 10606 4162 l 10572 4162 l 10537 4161 l
+ 10501 4161 l 10466 4161 l 10429 4160 l 10393 4160 l 10357 4160 l
+ 10322 4159 l 10286 4159 l 10252 4158 l 10218 4157 l 10185 4157 l
+ 10153 4156 l 10122 4155 l 10092 4154 l 10063 4152 l 10035 4151 l
+ 10007 4150 l 9981 4148 l 9948 4145 l 9917 4143 l 9886 4140 l
+ 9856 4136 l 9826 4133 l 9796 4128 l 9768 4124 l 9739 4119 l
+ 9712 4113 l 9685 4107 l 9659 4101 l 9634 4094 l 9610 4088 l
+ 9587 4080 l 9565 4073 l 9545 4065 l 9526 4057 l 9508 4049 l
+ 9491 4041 l 9475 4033 l 9460 4024 l 9445 4016 l 9428 4004 l
+ 9411 3993 l 9395 3980 l 9379 3967 l 9363 3953 l 9348 3938 l
+ 9333 3923 l 9319 3907 l 9305 3890 l 9292 3873 l 9279 3856 l
+ 9268 3840 l 9257 3823 l 9248 3807 l 9239 3791 l 9231 3775 l
+ 9223 3759 l 9217 3744 l 9209 3727 l 9203 3709 l 9197 3691 l
+ 9192 3673 l 9187 3654 l 9183 3634 l 9180 3614 l 9178 3594 l
+ 9177 3575 l 9177 3555 l 9178 3536 l 9180 3517 l 9183 3499 l
+ 9187 3481 l 9192 3464 l 9199 3448 l 9205 3433 l 9213 3418 l
+ 9221 3403 l 9230 3388 l 9241 3372 l 9253 3356 l 9265 3340 l
+ 9278 3325 l 9292 3309 l 9307 3294 l 9322 3279 l 9337 3264 l
+ 9353 3251 l 9368 3238 l 9383 3226 l 9398 3214 l 9413 3204 l
+
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+7125 1500 m
+gs 1 -1 sc (termination nodes) col0 sh gr
+% Ellipse
+15.000 slw
+n 525 4800 318 318 0 360 DrawEllipse gs col0 s gr
+
+% Ellipse
+n 1725 4800 318 318 0 360 DrawEllipse gs col7 0.80 shd ef gr gs col0 s gr
+
+% Ellipse
+n 2918 3589 318 318 0 360 DrawEllipse gs col0 s gr
+
+% Ellipse
+n 6525 3600 318 318 0 360 DrawEllipse gs col0 s gr
+
+% Ellipse
+n 4725 3600 318 318 0 360 DrawEllipse gs col7 0.80 shd ef gr gs col0 s gr
+
+% Ellipse
+n 1193 3589 318 318 0 360 DrawEllipse gs col0 s gr
+
+% Ellipse
+n 2016 2398 318 318 0 360 DrawEllipse gs col0 s gr
+
+% Ellipse
+n 3825 1200 318 318 0 360 DrawEllipse gs col0 s gr
+
+% Ellipse
+n 5616 2398 318 318 0 360 DrawEllipse gs col0 s gr
+
+% Ellipse
+n 4125 4800 318 318 0 360 DrawEllipse gs col7 0.80 shd ef gr gs col0 s gr
+
+% Ellipse
+n 5325 4800 318 318 0 360 DrawEllipse gs col7 0.80 shd ef gr gs col0 s gr
+
+% Ellipse
+n 4725 6000 318 318 0 360 DrawEllipse gs col7 0.80 shd ef gr gs col0 s gr
+
+% Ellipse
+n 5925 6000 318 318 0 360 DrawEllipse gs col7 0.80 shd ef gr gs col0 s gr
+
+% Polyline
+0 slj
+7.500 slw
+n 4050 1425 m
+ 5325 2100 l gs col0 s gr 
+% Polyline
+2 slj
+30.000 slw
+n -175 4800 m -172 4781 l -168 4763 l -162 4744 l -156 4725 l -149 4706 l
+ -140 4687 l -130 4667 l -119 4647 l -106 4628 l -92 4608 l
+ -77 4588 l -61 4569 l -44 4550 l -25 4531 l -6 4513 l
+ 14 4495 l 35 4478 l 57 4462 l 79 4447 l 102 4432 l
+ 125 4418 l 149 4406 l 174 4394 l 199 4382 l 224 4372 l
+ 250 4363 l 273 4355 l 297 4347 l 322 4341 l 347 4334 l
+ 374 4328 l 401 4322 l 429 4317 l 459 4312 l 489 4307 l
+ 520 4302 l 551 4298 l 584 4294 l 617 4290 l 650 4287 l
+ 684 4284 l 718 4281 l 752 4278 l 786 4275 l 819 4273 l
+ 853 4270 l 886 4268 l 919 4266 l 951 4264 l 983 4262 l
+ 1014 4260 l 1045 4258 l 1075 4256 l 1105 4254 l 1134 4252 l
+ 1163 4250 l 1193 4247 l 1224 4245 l 1254 4242 l 1285 4238 l
+ 1315 4235 l 1346 4231 l 1377 4226 l 1408 4221 l 1440 4215 l
+ 1471 4209 l 1502 4203 l 1533 4195 l 1563 4188 l 1593 4179 l
+ 1623 4170 l 1652 4161 l 1680 4150 l 1707 4139 l 1734 4128 l
+ 1759 4116 l 1783 4104 l 1806 4091 l 1829 4077 l 1850 4063 l
+ 1870 4048 l 1889 4033 l 1907 4017 l 1925 4000 l 1942 3982 l
+ 1958 3964 l 1974 3944 l 1990 3924 l 2005 3902 l 2020 3880 l
+ 2035 3856 l 2049 3832 l 2064 3807 l 2078 3781 l 2093 3754 l
+ 2107 3727 l 2122 3699 l 2136 3672 l 2150 3644 l 2164 3616 l
+ 2178 3588 l 2192 3561 l 2206 3534 l 2220 3508 l 2234 3482 l
+ 2249 3457 l 2263 3433 l 2277 3410 l 2292 3387 l 2307 3366 l
+ 2322 3345 l 2338 3325 l 2354 3306 l 2371 3287 l 2389 3269 l
+ 2407 3251 l 2427 3234 l 2447 3217 l 2469 3200 l 2492 3184 l
+ 2516 3168 l 2541 3153 l 2566 3138 l 2593 3124 l 2621 3110 l
+ 2649 3098 l 2678 3085 l 2708 3074 l 2738 3063 l 2769 3052 l
+ 2800 3043 l 2831 3034 l 2863 3026 l 2895 3019 l 2926 3012 l
+ 2958 3006 l 2990 3001 l 3022 2996 l 3055 2991 l 3088 2988 l
+ 3112 2985 l 3137 2983 l 3163 2980 l 3189 2978 l 3216 2977 l
+ 3243 2975 l 3272 2974 l 3301 2972 l 3331 2971 l 3363 2970 l
+ 3395 2969 l 3428 2969 l 3462 2968 l 3498 2968 l 3534 2968 l
+ 3571 2967 l 3609 2967 l 3648 2968 l 3688 2968 l 3728 2968 l
+ 3770 2968 l 3812 2969 l 3854 2969 l 3898 2970 l 3941 2970 l
+ 3986 2971 l 4030 2971 l 4075 2972 l 4121 2972 l 4167 2973 l
+ 4213 2973 l 4259 2974 l 4306 2974 l 4354 2974 l 4402 2975 l
+ 4450 2975 l 4500 2975 l 4550 2975 l 4592 2975 l 4635 2975 l
+ 4679 2975 l 4724 2975 l 4769 2974 l 4815 2974 l 4863 2974 l
+ 4911 2974 l 4960 2973 l 5010 2973 l 5061 2973 l 5112 2972 l
+ 5165 2972 l 5218 2972 l 5272 2972 l 5326 2972 l 5381 2972 l
+ 5436 2972 l 5491 2972 l 5547 2972 l 5602 2972 l 5658 2972 l
+ 5713 2973 l 5768 2973 l 5823 2974 l 5878 2975 l 5931 2976 l
+ 5984 2977 l 6037 2978 l 6088 2980 l 6138 2981 l 6188 2983 l
+ 6236 2985 l 6283 2987 l 6329 2989 l 6374 2991 l 6417 2994 l
+ 6460 2996 l 6500 2999 l 6540 3002 l 6578 3005 l 6615 3009 l
+ 6651 3013 l 6685 3017 l 6718 3021 l 6750 3025 l 6797 3032 l
+ 6841 3040 l 6883 3048 l 6924 3058 l 6962 3067 l 6998 3078 l
+ 7032 3089 l 7065 3101 l 7096 3114 l 7125 3127 l 7152 3141 l
+ 7177 3155 l 7200 3170 l 7222 3185 l 7241 3201 l 7259 3218 l
+ 7276 3234 l 7290 3251 l 7303 3268 l 7314 3285 l 7324 3302 l
+ 7332 3319 l 7339 3335 l 7345 3352 l 7350 3369 l 7354 3385 l
+ 7357 3402 l 7359 3418 l 7361 3434 l 7363 3450 l 7364 3472 l
+ 7364 3494 l 7364 3516 l 7363 3539 l 7362 3562 l 7359 3586 l
+ 7356 3609 l 7352 3633 l 7348 3658 l 7342 3682 l 7336 3706 l
+ 7329 3729 l 7322 3752 l 7314 3775 l 7306 3797 l 7297 3818 l
+ 7288 3838 l 7279 3857 l 7269 3875 l 7259 3892 l 7248 3909 l
+ 7238 3925 l 7229 3936 l 7221 3947 l 7212 3958 l 7202 3969 l
+ 7192 3979 l 7181 3990 l 7168 4000 l 7155 4010 l 7141 4019 l
+ 7125 4029 l 7107 4038 l 7089 4047 l 7069 4056 l 7047 4064 l
+ 7023 4072 l 6998 4079 l 6972 4087 l 6943 4093 l 6914 4099 l
+ 6882 4105 l 6849 4110 l 6814 4115 l 6778 4120 l 6740 4123 l
+ 6700 4127 l 6659 4130 l 6616 4132 l 6571 4134 l 6524 4136 l
+ 6475 4138 l 6442 4138 l 6407 4139 l 6371 4139 l 6334 4139 l
+ 6296 4139 l 6257 4139 l 6216 4139 l 6175 4139 l 6132 4138 l
+ 6087 4138 l 6042 4137 l 5995 4137 l 5947 4136 l 5898 4135 l
+ 5849 4134 l 5798 4133 l 5746 4131 l 5694 4130 l 5641 4129 l
+ 5587 4128 l 5533 4126 l 5478 4125 l 5424 4123 l 5369 4122 l
+ 5314 4120 l 5259 4119 l 5204 4117 l 5150 4116 l 5096 4114 l
+ 5042 4113 l 4989 4112 l 4937 4110 l 4885 4109 l 4835 4108 l
+ 4785 4107 l 4736 4106 l 4688 4105 l 4641 4104 l 4595 4103 l
+ 4550 4102 l 4506 4101 l 4463 4101 l 4421 4101 l 4379 4100 l
+ 4339 4100 l 4300 4100 l 4248 4100 l 4198 4100 l 4148 4101 l
+ 4100 4102 l 4052 4103 l 4005 4105 l 3959 4106 l 3914 4108 l
+ 3870 4111 l 3826 4113 l 3783 4117 l 3741 4120 l 3700 4124 l
+ 3660 4128 l 3620 4132 l 3582 4137 l 3545 4142 l 3509 4148 l
+ 3474 4154 l 3440 4160 l 3407 4166 l 3376 4173 l 3346 4180 l
+ 3317 4188 l 3290 4195 l 3264 4203 l 3238 4211 l 3214 4220 l
+ 3191 4228 l 3169 4237 l 3147 4246 l 3127 4255 l 3107 4265 l
+ 3088 4275 l 3063 4289 l 3038 4303 l 3015 4318 l 2991 4333 l
+ 2968 4350 l 2945 4367 l 2922 4385 l 2899 4404 l 2877 4424 l
+ 2855 4444 l 2834 4465 l 2813 4487 l 2792 4509 l 2772 4531 l
+ 2753 4553 l 2735 4576 l 2717 4598 l 2700 4620 l 2683 4642 l
+ 2668 4664 l 2653 4685 l 2639 4706 l 2625 4727 l 2612 4747 l
+ 2600 4768 l 2588 4788 l 2576 4807 l 2564 4827 l 2552 4847 l
+ 2540 4867 l 2528 4887 l 2515 4908 l 2502 4928 l 2488 4949 l
+ 2473 4969 l 2458 4990 l 2441 5010 l 2423 5030 l 2405 5050 l
+ 2385 5070 l 2364 5089 l 2342 5107 l 2318 5125 l 2294 5142 l
+ 2268 5158 l 2241 5174 l 2213 5188 l 2183 5202 l 2152 5215 l
+ 2120 5228 l 2086 5239 l 2050 5250 l 2023 5257 l 1994 5265 l
+ 1964 5272 l 1933 5278 l 1901 5285 l 1868 5291 l 1833 5297 l
+ 1797 5303 l 1759 5308 l 1721 5314 l 1681 5319 l 1641 5324 l
+ 1599 5329 l 1557 5333 l 1514 5337 l 1470 5341 l 1426 5345 l
+ 1382 5349 l 1338 5352 l 1294 5355 l 1250 5358 l 1206 5360 l
+ 1163 5363 l 1121 5365 l 1079 5367 l 1038 5368 l 998 5370 l
+ 959 5371 l 921 5372 l 884 5373 l 849 5374 l 814 5374 l
+ 781 5374 l 749 5375 l 718 5375 l 688 5375 l 644 5375 l
+ 603 5374 l 563 5374 l 524 5373 l 487 5371 l 451 5370 l
+ 416 5367 l 383 5365 l 350 5361 l 319 5358 l 290 5353 l
+ 261 5349 l 235 5343 l 209 5337 l 185 5331 l 163 5324 l
+ 142 5316 l 122 5308 l 104 5300 l 86 5291 l 70 5282 l
+ 54 5272 l 39 5261 l 25 5250 l 11 5238 l -3 5226 l
+ -17 5212 l -31 5198 l -44 5183 l -58 5166 l -71 5149 l
+ -84 5131 l -96 5113 l -108 5093 l -119 5073 l -129 5052 l
+ -139 5031 l -147 5010 l -155 4988 l -162 4966 l -167 4945 l
+ -172 4923 l -175 4902 l -177 4881 l -178 4861 l -178 4840 l
+ -177 4820 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+7575 2175 m
+gs 1 -1 sc (T) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+7725 2325 m
+gs 1 -1 sc (0) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+8775 2175 m
+gs 1 -1 sc (T) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+9000 2325 m
+gs 1 -1 sc (1) col0 sh gr
+% Ellipse
+15.000 slw
+ [90] 0 sd
+n 13426 6033 318 318 0 360 DrawEllipse gs col7 0.80 shd ef gr gs col0 s gr
+ [] 0 sd
+% Ellipse
+ [90] 0 sd
+n 14626 6033 318 318 0 360 DrawEllipse gs col7 0.80 shd ef gr gs col0 s gr
+ [] 0 sd
+% Ellipse
+ [90] 0 sd
+n 10717 2431 318 318 0 360 DrawEllipse gs col0 s gr
+ [] 0 sd
+% Ellipse
+ [90] 0 sd
+n 12526 1233 318 318 0 360 DrawEllipse gs col0 s gr
+ [] 0 sd
+% Ellipse
+ [90] 0 sd
+n 14317 2431 318 318 0 360 DrawEllipse gs col0 s gr
+ [] 0 sd
+% Ellipse
+30.000 slw
+n 9226 4833 318 318 0 360 DrawEllipse gs col7 0.80 shd ef gr gs col0 s gr
+
+% Ellipse
+n 10426 4833 318 318 0 360 DrawEllipse gs col7 0.80 shd ef gr gs col0 s gr
+
+% Ellipse
+n 12826 4833 318 318 0 360 DrawEllipse gs col0 s gr
+
+% Ellipse
+n 13426 3633 318 318 0 360 DrawEllipse gs col0 s gr
+
+% Ellipse
+n 14026 4833 318 318 0 360 DrawEllipse gs col7 0.80 shd ef gr gs col0 s gr
+
+% Ellipse
+n 15226 3633 318 318 0 360 DrawEllipse gs col0 s gr
+
+% Ellipse
+n 11619 3622 318 318 0 360 DrawEllipse gs col0 s gr
+
+% Ellipse
+15.000 slw
+ [90] 0 sd
+n 9894 3622 318 318 0 360 DrawEllipse gs col7 0.80 shd ef gr gs col0 s gr
+ [] 0 sd
+% Polyline
+0 slj
+7.500 slw
+n 12751 1458 m
+ 14026 2133 l gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+8325 4200 m
+gs 1 -1 sc (pull up) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+14175 4425 m
+gs 1 -1 sc (pull down) col0 sh gr
+% here ends figure;
+% 
+% here starts figure with depth 45
+/Times-Roman ff 360.00 scf sf
+5892 6133 m
+gs 1 -1 sc (I) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+5275 4916 m
+gs 1 -1 sc (I) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+10360 4982 m
+gs 1 -1 sc (I) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+13976 4949 m
+gs 1 -1 sc (I) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+13376 6166 m
+gs 1 -1 sc (I) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+14593 6166 m
+gs 1 -1 sc (I) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+9180 4957 m
+gs 1 -1 sc (I) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+9834 3753 m
+gs 1 -1 sc (I) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+13316 3771 m
+gs 1 -1 sc (V) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+12716 4972 m
+gs 1 -1 sc (V) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+1659 4949 m
+gs 1 -1 sc (I) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+4075 4916 m
+gs 1 -1 sc (I) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+4675 3716 m
+gs 1 -1 sc (I) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+4675 6133 m
+gs 1 -1 sc (I) col0 sh gr
+% here ends figure;
+$F2psEnd
+rs
+showpage
Index: trunk/VUT/doc/SciReport/figs/dummy.eps
===================================================================
--- trunk/VUT/doc/SciReport/figs/dummy.eps	(revision 243)
+++ trunk/VUT/doc/SciReport/figs/dummy.eps	(revision 243)
@@ -0,0 +1,105 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: dummy.fig
+%%Creator: fig2dev Version 3.2 Patchlevel 4
+%%CreationDate: Mon Aug 22 13:04:52 2005
+%%For: bittner@NOTES (Jiri Bittner,U-NOTES\bittner,S-1-5-21-1914904292-1436553889-1205156892-1000)
+%%BoundingBox: 0 0 474 443
+%%Magnification: 1.0000
+%%EndComments
+/$F2psDict 200 dict def
+$F2psDict begin
+$F2psDict /mtrx matrix put
+/col-1 {0 setgray} bind def
+/col0 {0.000 0.000 0.000 srgb} bind def
+/col1 {0.000 0.000 1.000 srgb} bind def
+/col2 {0.000 1.000 0.000 srgb} bind def
+/col3 {0.000 1.000 1.000 srgb} bind def
+/col4 {1.000 0.000 0.000 srgb} bind def
+/col5 {1.000 0.000 1.000 srgb} bind def
+/col6 {1.000 1.000 0.000 srgb} bind def
+/col7 {1.000 1.000 1.000 srgb} bind def
+/col8 {0.000 0.000 0.560 srgb} bind def
+/col9 {0.000 0.000 0.690 srgb} bind def
+/col10 {0.000 0.000 0.820 srgb} bind def
+/col11 {0.530 0.810 1.000 srgb} bind def
+/col12 {0.000 0.560 0.000 srgb} bind def
+/col13 {0.000 0.690 0.000 srgb} bind def
+/col14 {0.000 0.820 0.000 srgb} bind def
+/col15 {0.000 0.560 0.560 srgb} bind def
+/col16 {0.000 0.690 0.690 srgb} bind def
+/col17 {0.000 0.820 0.820 srgb} bind def
+/col18 {0.560 0.000 0.000 srgb} bind def
+/col19 {0.690 0.000 0.000 srgb} bind def
+/col20 {0.820 0.000 0.000 srgb} bind def
+/col21 {0.560 0.000 0.560 srgb} bind def
+/col22 {0.690 0.000 0.690 srgb} bind def
+/col23 {0.820 0.000 0.820 srgb} bind def
+/col24 {0.500 0.190 0.000 srgb} bind def
+/col25 {0.630 0.250 0.000 srgb} bind def
+/col26 {0.750 0.380 0.000 srgb} bind def
+/col27 {1.000 0.500 0.500 srgb} bind def
+/col28 {1.000 0.630 0.630 srgb} bind def
+/col29 {1.000 0.750 0.750 srgb} bind def
+/col30 {1.000 0.880 0.880 srgb} bind def
+/col31 {1.000 0.840 0.000 srgb} bind def
+
+end
+save
+newpath 0 443 moveto 0 0 lineto 474 0 lineto 474 443 lineto closepath clip newpath
+-102.8 495.7 translate
+1 -1 scale
+
+/cp {closepath} bind def
+/ef {eofill} bind def
+/gr {grestore} bind def
+/gs {gsave} bind def
+/sa {save} bind def
+/rs {restore} bind def
+/l {lineto} bind def
+/m {moveto} bind def
+/rm {rmoveto} bind def
+/n {newpath} bind def
+/s {stroke} bind def
+/sh {show} bind def
+/slc {setlinecap} bind def
+/slj {setlinejoin} bind def
+/slw {setlinewidth} bind def
+/srgb {setrgbcolor} bind def
+/rot {rotate} bind def
+/sc {scale} bind def
+/sd {setdash} bind def
+/ff {findfont} bind def
+/sf {setfont} bind def
+/scf {scalefont} bind def
+/sw {stringwidth} bind def
+/tr {translate} bind def
+/tnt {dup dup currentrgbcolor
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add srgb}
+  bind def
+/shd {dup dup currentrgbcolor 4 -2 roll mul 4 -2 roll mul
+  4 -2 roll mul srgb} bind def
+/$F2psBegin {$F2psDict begin /$F2psEnteredState save def} def
+/$F2psEnd {$F2psEnteredState restore end} def
+
+$F2psBegin
+10 setmiterlimit
+0 slj 0 slc
+ 0.06000 0.06000 sc
+%
+% Fig objects follow
+%
+% 
+% here starts figure with depth 50
+% Polyline
+7.500 slw
+n 1725 900 m 9600 900 l 9600 8250 l 1725 8250 l
+ cp gs col0 s gr 
+/Helvetica-Bold ff 300.00 scf sf
+4725 4575 m
+gs 1 -1 sc (CENSORED) col0 sh gr
+% here ends figure;
+$F2psEnd
+rs
+showpage
Index: trunk/VUT/doc/SciReport/figs/basic.fig
===================================================================
--- trunk/VUT/doc/SciReport/figs/basic.fig	(revision 243)
+++ trunk/VUT/doc/SciReport/figs/basic.fig	(revision 243)
@@ -0,0 +1,85 @@
+#FIG 3.2
+Landscape
+Center
+Inches
+Letter  
+100.00
+Single
+-2
+1200 2
+1 3 0 1 0 7 0 0 20 0.000 1 0.0000 4200 1200 168 168 4200 1200 4368 1200
+1 3 0 1 0 7 0 0 20 0.000 1 0.0000 11100 1200 168 168 11100 1200 11268 1200
+2 1 0 1 0 7 12 0 -1 0.000 0 0 -1 0 0 4
+	 8100 4800 11100 1200 14100 4800 8100 4800
+2 1 0 1 0 7 6 0 -1 0.000 0 0 -1 0 0 4
+	 1200 4800 4200 1200 7200 4800 1200 4800
+2 1 0 1 0 7 0 0 18 0.000 0 0 -1 0 0 11
+	 11250 3450 11475 3075 11700 2850 11850 2850 12375 3000 12675 3075
+	 13050 3525 12675 3750 12150 3675 11625 3450 11250 3450
+2 1 0 4 0 7 0 0 -1 0.000 0 0 -1 0 0 2
+	 12675 3075 13050 3525
+2 1 0 2 0 7 0 0 -1 0.000 0 0 -1 1 0 2
+	1 1 1.00 60.00 120.00
+	 10275 4425 10275 3975
+2 1 0 2 0 7 0 0 -1 0.000 0 0 -1 1 0 2
+	1 1 1.00 60.00 120.00
+	 10725 4350 10575 3900
+2 1 0 2 0 7 0 0 -1 0.000 0 0 -1 1 0 2
+	1 1 1.00 60.00 120.00
+	 9750 4350 10050 3900
+2 1 0 2 0 7 0 0 -1 0.000 0 0 -1 1 0 2
+	1 1 1.00 60.00 120.00
+	 3975 1875 3600 2400
+2 1 0 2 0 7 0 0 -1 0.000 0 0 -1 1 0 2
+	1 1 1.00 60.00 120.00
+	 4200 1875 4200 2400
+2 1 0 2 0 7 0 0 -1 0.000 0 0 -1 1 0 2
+	1 1 1.00 60.00 120.00
+	 4425 1875 4800 2400
+2 1 0 2 0 7 0 0 -1 0.000 0 0 -1 1 0 2
+	1 1 1.00 60.00 120.00
+	 12375 3075 12675 3450
+2 1 0 2 0 7 0 0 -1 0.000 0 0 -1 1 0 2
+	1 1 1.00 60.00 120.00
+	 12150 3075 12225 3450
+2 1 0 2 0 7 0 0 -1 0.000 0 0 -1 1 0 2
+	1 1 1.00 60.00 120.00
+	 11850 3000 11850 3300
+2 1 0 1 0 7 1 0 20 0.000 0 0 -1 0 0 9
+	 9300 3675 9822 3733 10197 3733 11100 3600 10872 4408 10725 4575
+	 10050 4650 9600 4350 9300 3675
+2 1 0 1 0 7 0 0 -1 0.000 0 0 -1 0 0 2
+	 7050 2700 4200 3825
+2 1 0 1 0 7 0 0 -1 0.000 0 0 -1 0 0 2
+	 8400 2700 10350 3675
+2 1 0 4 0 7 5 0 18 0.000 0 0 -1 0 0 10
+	 2250 3600 4200 1200 5775 3075 4950 2700 4500 2925 3975 4500
+	 3750 4725 3075 4650 2775 4500 2250 3600
+2 4 0 4 0 7 0 0 18 0.000 0 0 7 0 0 5
+	 7425 1425 6825 1425 6825 1050 7425 1050 7425 1425
+3 2 0 10 0 7 0 0 -1 0.000 0 0 0 6
+	 9150 3600 10050 3750 10800 3675 11550 3450 12525 3750 13050 3525
+	 0.000 -1.000 -1.000 -1.000 -1.000 0.000
+3 2 0 12 29 7 10 0 -1 0.000 0 0 0 7
+	 9150 3600 9675 4500 10275 4725 10800 4575 11325 3150 11775 2775
+	 12675 3075
+	 0.000 -1.000 -1.000 -1.000 -1.000 -1.000 0.000
+3 2 0 12 0 7 0 0 -1 0.000 0 0 0 7
+	 2250 3600 2775 4500 3375 4725 3900 4575 4425 3150 4875 2775
+	 5775 3075
+	 0.000 -1.000 -1.000 -1.000 -1.000 -1.000 0.000
+3 2 0 4 0 7 0 0 -1 0.000 0 0 0 8
+	 9225 3600 9750 4500 10275 4650 10800 4500 11100 3675 11400 3150
+	 11775 2850 12600 3075
+	 0.000 -1.000 -1.000 -1.000 -1.000 -1.000 -1.000 0.000
+4 0 0 0 0 -1 15 0.0000 4 150 105 7350 2775 0\001
+4 0 0 0 0 -1 15 0.0000 4 150 105 8250 2775 1\001
+4 0 0 0 0 0 24 0.0000 4 255 1125 2250 1275 frame 0\001
+4 0 0 0 0 -1 24 0.0000 4 255 240 8025 2700 T\001
+4 0 0 0 0 -1 24 0.0000 4 255 240 7125 2700 T\001
+4 0 0 0 0 0 24 0.0000 4 255 1125 11850 1275 frame 1\001
+4 0 0 0 0 0 24 0.0000 4 255 870 7725 1500 nodes\001
+4 0 0 0 0 0 24 0.0000 4 255 870 7725 1125 tested\001
+4 0 0 0 0 -1 24 0.0000 4 255 2670 6375 2250 termination nodes\001
+4 0 0 0 0 -1 24 0.0000 4 330 1020 11175 4575 pull up\001
+4 0 0 0 0 -1 24 0.0000 4 330 1455 12900 3075 pull down\001
Index: trunk/VUT/doc/SciReport/figs/latency.eps
===================================================================
--- trunk/VUT/doc/SciReport/figs/latency.eps	(revision 243)
+++ trunk/VUT/doc/SciReport/figs/latency.eps	(revision 243)
@@ -0,0 +1,351 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: latency.fig
+%%Creator: fig2dev Version 3.2 Patchlevel 4
+%%CreationDate: Mon Aug 22 13:04:52 2005
+%%For: bittner@NOTES (Jiri Bittner,U-NOTES\bittner,S-1-5-21-1914904292-1436553889-1205156892-1000)
+%%BoundingBox: 0 0 1153 326
+%%Magnification: 1.0000
+%%EndComments
+/$F2psDict 200 dict def
+$F2psDict begin
+$F2psDict /mtrx matrix put
+/col-1 {0 setgray} bind def
+/col0 {0.000 0.000 0.000 srgb} bind def
+/col1 {0.000 0.000 1.000 srgb} bind def
+/col2 {0.000 1.000 0.000 srgb} bind def
+/col3 {0.000 1.000 1.000 srgb} bind def
+/col4 {1.000 0.000 0.000 srgb} bind def
+/col5 {1.000 0.000 1.000 srgb} bind def
+/col6 {1.000 1.000 0.000 srgb} bind def
+/col7 {1.000 1.000 1.000 srgb} bind def
+/col8 {0.000 0.000 0.560 srgb} bind def
+/col9 {0.000 0.000 0.690 srgb} bind def
+/col10 {0.000 0.000 0.820 srgb} bind def
+/col11 {0.530 0.810 1.000 srgb} bind def
+/col12 {0.000 0.560 0.000 srgb} bind def
+/col13 {0.000 0.690 0.000 srgb} bind def
+/col14 {0.000 0.820 0.000 srgb} bind def
+/col15 {0.000 0.560 0.560 srgb} bind def
+/col16 {0.000 0.690 0.690 srgb} bind def
+/col17 {0.000 0.820 0.820 srgb} bind def
+/col18 {0.560 0.000 0.000 srgb} bind def
+/col19 {0.690 0.000 0.000 srgb} bind def
+/col20 {0.820 0.000 0.000 srgb} bind def
+/col21 {0.560 0.000 0.560 srgb} bind def
+/col22 {0.690 0.000 0.690 srgb} bind def
+/col23 {0.820 0.000 0.820 srgb} bind def
+/col24 {0.500 0.190 0.000 srgb} bind def
+/col25 {0.630 0.250 0.000 srgb} bind def
+/col26 {0.750 0.380 0.000 srgb} bind def
+/col27 {1.000 0.500 0.500 srgb} bind def
+/col28 {1.000 0.630 0.630 srgb} bind def
+/col29 {1.000 0.750 0.750 srgb} bind def
+/col30 {1.000 0.880 0.880 srgb} bind def
+/col31 {1.000 0.840 0.000 srgb} bind def
+
+end
+save
+newpath 0 326 moveto 0 0 lineto 1153 0 lineto 1153 326 lineto closepath clip newpath
+72.0 396.7 translate
+1 -1 scale
+
+/cp {closepath} bind def
+/ef {eofill} bind def
+/gr {grestore} bind def
+/gs {gsave} bind def
+/sa {save} bind def
+/rs {restore} bind def
+/l {lineto} bind def
+/m {moveto} bind def
+/rm {rmoveto} bind def
+/n {newpath} bind def
+/s {stroke} bind def
+/sh {show} bind def
+/slc {setlinecap} bind def
+/slj {setlinejoin} bind def
+/slw {setlinewidth} bind def
+/srgb {setrgbcolor} bind def
+/rot {rotate} bind def
+/sc {scale} bind def
+/sd {setdash} bind def
+/ff {findfont} bind def
+/sf {setfont} bind def
+/scf {scalefont} bind def
+/sw {stringwidth} bind def
+/tr {translate} bind def
+/tnt {dup dup currentrgbcolor
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add srgb}
+  bind def
+/shd {dup dup currentrgbcolor 4 -2 roll mul 4 -2 roll mul
+  4 -2 roll mul srgb} bind def
+/$F2psBegin {$F2psDict begin /$F2psEnteredState save def} def
+/$F2psEnd {$F2psEnteredState restore end} def
+
+$F2psBegin
+10 setmiterlimit
+0 slj 0 slc
+ 0.06000 0.06000 sc
+%
+% Fig objects follow
+%
+% 
+% here starts figure with depth 50
+/Times-Roman ff 360.00 scf sf
+17325 2850 m
+gs 1 -1 sc (R7) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+2025 1650 m
+gs 1 -1 sc (R2) col0 sh gr
+% Polyline
+7.500 slw
+n 2700 1200 m 3600 1200 l 3600 1800 l 2700 1800 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+2925 1650 m
+gs 1 -1 sc (R3) col0 sh gr
+% Polyline
+n 3600 1200 m 4500 1200 l 4500 1800 l 3600 1800 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+3825 1650 m
+gs 1 -1 sc (R4) col0 sh gr
+% Polyline
+n 900 1200 m 1800 1200 l 1800 1800 l 900 1800 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+1125 1650 m
+gs 1 -1 sc (R1) col0 sh gr
+% Polyline
+n 4500 1200 m 5400 1200 l 5400 1800 l 4500 1800 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+4725 1650 m
+gs 1 -1 sc (Q5) col0 sh gr
+% Polyline
+n 1800 4800 m 2700 4800 l 2700 5400 l 1800 5400 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+2025 5250 m
+gs 1 -1 sc (R2) col0 sh gr
+% Polyline
+n 2700 4800 m 3600 4800 l 3600 5400 l 2700 5400 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+2925 5250 m
+gs 1 -1 sc (R3) col0 sh gr
+% Polyline
+n 3600 4800 m 4500 4800 l 4500 5400 l 3600 5400 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+3825 5250 m
+gs 1 -1 sc (R4) col0 sh gr
+% Polyline
+n 900 4800 m 1800 4800 l 1800 5400 l 900 5400 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+1125 5250 m
+gs 1 -1 sc (R1) col0 sh gr
+% Polyline
+n 4500 4800 m 5400 4800 l 5400 5400 l 4500 5400 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+4725 5250 m
+gs 1 -1 sc (Q5) col0 sh gr
+% Polyline
+n 7200 4800 m 8100 4800 l 8100 5400 l 7200 5400 l
+ cp gs col0 s gr 
+% Polyline
+n 8100 4800 m 9000 4800 l 9000 5400 l 8100 5400 l
+ cp gs col0 s gr 
+% Polyline
+n 9000 4800 m 9900 4800 l 9900 5400 l 9000 5400 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+7425 5250 m
+gs 1 -1 sc (R5) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+8325 5250 m
+gs 1 -1 sc (R6) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+9225 5250 m
+gs 1 -1 sc (R7) col0 sh gr
+% Polyline
+n 2700 2400 m 3600 2400 l 3600 3000 l 2700 3000 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+2925 2850 m
+gs 1 -1 sc (R2) col0 sh gr
+% Polyline
+n 3600 2400 m 4500 2400 l 4500 3000 l 3600 3000 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+3825 2850 m
+gs 1 -1 sc (R3) col0 sh gr
+% Polyline
+n 4500 2400 m 5400 2400 l 5400 3000 l 4500 3000 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+4725 2850 m
+gs 1 -1 sc (R4) col0 sh gr
+% Polyline
+n 1800 2400 m 2700 2400 l 2700 3000 l 1800 3000 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+2025 2850 m
+gs 1 -1 sc (R1) col0 sh gr
+% Polyline
+n 5400 2400 m 6300 2400 l 6300 3000 l 5400 3000 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+5625 2850 m
+gs 1 -1 sc (Q5) col0 sh gr
+% Polyline
+n 7200 1200 m 8100 1200 l 8100 1800 l 7200 1800 l
+ cp gs col0 s gr 
+% Polyline
+n 8100 1200 m 9000 1200 l 9000 1800 l 8100 1800 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+7425 1650 m
+gs 1 -1 sc (R5) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+8325 1650 m
+gs 1 -1 sc (Q6) col0 sh gr
+% Polyline
+n 2700 6000 m 3600 6000 l 3600 6600 l 2700 6600 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+2925 6450 m
+gs 1 -1 sc (R2) col0 sh gr
+% Polyline
+n 3600 6000 m 4500 6000 l 4500 6600 l 3600 6600 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+3825 6450 m
+gs 1 -1 sc (R3) col0 sh gr
+% Polyline
+n 4500 6000 m 5400 6000 l 5400 6600 l 4500 6600 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+4725 6450 m
+gs 1 -1 sc (R4) col0 sh gr
+% Polyline
+n 1800 6000 m 2700 6000 l 2700 6600 l 1800 6600 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+2025 6450 m
+gs 1 -1 sc (R1) col0 sh gr
+% Polyline
+n 5400 6000 m 6300 6000 l 6300 6600 l 5400 6600 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+5625 6450 m
+gs 1 -1 sc (Q5) col0 sh gr
+% Polyline
+n 8100 6000 m 9000 6000 l 9000 6600 l 8100 6600 l
+ cp gs col0 s gr 
+% Polyline
+n 9000 6000 m 9900 6000 l 9900 6600 l 9000 6600 l
+ cp gs col0 s gr 
+% Polyline
+n 9900 6000 m 10800 6000 l 10800 6600 l 9900 6600 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+8325 6450 m
+gs 1 -1 sc (R5) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+9300 6450 m
+gs 1 -1 sc (R6) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+10125 6450 m
+gs 1 -1 sc (R7) col0 sh gr
+% Polyline
+n 9000 2400 m 9900 2400 l 9900 3000 l 9000 3000 l
+ cp gs col0 s gr 
+% Polyline
+n 9900 2400 m 10800 2400 l 10800 3000 l 9900 3000 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+9225 2850 m
+gs 1 -1 sc (R5) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+10125 2850 m
+gs 1 -1 sc (Q6) col0 sh gr
+% Polyline
+n 11700 1200 m 12600 1200 l 12600 1800 l 11700 1800 l
+ cp gs col0 s gr 
+% Polyline
+n 12600 1200 m 13500 1200 l 13500 1800 l 12600 1800 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+11925 1650 m
+gs 1 -1 sc (R6) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+12825 1650 m
+gs 1 -1 sc (Q7) col0 sh gr
+% Polyline
+n 14400 2400 m 15300 2400 l 15300 3000 l 14400 3000 l
+ cp gs col0 s gr 
+% Polyline
+n 13500 2400 m 14400 2400 l 14400 3000 l 13500 3000 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+13725 2850 m
+gs 1 -1 sc (R6) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+14625 2850 m
+gs 1 -1 sc (Q7) col0 sh gr
+% Polyline
+n 5400 4800 m 6300 4800 l 6300 5400 l 5400 5400 l
+ cp gs col0 s gr 
+% Polyline
+n 6300 4800 m 7200 4800 l 7200 5400 l 6300 5400 l
+ cp gs col0 s gr 
+% Polyline
+n 6300 6000 m 7200 6000 l 7200 6600 l 6300 6600 l
+ cp gs col0 s gr 
+% Polyline
+n 7200 6000 m 8100 6000 l 8100 6600 l 7200 6600 l
+ cp gs col0 s gr 
+% Polyline
+n 16200 1200 m 17100 1200 l 17100 1800 l 16200 1800 l
+ cp gs col0 s gr 
+% Polyline
+n 17100 2400 m 18000 2400 l 18000 3000 l 17100 3000 l
+ cp gs col0 s gr 
+/Times-Roman ff 360.00 scf sf
+5625 5250 m
+gs 1 -1 sc (Q6) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+6525 5250 m
+gs 1 -1 sc (Q7) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+-1200 1725 m
+gs 1 -1 sc (CPU) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+-1200 2925 m
+gs 1 -1 sc (GPU) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+-1125 5250 m
+gs 1 -1 sc (CPU) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+-1125 6525 m
+gs 1 -1 sc (GPU) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+6525 6450 m
+gs 1 -1 sc (Q6) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+7425 6450 m
+gs 1 -1 sc (Q7) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+16500 1650 m
+gs 1 -1 sc (R7) col0 sh gr
+% Polyline
+n 1800 1200 m 2700 1200 l 2700 1800 l 1800 1800 l
+ cp gs col0 s gr 
+% here ends figure;
+$F2psEnd
+rs
+showpage
Index: trunk/VUT/doc/SciReport/figs/latency2.fig
===================================================================
--- trunk/VUT/doc/SciReport/figs/latency2.fig	(revision 243)
+++ trunk/VUT/doc/SciReport/figs/latency2.fig	(revision 243)
@@ -0,0 +1,173 @@
+#FIG 3.2
+Landscape
+Center
+Inches
+Letter  
+100.00
+Single
+-2
+1200 2
+6 2175 2325 5925 3075
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 2250 2400 3150 2400 3150 3000 2250 3000 2250 2400
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 3150 2400 4050 2400 4050 3000 3150 3000 3150 2400
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 4050 2400 4950 2400 4950 3000 4050 3000 4050 2400
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 4950 2400 5850 2400 5850 3000 4950 3000 4950 2400
+4 0 0 50 0 0 32 0.0000 4 330 540 2475 2850 R1\001
+4 0 0 50 0 0 32 0.0000 4 330 540 3375 2850 R2\001
+4 0 0 50 0 0 32 0.0000 4 330 540 4275 2850 R3\001
+4 0 0 50 0 0 32 0.0000 4 435 570 5175 2850 Q4\001
+-6
+6 6375 1125 8325 1875
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 6450 1200 7350 1200 7350 1800 6450 1800 6450 1200
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 7350 1200 8250 1200 8250 1800 7350 1800 7350 1200
+4 0 0 50 0 0 32 0.0000 4 330 540 6675 1650 R4\001
+4 0 0 50 0 0 32 0.0000 4 435 570 7575 1650 Q5\001
+-6
+6 7725 2325 9675 3075
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 7800 2400 8700 2400 8700 3000 7800 3000 7800 2400
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 8700 2400 9600 2400 9600 3000 8700 3000 8700 2400
+4 0 0 50 0 0 32 0.0000 4 330 540 8025 2850 R4\001
+4 0 0 50 0 0 32 0.0000 4 435 570 8925 2850 Q5\001
+-6
+6 10125 1125 11175 1875
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 10200 1200 11100 1200 11100 1800 10200 1800 10200 1200
+4 0 0 50 0 0 32 0.0000 4 330 540 10425 1650 C5\001
+-6
+6 13650 3600 15300 4125
+2 1 0 2 0 7 50 0 -1 0.000 0 0 -1 1 0 2
+	1 1 2.00 120.00 240.00
+	 13725 3675 15225 3675
+4 0 0 50 0 0 32 0.0000 4 285 135 14475 4125 t\001
+-6
+6 13650 7200 15300 7725
+2 1 0 2 0 7 50 0 -1 0.000 0 0 7 1 0 2
+	1 1 2.00 120.00 240.00
+	 13725 7275 15225 7275
+4 0 0 50 0 0 32 0.0000 4 285 135 14475 7725 t\001
+-6
+6 11025 1125 12075 1875
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 11100 1200 12000 1200 12000 1800 11100 1800 11100 1200
+4 0 0 50 0 0 32 0.0000 4 435 570 11325 1650 Q6\001
+-6
+6 12375 2325 13425 3075
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 12450 2400 13350 2400 13350 3000 12450 3000 12450 2400
+4 0 0 50 0 0 32 0.0000 4 435 570 12675 2850 Q6\001
+-6
+6 13875 1125 14925 1875
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 13950 1200 14850 1200 14850 1800 13950 1800 13950 1200
+4 0 0 50 0 0 32 0.0000 4 330 540 14250 1650 R6\001
+-6
+6 15225 2325 16275 3075
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 15300 2400 16200 2400 16200 3000 15300 3000 15300 2400
+4 0 0 50 0 0 32 0.0000 4 330 540 15525 2850 R6\001
+-6
+6 5850 1800 6675 2475
+2 1 0 2 0 7 50 0 -1 0.000 0 0 -1 1 0 2
+	1 1 2.00 120.00 240.00
+	 5925 2325 6300 1875
+4 0 0 50 0 0 32 0.0000 4 330 330 6300 2475 V\001
+-6
+6 9600 1800 10200 2475
+2 1 0 2 0 7 50 0 -1 0.000 0 0 -1 1 0 2
+	1 1 2.00 120.00 240.00
+	 9675 2325 10050 1875
+4 0 0 50 0 0 32 0.0000 4 330 150 10050 2475 I\001
+-6
+6 13350 1800 14175 2475
+2 1 0 2 0 7 50 0 -1 0.000 0 0 -1 1 0 2
+	1 1 2.00 120.00 240.00
+	 13425 2325 13800 1875
+4 0 0 50 0 0 32 0.0000 4 330 330 13800 2475 V\001
+-6
+6 8250 5025 9300 5775
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 8325 5100 9225 5100 9225 5700 8325 5700 8325 5100
+4 0 0 50 0 0 32 0.0000 4 330 540 8550 5550 C5\001
+-6
+6 2175 6225 9525 6975
+6 2175 6225 9525 6975
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 6750 6300 7650 6300 7650 6900 6750 6900 6750 6300
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 7650 6300 8550 6300 8550 6900 7650 6900 7650 6300
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 2250 6300 3150 6300 3150 6900 2250 6900 2250 6300
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 3150 6300 4050 6300 4050 6900 3150 6900 3150 6300
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 4050 6300 4950 6300 4950 6900 4050 6900 4050 6300
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 4950 6300 5850 6300 5850 6900 4950 6900 4950 6300
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 5850 6300 6750 6300 6750 6900 5850 6900 5850 6300
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 8550 6300 9450 6300 9450 6900 8550 6900 8550 6300
+4 0 0 50 0 0 32 0.0000 4 435 570 6975 6750 Q5\001
+4 0 0 50 0 0 32 0.0000 4 435 570 7875 6750 Q6\001
+4 0 0 50 0 0 32 0.0000 4 330 540 2475 6750 R1\001
+4 0 0 50 0 0 32 0.0000 4 330 540 3375 6750 R2\001
+4 0 0 50 0 0 32 0.0000 4 330 540 4275 6750 R3\001
+4 0 0 50 0 0 32 0.0000 4 435 570 5175 6750 Q4\001
+4 0 0 50 0 0 32 0.0000 4 330 540 6075 6750 R4\001
+4 0 0 50 0 0 32 0.0000 4 330 540 8775 6750 R6\001
+-6
+-6
+6 7725 5700 8325 6300
+2 1 0 2 0 7 50 0 -1 0.000 0 0 -1 1 0 2
+	1 1 2.00 120.00 240.00
+	 7800 6225 8175 5775
+4 0 0 50 0 0 32 0.0000 4 330 150 8175 6225 I\001
+-6
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 900 1200 1800 1200 1800 1800 900 1800 900 1200
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 1800 1200 2700 1200 2700 1800 1800 1800 1800 1200
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 2700 1200 3600 1200 3600 1800 2700 1800 2700 1200
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 3600 1200 4500 1200 4500 1800 3600 1800 3600 1200
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 5400 5100 6300 5100 6300 5700 5400 5700 5400 5100
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 6300 5100 7200 5100 7200 5700 6300 5700 6300 5100
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 900 5100 1800 5100 1800 5700 900 5700 900 5100
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 1800 5100 2700 5100 2700 5700 1800 5700 1800 5100
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 2700 5100 3600 5100 3600 5700 2700 5700 2700 5100
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 3600 5100 4500 5100 4500 5700 3600 5700 3600 5100
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 4500 5100 5400 5100 5400 5700 4500 5700 4500 5100
+2 2 0 2 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 7200 5100 8100 5100 8100 5700 7200 5700 7200 5100
+4 0 0 50 0 0 32 0.0000 4 330 540 1125 1650 R1\001
+4 0 0 50 0 0 32 0.0000 4 330 540 2025 1650 R2\001
+4 0 0 50 0 0 32 0.0000 4 330 540 2925 1650 R3\001
+4 0 0 50 0 0 32 0.0000 4 435 570 3825 1650 Q4\001
+4 0 0 50 0 0 32 0.0000 4 330 945 -300 1650 CPU\001
+4 0 0 50 0 0 32 0.0000 4 330 975 -300 2925 GPU\001
+4 0 0 50 0 0 32 0.0000 4 435 570 5625 5550 Q5\001
+4 0 0 50 0 0 32 0.0000 4 435 570 6525 5550 Q6\001
+4 0 0 50 0 0 32 0.0000 4 330 540 1125 5550 R1\001
+4 0 0 50 0 0 32 0.0000 4 330 540 2025 5550 R2\001
+4 0 0 50 0 0 32 0.0000 4 330 540 2925 5550 R3\001
+4 0 0 50 0 0 32 0.0000 4 435 570 3825 5550 Q4\001
+4 0 0 50 0 0 32 0.0000 4 330 540 4725 5550 R4\001
+4 0 0 50 0 0 32 0.0000 4 330 540 7425 5550 R6\001
+4 0 0 50 0 0 32 0.0000 4 330 945 -300 5550 CPU\001
+4 0 0 50 0 0 32 0.0000 4 330 975 -300 6825 GPU\001
Index: trunk/VUT/doc/SciReport/figs/cut.fig
===================================================================
--- trunk/VUT/doc/SciReport/figs/cut.fig	(revision 243)
+++ trunk/VUT/doc/SciReport/figs/cut.fig	(revision 243)
@@ -0,0 +1,174 @@
+#FIG 3.2
+Landscape
+Center
+Inches
+Letter  
+100.00
+Single
+-2
+1200 2
+6 13575 2700 15075 3300
+2 1 0 2 0 7 55 0 -1 0.000 0 0 7 0 0 2
+	 14026 2733 13651 3258
+2 1 0 2 0 7 55 0 -1 0.000 0 0 7 0 0 2
+	 14626 2733 15001 3258
+-6
+6 9300 3900 10425 4500
+2 1 0 2 0 7 55 0 -1 0.000 0 0 7 0 0 2
+	 9676 3933 9376 4458
+2 1 0 2 0 7 55 0 -1 0.000 0 0 7 0 0 2
+	 10126 3933 10351 4458
+-6
+6 12825 3900 13950 4500
+2 1 0 2 0 7 55 0 -1 0.000 0 0 7 0 0 2
+	 13201 3933 12901 4458
+2 1 0 2 0 7 55 0 -1 0.000 0 0 7 0 0 2
+	 13651 3933 13876 4458
+-6
+6 13425 5100 14550 5700
+2 1 0 2 0 7 55 0 -1 0.000 0 0 7 0 0 2
+	 13801 5133 13501 5658
+2 1 0 2 0 7 55 0 -1 0.000 0 0 7 0 0 2
+	 14251 5133 14476 5658
+-6
+6 -375 825 7500 6375
+6 4875 2625 6375 3300
+2 1 0 2 0 7 55 0 -1 0.000 0 0 7 0 0 2
+	 5325 2700 4950 3225
+2 1 0 2 0 7 55 0 -1 0.000 0 0 7 0 0 2
+	 5925 2700 6300 3225
+-6
+6 600 3825 1725 4500
+2 1 0 2 0 7 55 0 -1 0.000 0 0 7 0 0 2
+	 975 3900 675 4425
+2 1 0 2 0 7 55 0 -1 0.000 0 0 7 0 0 2
+	 1425 3900 1650 4425
+-6
+6 4125 3825 5250 4500
+2 1 0 2 0 7 55 0 -1 0.000 0 0 7 0 0 2
+	 4500 3900 4200 4425
+2 1 0 2 0 7 55 0 -1 0.000 0 0 7 0 0 2
+	 4950 3900 5175 4425
+-6
+6 4725 5025 5850 5700
+2 1 0 2 0 7 55 0 -1 0.000 0 0 7 0 0 2
+	 5100 5100 4800 5625
+2 1 0 2 0 7 55 0 -1 0.000 0 0 7 0 0 2
+	 5550 5100 5775 5625
+-6
+1 3 0 2 0 7 50 0 -1 0.000 1 0.0000 525 4800 318 318 525 4800 750 5025
+1 3 0 2 0 7 50 0 16 0.000 1 0.0000 1725 4800 318 318 1725 4800 2043 4800
+1 3 0 2 0 7 50 0 -1 0.000 1 0.0000 2918 3589 318 318 2918 3589 3143 3814
+1 3 0 2 0 7 50 0 -1 0.000 1 0.0000 6525 3600 318 318 6525 3600 6750 3825
+1 3 0 2 0 7 50 0 16 0.000 1 0.0000 4725 3600 318 318 4725 3600 4950 3825
+1 3 0 2 0 7 50 0 -1 0.000 1 0.0000 1193 3589 318 318 1193 3589 1511 3589
+1 3 0 2 0 7 50 0 -1 0.000 1 0.0000 2016 2398 318 318 2016 2398 2241 2623
+1 3 0 2 0 7 50 0 -1 0.000 1 0.0000 3825 1200 318 318 3825 1200 4143 1200
+1 3 0 2 0 7 50 0 -1 0.000 1 0.0000 5616 2398 318 318 5616 2398 5841 2623
+1 3 0 2 0 7 50 0 16 0.000 1 0.0000 4125 4800 318 318 4125 4800 4443 4800
+1 3 0 2 0 7 50 0 16 0.000 1 0.0000 5325 4800 318 318 5325 4800 5550 5025
+1 3 0 2 0 7 50 0 16 0.000 1 0.0000 4725 6000 318 318 4725 6000 4950 6225
+1 3 0 2 0 7 50 0 16 0.000 1 0.0000 5925 6000 318 318 5925 6000 6150 6225
+2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 2
+	 4050 1425 5325 2100
+2 1 0 2 0 7 55 0 -1 0.000 0 0 -1 0 0 2
+	 3600 1425 2325 2100
+2 1 0 2 0 7 55 0 -1 0.000 0 0 7 0 0 2
+	 1725 2700 1350 3225
+2 1 0 2 0 7 55 0 -1 0.000 0 0 7 0 0 2
+	 2325 2700 2700 3225
+3 1 0 3 0 7 50 0 -1 0.000 0 0 0 17
+	 0 5325 -300 4800 150 4275 1200 4275 2025 4125 2250 3225
+	 3000 2925 4275 3000 7200 2925 7425 3450 7275 3975 6900 4200
+	 3975 4050 3000 4200 2550 4800 2325 5325 450 5400
+	 1.000 1.000 1.000 1.000 1.000 1.000 1.000 1.000
+	 1.000 1.000 1.000 1.000 1.000 1.000 1.000 1.000
+	 1.000
+4 0 0 55 0 0 24 0.0000 4 255 255 1892 2550 V\001
+4 0 0 55 0 0 24 0.0000 4 255 255 3716 1367 V\001
+4 0 0 55 0 0 24 0.0000 4 255 255 1058 3750 V\001
+4 0 0 55 0 0 24 0.0000 4 255 255 5492 2550 V\001
+4 0 0 55 0 0 24 0.0000 4 255 255 409 4967 V\001
+4 0 0 55 0 0 24 0.0000 4 255 255 2792 3750 V\001
+4 0 0 55 0 0 24 0.0000 4 255 255 6392 3750 V\001
+4 0 0 45 0 0 24 0.0000 4 255 120 1659 4949 I\001
+4 0 0 45 0 0 24 0.0000 4 255 120 4075 4916 I\001
+4 0 0 45 0 0 24 0.0000 4 255 120 5275 4916 I\001
+4 0 0 45 0 0 24 0.0000 4 255 120 4675 6133 I\001
+4 0 0 45 0 0 24 0.0000 4 255 120 5892 6133 I\001
+4 0 0 45 0 0 24 0.0000 4 255 120 4675 3716 I\001
+-6
+6 7575 1875 7950 2325
+4 0 0 50 0 0 24 0.0000 4 255 240 7575 2175 T\001
+4 0 0 50 0 0 24 0.0000 4 255 180 7725 2325 0\001
+-6
+6 8775 1875 9225 2325
+4 0 0 50 0 0 24 0.0000 4 255 240 8775 2175 T\001
+4 0 0 50 0 0 24 0.0000 4 255 180 9000 2325 1\001
+-6
+1 3 1 2 0 7 50 0 16 6.000 1 0.0000 13426 6033 318 318 13426 6033 13651 6258
+1 3 1 2 0 7 50 0 16 6.000 1 0.0000 14626 6033 318 318 14626 6033 14851 6258
+1 3 1 2 0 7 50 0 -1 6.000 1 0.0000 10717 2431 318 318 10717 2431 10942 2656
+1 3 1 2 0 7 50 0 -1 6.000 1 0.0000 12526 1233 318 318 12526 1233 12844 1233
+1 3 1 2 0 7 50 0 -1 6.000 1 0.0000 14317 2431 318 318 14317 2431 14542 2656
+1 3 0 3 0 7 50 0 16 0.000 1 0.0000 9226 4833 318 318 9226 4833 9544 4833
+1 3 0 3 0 7 50 0 16 0.000 1 0.0000 10426 4833 318 318 10426 4833 10744 4833
+1 3 0 3 0 7 50 0 -1 0.000 1 0.0000 12826 4833 318 318 12826 4833 13144 4833
+1 3 0 3 0 7 50 0 -1 0.000 1 0.0000 13426 3633 318 318 13426 3633 13744 3633
+1 3 0 3 0 7 50 0 16 0.000 1 0.0000 14026 4833 318 318 14026 4833 14344 4833
+1 3 0 3 0 7 50 0 -1 0.000 1 0.0000 15226 3633 318 318 15226 3633 15451 3858
+1 3 0 3 0 7 50 0 -1 0.000 1 0.0000 11619 3622 318 318 11619 3622 11844 3847
+1 3 1 2 0 7 50 0 16 6.000 1 0.0000 9894 3622 318 318 9894 3622 10119 3847
+2 1 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 2
+	 12751 1458 14026 2133
+2 1 0 2 0 7 55 0 -1 0.000 0 0 -1 0 0 2
+	 12301 1458 11026 2133
+2 1 0 2 0 7 55 0 -1 0.000 0 0 7 0 0 2
+	 10426 2733 10051 3258
+2 1 0 2 0 7 55 0 -1 0.000 0 0 7 0 0 2
+	 11026 2733 11401 3258
+2 1 0 4 0 7 50 0 -1 0.000 0 0 -1 1 0 2
+	1 1 2.00 120.00 240.00
+	 9900 4950 9900 3975
+2 1 0 4 0 7 50 0 -1 0.000 0 0 -1 0 1 2
+	1 1 2.00 120.00 240.00
+	 13425 4950 13425 3975
+2 1 0 2 0 7 50 0 -1 0.000 0 0 -1 1 0 2
+	1 1 2.00 120.00 240.00
+	 7688 2512 7238 2962
+2 1 0 2 0 7 50 0 -1 0.000 0 0 -1 1 0 2
+	1 1 2.00 120.00 240.00
+	 9037 2512 9487 2962
+3 1 1 2 0 7 50 0 -1 6.000 0 0 0 17
+	 8706 5362 8406 4837 8856 4312 9906 4312 10731 4162 10956 3262
+	 11706 2962 12981 3037 15906 2962 16131 3487 15981 4012 15606 4237
+	 12681 4087 11706 4237 11256 4837 11031 5362 9156 5437
+	 1.000 1.000 1.000 1.000 1.000 1.000 1.000 1.000
+	 1.000 1.000 1.000 1.000 1.000 1.000 1.000 1.000
+	 1.000
+3 1 0 3 0 7 50 0 -1 0.000 0 0 0 25
+	 9145 3444 9424 3165 9724 3058 11417 3037 11974 3165 12338 3637
+	 12574 4108 13817 4344 14417 4087 14567 3551 14802 3144 15617 3015
+	 16002 3380 15900 4275 15300 4800 14224 5351 13924 5394 12874 5394
+	 12167 5223 11674 4558 11395 4215 10988 4151 9874 4173 9402 4044
+	 9188 3744
+	 1.000 1.000 1.000 1.000 1.000 1.000 1.000 1.000
+	 1.000 1.000 1.000 1.000 1.000 1.000 1.000 1.000
+	 1.000 1.000 1.000 1.000 1.000 1.000 1.000 1.000
+	 1.000
+4 0 0 55 0 0 24 0.0000 4 255 255 10593 2583 V\001
+4 0 0 55 0 0 24 0.0000 4 255 255 14193 2583 V\001
+4 0 0 55 0 0 24 0.0000 4 255 255 11493 3783 V\001
+4 0 0 55 0 0 24 0.0000 4 255 255 15093 3783 V\001
+4 0 0 45 0 0 24 0.0000 4 255 120 10360 4982 I\001
+4 0 0 45 0 0 24 0.0000 4 255 120 13976 4949 I\001
+4 0 0 45 0 0 24 0.0000 4 255 120 13376 6166 I\001
+4 0 0 45 0 0 24 0.0000 4 255 120 14593 6166 I\001
+4 0 0 45 0 0 24 0.0000 4 255 120 9180 4957 I\001
+4 0 0 45 0 0 24 0.0000 4 255 120 9834 3753 I\001
+4 0 0 45 0 0 24 0.0000 4 255 255 13316 3771 V\001
+4 0 0 50 0 0 24 0.0000 4 330 1020 8325 4200 pull up\001
+4 0 0 50 0 0 24 0.0000 4 330 1455 14175 4425 pull down\001
+4 0 0 55 0 0 24 0.0000 4 255 255 12417 1400 V\001
+4 0 0 45 0 0 24 0.0000 4 255 255 12716 4972 V\001
+4 0 0 50 0 0 24 0.0000 4 255 2670 7125 1500 termination nodes\001
Index: trunk/VUT/doc/SciReport/figs/dummy.fig
===================================================================
--- trunk/VUT/doc/SciReport/figs/dummy.fig	(revision 243)
+++ trunk/VUT/doc/SciReport/figs/dummy.fig	(revision 243)
@@ -0,0 +1,12 @@
+#FIG 3.2
+Landscape
+Center
+Inches
+Letter  
+100.00
+Single
+-2
+1200 2
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 1725 900 9600 900 9600 8250 1725 8250 1725 900
+4 0 0 50 0 18 20 0.0000 4 210 1650 4725 4575 CENSORED\001
Index: trunk/VUT/doc/SciReport/figs/latency.fig
===================================================================
--- trunk/VUT/doc/SciReport/figs/latency.fig	(revision 243)
+++ trunk/VUT/doc/SciReport/figs/latency.fig	(revision 243)
@@ -0,0 +1,203 @@
+#FIG 3.2
+Landscape
+Center
+Inches
+Letter  
+100.00
+Single
+-2
+1200 2
+6 900 1200 5400 1800
+6 1800 1200 2700 1800
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 1800 1200 2700 1200 2700 1800 1800 1800 1800 1200
+4 0 0 50 0 0 24 0.0000 4 255 420 2025 1650 R2\001
+-6
+6 2700 1200 3600 1800
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 2700 1200 3600 1200 3600 1800 2700 1800 2700 1200
+4 0 0 50 0 0 24 0.0000 4 255 420 2925 1650 R3\001
+-6
+6 3600 1200 4500 1800
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 3600 1200 4500 1200 4500 1800 3600 1800 3600 1200
+4 0 0 50 0 0 24 0.0000 4 255 420 3825 1650 R4\001
+-6
+6 900 1200 1800 1800
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 900 1200 1800 1200 1800 1800 900 1800 900 1200
+4 0 0 50 0 0 24 0.0000 4 255 420 1125 1650 R1\001
+-6
+6 4500 1200 5400 1800
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 4500 1200 5400 1200 5400 1800 4500 1800 4500 1200
+4 0 0 50 0 0 24 0.0000 4 330 450 4725 1650 Q5\001
+-6
+-6
+6 900 4800 5400 5400
+6 1800 4800 2700 5400
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 1800 4800 2700 4800 2700 5400 1800 5400 1800 4800
+4 0 0 50 0 0 24 0.0000 4 255 420 2025 5250 R2\001
+-6
+6 2700 4800 3600 5400
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 2700 4800 3600 4800 3600 5400 2700 5400 2700 4800
+4 0 0 50 0 0 24 0.0000 4 255 420 2925 5250 R3\001
+-6
+6 3600 4800 4500 5400
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 3600 4800 4500 4800 4500 5400 3600 5400 3600 4800
+4 0 0 50 0 0 24 0.0000 4 255 420 3825 5250 R4\001
+-6
+6 900 4800 1800 5400
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 900 4800 1800 4800 1800 5400 900 5400 900 4800
+4 0 0 50 0 0 24 0.0000 4 255 420 1125 5250 R1\001
+-6
+6 4500 4800 5400 5400
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 4500 4800 5400 4800 5400 5400 4500 5400 4500 4800
+4 0 0 50 0 0 24 0.0000 4 330 450 4725 5250 Q5\001
+-6
+-6
+6 7200 4800 9900 5400
+6 7200 4800 9900 5400
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 7200 4800 8100 4800 8100 5400 7200 5400 7200 4800
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 8100 4800 9000 4800 9000 5400 8100 5400 8100 4800
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 9000 4800 9900 4800 9900 5400 9000 5400 9000 4800
+4 0 0 50 0 0 24 0.0000 4 255 420 7425 5250 R5\001
+4 0 0 50 0 0 24 0.0000 4 255 420 8325 5250 R6\001
+4 0 0 50 0 0 24 0.0000 4 255 420 9225 5250 R7\001
+-6
+-6
+6 1800 2400 6300 3000
+6 1800 2400 6300 3000
+6 1800 2400 6300 3000
+6 2700 2400 3600 3000
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 2700 2400 3600 2400 3600 3000 2700 3000 2700 2400
+4 0 0 50 0 0 24 0.0000 4 255 420 2925 2850 R2\001
+-6
+6 3600 2400 4500 3000
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 3600 2400 4500 2400 4500 3000 3600 3000 3600 2400
+4 0 0 50 0 0 24 0.0000 4 255 420 3825 2850 R3\001
+-6
+6 4500 2400 5400 3000
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 4500 2400 5400 2400 5400 3000 4500 3000 4500 2400
+4 0 0 50 0 0 24 0.0000 4 255 420 4725 2850 R4\001
+-6
+6 1800 2400 2700 3000
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 1800 2400 2700 2400 2700 3000 1800 3000 1800 2400
+4 0 0 50 0 0 24 0.0000 4 255 420 2025 2850 R1\001
+-6
+6 5400 2400 6300 3000
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 5400 2400 6300 2400 6300 3000 5400 3000 5400 2400
+4 0 0 50 0 0 24 0.0000 4 330 450 5625 2850 Q5\001
+-6
+-6
+-6
+-6
+6 7200 1200 9000 1800
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 7200 1200 8100 1200 8100 1800 7200 1800 7200 1200
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 8100 1200 9000 1200 9000 1800 8100 1800 8100 1200
+4 0 0 50 0 0 24 0.0000 4 255 420 7425 1650 R5\001
+4 0 0 50 0 0 24 0.0000 4 330 450 8325 1650 Q6\001
+-6
+6 1800 6000 6300 6600
+6 1800 6000 6300 6600
+6 1800 6000 6300 6600
+6 2700 6000 3600 6600
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 2700 6000 3600 6000 3600 6600 2700 6600 2700 6000
+4 0 0 50 0 0 24 0.0000 4 255 420 2925 6450 R2\001
+-6
+6 3600 6000 4500 6600
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 3600 6000 4500 6000 4500 6600 3600 6600 3600 6000
+4 0 0 50 0 0 24 0.0000 4 255 420 3825 6450 R3\001
+-6
+6 4500 6000 5400 6600
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 4500 6000 5400 6000 5400 6600 4500 6600 4500 6000
+4 0 0 50 0 0 24 0.0000 4 255 420 4725 6450 R4\001
+-6
+6 1800 6000 2700 6600
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 1800 6000 2700 6000 2700 6600 1800 6600 1800 6000
+4 0 0 50 0 0 24 0.0000 4 255 420 2025 6450 R1\001
+-6
+6 5400 6000 6300 6600
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 5400 6000 6300 6000 6300 6600 5400 6600 5400 6000
+4 0 0 50 0 0 24 0.0000 4 330 450 5625 6450 Q5\001
+-6
+-6
+-6
+-6
+6 8100 6000 10800 6600
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 8100 6000 9000 6000 9000 6600 8100 6600 8100 6000
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 9000 6000 9900 6000 9900 6600 9000 6600 9000 6000
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 9900 6000 10800 6000 10800 6600 9900 6600 9900 6000
+4 0 0 50 0 0 24 0.0000 4 255 420 8325 6450 R5\001
+4 0 0 50 0 0 24 0.0000 4 255 420 9300 6450 R6\001
+4 0 0 50 0 0 24 0.0000 4 255 420 10125 6450 R7\001
+-6
+6 9000 2400 10800 3000
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 9000 2400 9900 2400 9900 3000 9000 3000 9000 2400
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 9900 2400 10800 2400 10800 3000 9900 3000 9900 2400
+4 0 0 50 0 0 24 0.0000 4 255 420 9225 2850 R5\001
+4 0 0 50 0 0 24 0.0000 4 330 450 10125 2850 Q6\001
+-6
+6 11700 1200 13500 1800
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 11700 1200 12600 1200 12600 1800 11700 1800 11700 1200
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 12600 1200 13500 1200 13500 1800 12600 1800 12600 1200
+4 0 0 50 0 0 24 0.0000 4 255 420 11925 1650 R6\001
+4 0 0 50 0 0 24 0.0000 4 330 450 12825 1650 Q7\001
+-6
+6 13500 2400 15300 3000
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 14400 2400 15300 2400 15300 3000 14400 3000 14400 2400
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 13500 2400 14400 2400 14400 3000 13500 3000 13500 2400
+4 0 0 50 0 0 24 0.0000 4 255 420 13725 2850 R6\001
+4 0 0 50 0 0 24 0.0000 4 330 450 14625 2850 Q7\001
+-6
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 5400 4800 6300 4800 6300 5400 5400 5400 5400 4800
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 6300 4800 7200 4800 7200 5400 6300 5400 6300 4800
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 6300 6000 7200 6000 7200 6600 6300 6600 6300 6000
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 7200 6000 8100 6000 8100 6600 7200 6600 7200 6000
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 16200 1200 17100 1200 17100 1800 16200 1800 16200 1200
+2 2 0 1 0 7 50 0 -1 0.000 0 0 -1 0 0 5
+	 17100 2400 18000 2400 18000 3000 17100 3000 17100 2400
+4 0 0 50 0 0 24 0.0000 4 330 450 5625 5250 Q6\001
+4 0 0 50 0 0 24 0.0000 4 330 450 6525 5250 Q7\001
+4 0 0 50 0 0 24 0.0000 4 255 735 -1200 1725 CPU\001
+4 0 0 50 0 0 24 0.0000 4 255 765 -1200 2925 GPU\001
+4 0 0 50 0 0 24 0.0000 4 255 735 -1125 5250 CPU\001
+4 0 0 50 0 0 24 0.0000 4 255 765 -1125 6525 GPU\001
+4 0 0 50 0 0 24 0.0000 4 330 450 6525 6450 Q6\001
+4 0 0 50 0 0 24 0.0000 4 330 450 7425 6450 Q7\001
+4 0 0 50 0 0 24 0.0000 4 255 420 16500 1650 R7\001
+4 0 0 50 0 0 24 0.0000 4 255 420 17325 2850 R7\001
Index: trunk/VUT/doc/SciReport/figs/basic.eps
===================================================================
--- trunk/VUT/doc/SciReport/figs/basic.eps	(revision 243)
+++ trunk/VUT/doc/SciReport/figs/basic.eps	(revision 243)
@@ -0,0 +1,450 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: basic.fig
+%%Creator: fig2dev Version 3.2 Patchlevel 4
+%%CreationDate: Mon Aug 22 13:04:52 2005
+%%For: bittner@NOTES (Jiri Bittner,U-NOTES\bittner,S-1-5-21-1914904292-1436553889-1205156892-1000)
+%%BoundingBox: 0 0 793 244
+%%Magnification: 1.0000
+%%EndComments
+/$F2psDict 200 dict def
+$F2psDict begin
+$F2psDict /mtrx matrix put
+/col-1 {0 setgray} bind def
+/col0 {0.000 0.000 0.000 srgb} bind def
+/col1 {0.000 0.000 1.000 srgb} bind def
+/col2 {0.000 1.000 0.000 srgb} bind def
+/col3 {0.000 1.000 1.000 srgb} bind def
+/col4 {1.000 0.000 0.000 srgb} bind def
+/col5 {1.000 0.000 1.000 srgb} bind def
+/col6 {1.000 1.000 0.000 srgb} bind def
+/col7 {1.000 1.000 1.000 srgb} bind def
+/col8 {0.000 0.000 0.560 srgb} bind def
+/col9 {0.000 0.000 0.690 srgb} bind def
+/col10 {0.000 0.000 0.820 srgb} bind def
+/col11 {0.530 0.810 1.000 srgb} bind def
+/col12 {0.000 0.560 0.000 srgb} bind def
+/col13 {0.000 0.690 0.000 srgb} bind def
+/col14 {0.000 0.820 0.000 srgb} bind def
+/col15 {0.000 0.560 0.560 srgb} bind def
+/col16 {0.000 0.690 0.690 srgb} bind def
+/col17 {0.000 0.820 0.820 srgb} bind def
+/col18 {0.560 0.000 0.000 srgb} bind def
+/col19 {0.690 0.000 0.000 srgb} bind def
+/col20 {0.820 0.000 0.000 srgb} bind def
+/col21 {0.560 0.000 0.560 srgb} bind def
+/col22 {0.690 0.000 0.690 srgb} bind def
+/col23 {0.820 0.000 0.820 srgb} bind def
+/col24 {0.500 0.190 0.000 srgb} bind def
+/col25 {0.630 0.250 0.000 srgb} bind def
+/col26 {0.750 0.380 0.000 srgb} bind def
+/col27 {1.000 0.500 0.500 srgb} bind def
+/col28 {1.000 0.630 0.630 srgb} bind def
+/col29 {1.000 0.750 0.750 srgb} bind def
+/col30 {1.000 0.880 0.880 srgb} bind def
+/col31 {1.000 0.840 0.000 srgb} bind def
+
+end
+save
+newpath 0 244 moveto 0 0 lineto 793 0 lineto 793 244 lineto closepath clip newpath
+-71.3 296.2 translate
+1 -1 scale
+
+/cp {closepath} bind def
+/ef {eofill} bind def
+/gr {grestore} bind def
+/gs {gsave} bind def
+/sa {save} bind def
+/rs {restore} bind def
+/l {lineto} bind def
+/m {moveto} bind def
+/rm {rmoveto} bind def
+/n {newpath} bind def
+/s {stroke} bind def
+/sh {show} bind def
+/slc {setlinecap} bind def
+/slj {setlinejoin} bind def
+/slw {setlinewidth} bind def
+/srgb {setrgbcolor} bind def
+/rot {rotate} bind def
+/sc {scale} bind def
+/sd {setdash} bind def
+/ff {findfont} bind def
+/sf {setfont} bind def
+/scf {scalefont} bind def
+/sw {stringwidth} bind def
+/tr {translate} bind def
+/tnt {dup dup currentrgbcolor
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add srgb}
+  bind def
+/shd {dup dup currentrgbcolor 4 -2 roll mul 4 -2 roll mul
+  4 -2 roll mul srgb} bind def
+ /DrawEllipse {
+	/endangle exch def
+	/startangle exch def
+	/yrad exch def
+	/xrad exch def
+	/y exch def
+	/x exch def
+	/savematrix mtrx currentmatrix def
+	x y tr xrad yrad sc 0 0 1 startangle endangle arc
+	closepath
+	savematrix setmatrix
+	} def
+
+/$F2psBegin {$F2psDict begin /$F2psEnteredState save def} def
+/$F2psEnd {$F2psEnteredState restore end} def
+
+$F2psBegin
+10 setmiterlimit
+0 slj 0 slc
+ 0.06000 0.06000 sc
+%
+% Fig objects follow
+%
+% 
+% here starts figure with depth 12
+% Polyline
+7.500 slw
+n 8100 4800 m 11100 1200 l 14100 4800 l
+ 8100 4800 l  cp gs col0 s gr 
+% here ends figure;
+% 
+% here starts figure with depth 10
+% Polyline
+2 slj
+165.000 slw
+n 9150 3600 m 9150 3601 l 9151 3604 l 9153 3608 l 9156 3616 l 9160 3626 l
+ 9166 3639 l 9173 3656 l 9181 3676 l 9191 3700 l 9202 3726 l
+ 9214 3755 l 9228 3786 l 9242 3818 l 9258 3853 l 9274 3888 l
+ 9291 3925 l 9309 3962 l 9328 3999 l 9347 4037 l 9368 4075 l
+ 9389 4113 l 9411 4152 l 9435 4190 l 9459 4229 l 9486 4268 l
+ 9513 4308 l 9543 4347 l 9574 4387 l 9606 4426 l 9640 4464 l
+ 9675 4500 l 9718 4541 l 9760 4577 l 9798 4608 l 9833 4634 l
+ 9863 4655 l 9888 4671 l 9909 4683 l 9927 4691 l 9941 4697 l
+ 9952 4700 l 9961 4701 l 9968 4701 l 9975 4700 l 9982 4699 l
+ 9989 4697 l 9998 4696 l 10009 4695 l 10023 4695 l 10041 4696 l
+ 10062 4698 l 10087 4702 l 10117 4706 l 10152 4711 l 10190 4716 l
+ 10232 4721 l 10275 4725 l 10315 4727 l 10353 4728 l 10387 4728 l
+ 10418 4729 l 10445 4731 l 10468 4734 l 10487 4738 l 10503 4743 l
+ 10515 4749 l 10524 4756 l 10531 4763 l 10536 4771 l 10540 4780 l
+ 10544 4788 l 10547 4795 l 10551 4801 l 10556 4806 l 10563 4808 l
+ 10572 4808 l 10584 4805 l 10598 4797 l 10617 4785 l 10639 4767 l
+ 10664 4743 l 10694 4712 l 10727 4674 l 10763 4628 l 10800 4575 l
+ 10828 4532 l 10854 4487 l 10880 4440 l 10905 4394 l 10927 4348 l
+ 10948 4303 l 10967 4260 l 10983 4219 l 10998 4179 l 11011 4142 l
+ 11022 4107 l 11031 4074 l 11039 4043 l 11046 4014 l 11052 3985 l
+ 11057 3958 l 11061 3932 l 11065 3907 l 11069 3881 l 11072 3856 l
+ 11076 3830 l 11080 3804 l 11085 3776 l 11091 3748 l 11098 3717 l
+ 11105 3686 l 11115 3652 l 11125 3615 l 11138 3577 l 11152 3536 l
+ 11168 3493 l 11185 3447 l 11205 3399 l 11227 3350 l 11250 3300 l
+ 11274 3249 l 11299 3199 l 11325 3150 l 11357 3093 l 11388 3041 l
+ 11416 2995 l 11441 2955 l 11462 2922 l 11480 2894 l 11494 2872 l
+ 11505 2855 l 11513 2841 l 11518 2832 l 11521 2825 l 11522 2821 l
+ 11521 2819 l 11520 2818 l 11519 2819 l 11517 2820 l 11517 2821 l
+ 11517 2822 l 11519 2822 l 11523 2822 l 11530 2821 l 11540 2818 l
+ 11554 2815 l 11572 2810 l 11595 2805 l 11622 2798 l 11654 2791 l
+ 11691 2785 l 11731 2779 l 11775 2775 l 11821 2774 l 11867 2776 l
+ 11914 2780 l 11960 2786 l 12005 2794 l 12049 2804 l 12092 2815 l
+ 12134 2827 l 12176 2841 l 12216 2855 l 12256 2870 l 12295 2886 l
+ 12333 2903 l 12371 2920 l 12408 2937 l 12443 2954 l 12478 2971 l
+ 12510 2987 l 12540 3002 l 12568 3017 l 12593 3030 l 12614 3042 l
+ 12632 3051 l 12647 3059 l 12658 3066 l 12666 3070 l 12671 3073 l
+ 12674 3074 l
+ 12675 3075 l gs col29 s gr 
+% here ends figure;
+% 
+% here starts figure with depth 6
+% Polyline
+7.500 slw
+n 1200 4800 m 4200 1200 l 7200 4800 l
+ 1200 4800 l  cp gs col0 s gr 
+% Polyline
+45.000 slw
+n 2250 3600 m 4200 1200 l 5775 3075 l 4950 2700 l 4500 2925 l 3975 4500 l
+ 3750 4725 l 3075 4650 l 2775 4500 l
+ 2250 3600 l  cp gs col7 0.90 shd ef gr gs col0 s gr 
+% here ends figure;
+% 
+% here starts figure with depth 1
+% Polyline
+7.500 slw
+n 9300 3675 m 9822 3733 l 10197 3733 l 11100 3600 l 10872 4408 l 10725 4575 l
+ 10050 4650 l 9600 4350 l
+ 9300 3675 l  cp gs col7 1.00 shd ef gr gs col0 s gr 
+% Polyline
+15.000 slw
+gs  clippath
+10598 3876 m 10541 3895 l 10589 4038 l 10580 3915 l 10646 4019 l cp
+eoclip
+n 10725 4350 m
+ 10575 3900 l gs col0 s gr gr
+
+% arrowhead
+7.500 slw
+n 10646 4019 m 10580 3915 l 10589 4038 l 10646 4019 l  cp gs 0.00 setgray ef gr  col0 s
+% Polyline
+15.000 slw
+gs  clippath
+10083 3904 m 10033 3870 l 9949 3996 l 10041 3913 l 9999 4029 l cp
+eoclip
+n 9750 4350 m
+ 10050 3900 l gs col0 s gr gr
+
+% arrowhead
+7.500 slw
+n 9999 4029 m 10041 3913 l 9949 3996 l 9999 4029 l  cp gs 0.00 setgray ef gr  col0 s
+% Polyline
+15.000 slw
+gs  clippath
+3566 2394 m 3615 2429 l 3703 2306 l 3609 2387 l 3654 2271 l cp
+eoclip
+n 3975 1875 m
+ 3600 2400 l gs col0 s gr gr
+
+% arrowhead
+7.500 slw
+n 3654 2271 m 3609 2387 l 3703 2306 l 3654 2271 l  cp gs 0.00 setgray ef gr  col0 s
+% Polyline
+15.000 slw
+gs  clippath
+4170 2415 m 4230 2415 l 4230 2264 l 4200 2384 l 4170 2264 l cp
+eoclip
+n 4200 1875 m
+ 4200 2400 l gs col0 s gr gr
+
+% arrowhead
+7.500 slw
+n 4170 2264 m 4200 2384 l 4230 2264 l 4170 2264 l  cp gs 0.00 setgray ef gr  col0 s
+% Polyline
+15.000 slw
+gs  clippath
+4784 2429 m 4833 2394 l 4745 2271 l 4791 2387 l 4696 2306 l cp
+eoclip
+n 4425 1875 m
+ 4800 2400 l gs col0 s gr gr
+
+% arrowhead
+7.500 slw
+n 4696 2306 m 4791 2387 l 4745 2271 l 4696 2306 l  cp gs 0.00 setgray ef gr  col0 s
+% Polyline
+15.000 slw
+gs  clippath
+12660 3480 m 12707 3442 l 12613 3324 l 12665 3437 l 12566 3362 l cp
+eoclip
+n 12375 3075 m
+ 12675 3450 l gs col0 s gr gr
+
+% arrowhead
+7.500 slw
+n 12566 3362 m 12665 3437 l 12613 3324 l 12566 3362 l  cp gs 0.00 setgray ef gr  col0 s
+% Polyline
+15.000 slw
+gs  clippath
+12198 3470 m 12257 3458 l 12227 3310 l 12222 3434 l 12169 3322 l cp
+eoclip
+n 12150 3075 m
+ 12225 3450 l gs col0 s gr gr
+
+% arrowhead
+7.500 slw
+n 12169 3322 m 12222 3434 l 12227 3310 l 12169 3322 l  cp gs 0.00 setgray ef gr  col0 s
+% Polyline
+15.000 slw
+gs  clippath
+11820 3315 m 11880 3315 l 11880 3164 l 11850 3284 l 11820 3164 l cp
+eoclip
+n 11850 3000 m
+ 11850 3300 l gs col0 s gr gr
+
+% arrowhead
+7.500 slw
+n 11820 3164 m 11850 3284 l 11880 3164 l 11820 3164 l  cp gs 0.00 setgray ef gr  col0 s
+% Polyline
+n 7050 2700 m
+ 4200 3825 l gs col0 s gr 
+% Polyline
+n 8400 2700 m
+ 10350 3675 l gs col0 s gr 
+% Polyline
+45.000 slw
+n 6930 1050 m 6825 1050 6825 1320 105 arcto 4 {pop} repeat
+  6825 1425 7320 1425 105 arcto 4 {pop} repeat
+  7425 1425 7425 1155 105 arcto 4 {pop} repeat
+  7425 1050 6930 1050 105 arcto 4 {pop} repeat
+ cp gs col7 0.90 shd ef gr gs col0 s gr 
+% Polyline
+2 slj
+135.000 slw
+n 9150 3600 m 9151 3600 l 9153 3601 l 9158 3602 l 9165 3604 l 9175 3606 l
+ 9188 3610 l 9203 3614 l 9223 3619 l 9244 3624 l 9269 3630 l
+ 9296 3637 l 9325 3644 l 9356 3651 l 9389 3659 l 9423 3666 l
+ 9458 3674 l 9495 3681 l 9532 3688 l 9571 3696 l 9611 3703 l
+ 9652 3709 l 9695 3716 l 9740 3722 l 9787 3728 l 9836 3734 l
+ 9887 3739 l 9940 3743 l 9995 3747 l 10050 3750 l 10113 3752 l
+ 10171 3753 l 10225 3754 l 10272 3754 l 10312 3753 l 10345 3752 l
+ 10371 3751 l 10391 3750 l 10407 3749 l 10418 3748 l 10426 3746 l
+ 10432 3745 l 10438 3744 l 10442 3742 l 10448 3740 l 10456 3738 l
+ 10467 3736 l 10482 3733 l 10501 3729 l 10526 3724 l 10557 3719 l
+ 10595 3712 l 10638 3705 l 10688 3696 l 10743 3686 l 10800 3675 l
+ 10857 3663 l 10912 3651 l 10961 3638 l 11005 3626 l 11042 3614 l
+ 11073 3602 l 11097 3591 l 11116 3580 l 11130 3570 l 11140 3560 l
+ 11147 3550 l 11152 3540 l 11156 3531 l 11160 3522 l 11166 3513 l
+ 11173 3504 l 11184 3496 l 11199 3487 l 11220 3479 l 11246 3471 l
+ 11280 3464 l 11320 3458 l 11368 3453 l 11424 3450 l 11485 3449 l
+ 11550 3450 l 11608 3454 l 11664 3459 l 11718 3466 l 11768 3475 l
+ 11814 3485 l 11855 3495 l 11892 3506 l 11923 3517 l 11951 3529 l
+ 11974 3540 l 11995 3552 l 12013 3564 l 12028 3576 l 12043 3588 l
+ 12056 3600 l 12070 3612 l 12084 3624 l 12099 3636 l 12116 3648 l
+ 12136 3660 l 12158 3671 l 12184 3683 l 12214 3694 l 12248 3705 l
+ 12287 3715 l 12329 3725 l 12375 3734 l 12424 3741 l 12474 3746 l
+ 12525 3750 l 12586 3751 l 12642 3749 l 12692 3745 l 12737 3738 l
+ 12777 3729 l 12813 3718 l 12845 3706 l 12873 3692 l 12899 3678 l
+ 12921 3663 l 12942 3647 l 12961 3630 l 12978 3614 l 12993 3598 l
+ 13006 3583 l 13018 3569 l 13027 3557 l 13035 3547 l 13041 3538 l
+ 13045 3532 l 13048 3528 l 13049 3526 l
+ 13050 3525 l gs col0 s gr 
+% Polyline
+165.000 slw
+n 2250 3600 m 2250 3601 l 2251 3604 l 2253 3608 l 2256 3616 l 2260 3626 l
+ 2266 3639 l 2273 3656 l 2281 3676 l 2291 3700 l 2302 3726 l
+ 2314 3755 l 2328 3786 l 2342 3818 l 2358 3853 l 2374 3888 l
+ 2391 3925 l 2409 3962 l 2428 3999 l 2447 4037 l 2468 4075 l
+ 2489 4113 l 2511 4152 l 2535 4190 l 2559 4229 l 2586 4268 l
+ 2613 4308 l 2643 4347 l 2674 4387 l 2706 4426 l 2740 4464 l
+ 2775 4500 l 2818 4541 l 2860 4577 l 2898 4608 l 2933 4634 l
+ 2963 4655 l 2988 4671 l 3009 4683 l 3027 4691 l 3041 4697 l
+ 3052 4700 l 3061 4701 l 3068 4701 l 3075 4700 l 3082 4699 l
+ 3089 4697 l 3098 4696 l 3109 4695 l 3123 4695 l 3141 4696 l
+ 3162 4698 l 3187 4702 l 3217 4706 l 3252 4711 l 3290 4716 l
+ 3332 4721 l 3375 4725 l 3415 4727 l 3453 4728 l 3487 4728 l
+ 3518 4729 l 3545 4731 l 3568 4734 l 3587 4738 l 3603 4743 l
+ 3615 4749 l 3624 4756 l 3631 4763 l 3636 4771 l 3640 4780 l
+ 3644 4788 l 3647 4795 l 3651 4801 l 3656 4806 l 3663 4808 l
+ 3672 4808 l 3684 4805 l 3698 4797 l 3717 4785 l 3739 4767 l
+ 3764 4743 l 3794 4712 l 3827 4674 l 3863 4628 l 3900 4575 l
+ 3928 4532 l 3954 4487 l 3980 4440 l 4005 4394 l 4027 4348 l
+ 4048 4303 l 4067 4260 l 4083 4219 l 4098 4179 l 4111 4142 l
+ 4122 4107 l 4131 4074 l 4139 4043 l 4146 4014 l 4152 3985 l
+ 4157 3958 l 4161 3932 l 4165 3907 l 4169 3881 l 4172 3856 l
+ 4176 3830 l 4180 3804 l 4185 3776 l 4191 3748 l 4198 3717 l
+ 4205 3686 l 4215 3652 l 4225 3615 l 4238 3577 l 4252 3536 l
+ 4268 3493 l 4285 3447 l 4305 3399 l 4327 3350 l 4350 3300 l
+ 4374 3249 l 4399 3199 l 4425 3150 l 4457 3093 l 4488 3041 l
+ 4516 2995 l 4541 2955 l 4562 2922 l 4580 2894 l 4594 2872 l
+ 4605 2855 l 4613 2841 l 4618 2832 l 4621 2825 l 4622 2821 l
+ 4621 2819 l 4620 2818 l 4619 2819 l 4617 2820 l 4617 2821 l
+ 4617 2822 l 4619 2822 l 4623 2822 l 4630 2821 l 4640 2818 l
+ 4654 2815 l 4672 2810 l 4695 2805 l 4722 2798 l 4754 2791 l
+ 4791 2785 l 4831 2779 l 4875 2775 l 4921 2774 l 4967 2776 l
+ 5014 2780 l 5060 2786 l 5105 2794 l 5149 2804 l 5192 2815 l
+ 5234 2827 l 5276 2841 l 5316 2855 l 5356 2870 l 5395 2886 l
+ 5433 2903 l 5471 2920 l 5508 2937 l 5543 2954 l 5578 2971 l
+ 5610 2987 l 5640 3002 l 5668 3017 l 5693 3030 l 5714 3042 l
+ 5732 3051 l 5747 3059 l 5758 3066 l 5766 3070 l 5771 3073 l
+ 5774 3074 l
+ 5775 3075 l gs col0 s gr 
+% Polyline
+45.000 slw
+n 9225 3600 m 9225 3601 l 9227 3604 l 9229 3609 l 9232 3616 l 9236 3627 l
+ 9242 3641 l 9249 3658 l 9258 3679 l 9269 3702 l 9280 3729 l
+ 9293 3759 l 9308 3790 l 9323 3824 l 9339 3859 l 9356 3895 l
+ 9374 3932 l 9393 3970 l 9412 4008 l 9432 4046 l 9452 4084 l
+ 9474 4123 l 9496 4161 l 9519 4200 l 9544 4238 l 9569 4277 l
+ 9596 4316 l 9624 4354 l 9654 4392 l 9685 4430 l 9717 4466 l
+ 9750 4500 l 9793 4541 l 9834 4576 l 9871 4605 l 9904 4627 l
+ 9931 4644 l 9953 4656 l 9971 4664 l 9984 4668 l 9994 4669 l
+ 10002 4668 l 10007 4666 l 10013 4662 l 10018 4658 l 10023 4654 l
+ 10031 4650 l 10041 4647 l 10054 4645 l 10072 4643 l 10094 4643 l
+ 10121 4644 l 10154 4645 l 10191 4647 l 10232 4649 l 10275 4650 l
+ 10318 4649 l 10360 4647 l 10397 4645 l 10430 4643 l 10459 4642 l
+ 10482 4642 l 10502 4643 l 10517 4644 l 10530 4647 l 10540 4650 l
+ 10549 4653 l 10556 4656 l 10564 4659 l 10572 4661 l 10581 4661 l
+ 10593 4659 l 10607 4655 l 10625 4647 l 10646 4635 l 10671 4619 l
+ 10699 4598 l 10731 4571 l 10765 4538 l 10800 4500 l 10829 4464 l
+ 10855 4426 l 10879 4389 l 10900 4352 l 10918 4318 l 10932 4287 l
+ 10944 4258 l 10953 4232 l 10959 4209 l 10963 4188 l 10966 4169 l
+ 10968 4152 l 10968 4135 l 10969 4119 l 10969 4102 l 10969 4085 l
+ 10970 4067 l 10973 4047 l 10976 4024 l 10981 3999 l 10988 3970 l
+ 10998 3938 l 11009 3902 l 11023 3862 l 11040 3818 l 11058 3772 l
+ 11079 3724 l 11100 3675 l 11125 3620 l 11148 3570 l 11169 3525 l
+ 11187 3487 l 11203 3456 l 11215 3431 l 11224 3411 l 11231 3397 l
+ 11236 3386 l 11239 3378 l 11242 3373 l 11244 3369 l 11246 3365 l
+ 11248 3360 l 11252 3354 l 11257 3346 l 11265 3335 l 11275 3320 l
+ 11288 3301 l 11304 3277 l 11324 3250 l 11347 3219 l 11372 3185 l
+ 11400 3150 l 11431 3114 l 11459 3081 l 11484 3051 l 11505 3026 l
+ 11521 3005 l 11532 2988 l 11540 2974 l 11544 2962 l 11545 2953 l
+ 11545 2945 l 11544 2937 l 11543 2931 l 11544 2924 l 11547 2917 l
+ 11554 2910 l 11565 2902 l 11582 2892 l 11606 2883 l 11638 2873 l
+ 11677 2863 l 11723 2855 l 11775 2850 l 11819 2849 l 11864 2850 l
+ 11908 2853 l 11953 2858 l 11996 2865 l 12039 2873 l 12080 2882 l
+ 12121 2892 l 12161 2904 l 12201 2916 l 12240 2929 l 12278 2942 l
+ 12315 2956 l 12352 2970 l 12387 2983 l 12421 2997 l 12453 3010 l
+ 12482 3023 l 12509 3034 l 12532 3045 l 12552 3053 l 12568 3061 l
+ 12581 3066 l 12590 3070 l 12595 3073 l 12599 3074 l
+ 12600 3075 l gs col0 s gr 
+/Times-Roman ff 225.00 scf sf
+7350 2775 m
+gs 1 -1 sc (0) col0 sh gr
+/Times-Roman ff 225.00 scf sf
+8250 2775 m
+gs 1 -1 sc (1) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+2250 1275 m
+gs 1 -1 sc (frame 0) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+8025 2700 m
+gs 1 -1 sc (T) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+7125 2700 m
+gs 1 -1 sc (T) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+11850 1275 m
+gs 1 -1 sc (frame 1) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+7725 1500 m
+gs 1 -1 sc (nodes) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+7725 1125 m
+gs 1 -1 sc (tested) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+6375 2250 m
+gs 1 -1 sc (termination nodes) col0 sh gr
+/Times-Roman ff 360.00 scf sf
+11175 4575 m
+gs 1 -1 sc (pull up) col0 sh gr
+% Ellipse
+7.500 slw
+n 4200 1200 168 168 0 360 DrawEllipse gs col7 1.00 shd ef gr gs col0 s gr
+
+/Times-Roman ff 360.00 scf sf
+12900 3075 m
+gs 1 -1 sc (pull down) col0 sh gr
+% Ellipse
+n 11100 1200 168 168 0 360 DrawEllipse gs col7 1.00 shd ef gr gs col0 s gr
+
+% Polyline
+0 slj
+n 11250 3450 m 11475 3075 l 11700 2850 l 11850 2850 l 12375 3000 l 12675 3075 l
+ 13050 3525 l 12675 3750 l 12150 3675 l 11625 3450 l
+ 11250 3450 l  cp gs col7 0.90 shd ef gr gs col0 s gr 
+% Polyline
+45.000 slw
+n 12675 3075 m
+ 13050 3525 l gs col0 s gr 
+% Polyline
+15.000 slw
+gs  clippath
+10305 3960 m 10245 3960 l 10245 4111 l 10275 3991 l 10305 4111 l cp
+eoclip
+n 10275 4425 m
+ 10275 3975 l gs col0 s gr gr
+
+% arrowhead
+7.500 slw
+n 10305 4111 m 10275 3991 l 10245 4111 l 10305 4111 l  cp gs 0.00 setgray ef gr  col0 s
+% here ends figure;
+$F2psEnd
+rs
+showpage
Index: trunk/VUT/doc/SciReport/figs/latency2.eps
===================================================================
--- trunk/VUT/doc/SciReport/figs/latency2.eps	(revision 243)
+++ trunk/VUT/doc/SciReport/figs/latency2.eps	(revision 243)
@@ -0,0 +1,387 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: latency2.fig
+%%Creator: fig2dev Version 3.2 Patchlevel 4
+%%CreationDate: Mon Aug 22 13:04:52 2005
+%%For: bittner@NOTES (Jiri Bittner,U-NOTES\bittner,S-1-5-21-1914904292-1436553889-1205156892-1000)
+%%BoundingBox: 0 0 992 393
+%%Magnification: 1.0000
+%%EndComments
+/$F2psDict 200 dict def
+$F2psDict begin
+$F2psDict /mtrx matrix put
+/col-1 {0 setgray} bind def
+/col0 {0.000 0.000 0.000 srgb} bind def
+/col1 {0.000 0.000 1.000 srgb} bind def
+/col2 {0.000 1.000 0.000 srgb} bind def
+/col3 {0.000 1.000 1.000 srgb} bind def
+/col4 {1.000 0.000 0.000 srgb} bind def
+/col5 {1.000 0.000 1.000 srgb} bind def
+/col6 {1.000 1.000 0.000 srgb} bind def
+/col7 {1.000 1.000 1.000 srgb} bind def
+/col8 {0.000 0.000 0.560 srgb} bind def
+/col9 {0.000 0.000 0.690 srgb} bind def
+/col10 {0.000 0.000 0.820 srgb} bind def
+/col11 {0.530 0.810 1.000 srgb} bind def
+/col12 {0.000 0.560 0.000 srgb} bind def
+/col13 {0.000 0.690 0.000 srgb} bind def
+/col14 {0.000 0.820 0.000 srgb} bind def
+/col15 {0.000 0.560 0.560 srgb} bind def
+/col16 {0.000 0.690 0.690 srgb} bind def
+/col17 {0.000 0.820 0.820 srgb} bind def
+/col18 {0.560 0.000 0.000 srgb} bind def
+/col19 {0.690 0.000 0.000 srgb} bind def
+/col20 {0.820 0.000 0.000 srgb} bind def
+/col21 {0.560 0.000 0.560 srgb} bind def
+/col22 {0.690 0.000 0.690 srgb} bind def
+/col23 {0.820 0.000 0.820 srgb} bind def
+/col24 {0.500 0.190 0.000 srgb} bind def
+/col25 {0.630 0.250 0.000 srgb} bind def
+/col26 {0.750 0.380 0.000 srgb} bind def
+/col27 {1.000 0.500 0.500 srgb} bind def
+/col28 {1.000 0.630 0.630 srgb} bind def
+/col29 {1.000 0.750 0.750 srgb} bind def
+/col30 {1.000 0.880 0.880 srgb} bind def
+/col31 {1.000 0.840 0.000 srgb} bind def
+
+end
+save
+newpath 0 393 moveto 0 0 lineto 992 0 lineto 992 393 lineto closepath clip newpath
+18.0 463.5 translate
+1 -1 scale
+
+/cp {closepath} bind def
+/ef {eofill} bind def
+/gr {grestore} bind def
+/gs {gsave} bind def
+/sa {save} bind def
+/rs {restore} bind def
+/l {lineto} bind def
+/m {moveto} bind def
+/rm {rmoveto} bind def
+/n {newpath} bind def
+/s {stroke} bind def
+/sh {show} bind def
+/slc {setlinecap} bind def
+/slj {setlinejoin} bind def
+/slw {setlinewidth} bind def
+/srgb {setrgbcolor} bind def
+/rot {rotate} bind def
+/sc {scale} bind def
+/sd {setdash} bind def
+/ff {findfont} bind def
+/sf {setfont} bind def
+/scf {scalefont} bind def
+/sw {stringwidth} bind def
+/tr {translate} bind def
+/tnt {dup dup currentrgbcolor
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add srgb}
+  bind def
+/shd {dup dup currentrgbcolor 4 -2 roll mul 4 -2 roll mul
+  4 -2 roll mul srgb} bind def
+/$F2psBegin {$F2psDict begin /$F2psEnteredState save def} def
+/$F2psEnd {$F2psEnteredState restore end} def
+
+$F2psBegin
+10 setmiterlimit
+0 slj 0 slc
+ 0.06000 0.06000 sc
+%
+% Fig objects follow
+%
+% 
+% here starts figure with depth 50
+/Times-Roman ff 480.00 scf sf
+-300 6825 m
+gs 1 -1 sc (GPU) col0 sh gr
+% Polyline
+15.000 slw
+n 3150 2400 m 4050 2400 l 4050 3000 l 3150 3000 l
+ cp gs col0 s gr 
+% Polyline
+n 4050 2400 m 4950 2400 l 4950 3000 l 4050 3000 l
+ cp gs col0 s gr 
+% Polyline
+n 4950 2400 m 5850 2400 l 5850 3000 l 4950 3000 l
+ cp gs col0 s gr 
+/Times-Roman ff 480.00 scf sf
+2475 2850 m
+gs 1 -1 sc (R1) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+3375 2850 m
+gs 1 -1 sc (R2) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+4275 2850 m
+gs 1 -1 sc (R3) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+5175 2850 m
+gs 1 -1 sc (Q4) col0 sh gr
+% Polyline
+n 6450 1200 m 7350 1200 l 7350 1800 l 6450 1800 l
+ cp gs col0 s gr 
+% Polyline
+n 7350 1200 m 8250 1200 l 8250 1800 l 7350 1800 l
+ cp gs col0 s gr 
+/Times-Roman ff 480.00 scf sf
+6675 1650 m
+gs 1 -1 sc (R4) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+7575 1650 m
+gs 1 -1 sc (Q5) col0 sh gr
+% Polyline
+n 7800 2400 m 8700 2400 l 8700 3000 l 7800 3000 l
+ cp gs col0 s gr 
+% Polyline
+n 8700 2400 m 9600 2400 l 9600 3000 l 8700 3000 l
+ cp gs col0 s gr 
+/Times-Roman ff 480.00 scf sf
+8025 2850 m
+gs 1 -1 sc (R4) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+8925 2850 m
+gs 1 -1 sc (Q5) col0 sh gr
+% Polyline
+n 10200 1200 m 11100 1200 l 11100 1800 l 10200 1800 l
+ cp gs col0 s gr 
+/Times-Roman ff 480.00 scf sf
+10425 1650 m
+gs 1 -1 sc (C5) col0 sh gr
+% Polyline
+gs  clippath
+15240 3735 m 15240 3615 l 14953 3615 l 15193 3675 l 14953 3735 l cp
+eoclip
+n 13725 3675 m
+ 15225 3675 l gs col0 s gr gr
+
+% arrowhead
+n 14953 3735 m 15193 3675 l 14953 3615 l 14953 3735 l  cp gs 0.00 setgray ef gr  col0 s
+/Times-Roman ff 480.00 scf sf
+14475 4125 m
+gs 1 -1 sc (t) col0 sh gr
+% Polyline
+gs  clippath
+15240 7335 m 15240 7215 l 14953 7215 l 15193 7275 l 14953 7335 l cp
+eoclip
+n 13725 7275 m
+ 15225 7275 l gs col0 s gr gr
+
+% arrowhead
+n 14953 7335 m 15193 7275 l 14953 7215 l 14953 7335 l  cp gs 0.00 setgray ef gr  col0 s
+/Times-Roman ff 480.00 scf sf
+14475 7725 m
+gs 1 -1 sc (t) col0 sh gr
+% Polyline
+n 11100 1200 m 12000 1200 l 12000 1800 l 11100 1800 l
+ cp gs col0 s gr 
+/Times-Roman ff 480.00 scf sf
+11325 1650 m
+gs 1 -1 sc (Q6) col0 sh gr
+% Polyline
+n 12450 2400 m 13350 2400 l 13350 3000 l 12450 3000 l
+ cp gs col0 s gr 
+/Times-Roman ff 480.00 scf sf
+12675 2850 m
+gs 1 -1 sc (Q6) col0 sh gr
+% Polyline
+n 13950 1200 m 14850 1200 l 14850 1800 l 13950 1800 l
+ cp gs col0 s gr 
+/Times-Roman ff 480.00 scf sf
+14250 1650 m
+gs 1 -1 sc (R6) col0 sh gr
+% Polyline
+n 15300 2400 m 16200 2400 l 16200 3000 l 15300 3000 l
+ cp gs col0 s gr 
+/Times-Roman ff 480.00 scf sf
+15525 2850 m
+gs 1 -1 sc (R6) col0 sh gr
+% Polyline
+gs  clippath
+6355 1901 m 6263 1825 l 6079 2045 l 6279 1900 l 6171 2122 l cp
+eoclip
+n 5925 2325 m
+ 6300 1875 l gs col0 s gr gr
+
+% arrowhead
+n 6171 2122 m 6279 1900 l 6079 2045 l 6171 2122 l  cp gs 0.00 setgray ef gr  col0 s
+/Times-Roman ff 480.00 scf sf
+6300 2475 m
+gs 1 -1 sc (V) col0 sh gr
+% Polyline
+gs  clippath
+10105 1901 m 10013 1825 l 9829 2045 l 10029 1900 l 9921 2122 l cp
+eoclip
+n 9675 2325 m
+ 10050 1875 l gs col0 s gr gr
+
+% arrowhead
+n 9921 2122 m 10029 1900 l 9829 2045 l 9921 2122 l  cp gs 0.00 setgray ef gr  col0 s
+/Times-Roman ff 480.00 scf sf
+10050 2475 m
+gs 1 -1 sc (I) col0 sh gr
+% Polyline
+gs  clippath
+13855 1901 m 13763 1825 l 13579 2045 l 13779 1900 l 13671 2122 l cp
+eoclip
+n 13425 2325 m
+ 13800 1875 l gs col0 s gr gr
+
+% arrowhead
+n 13671 2122 m 13779 1900 l 13579 2045 l 13671 2122 l  cp gs 0.00 setgray ef gr  col0 s
+/Times-Roman ff 480.00 scf sf
+13800 2475 m
+gs 1 -1 sc (V) col0 sh gr
+% Polyline
+n 8325 5100 m 9225 5100 l 9225 5700 l 8325 5700 l
+ cp gs col0 s gr 
+/Times-Roman ff 480.00 scf sf
+8550 5550 m
+gs 1 -1 sc (C5) col0 sh gr
+% Polyline
+n 6750 6300 m 7650 6300 l 7650 6900 l 6750 6900 l
+ cp gs col0 s gr 
+% Polyline
+n 7650 6300 m 8550 6300 l 8550 6900 l 7650 6900 l
+ cp gs col0 s gr 
+% Polyline
+n 2250 6300 m 3150 6300 l 3150 6900 l 2250 6900 l
+ cp gs col0 s gr 
+% Polyline
+n 3150 6300 m 4050 6300 l 4050 6900 l 3150 6900 l
+ cp gs col0 s gr 
+% Polyline
+n 4050 6300 m 4950 6300 l 4950 6900 l 4050 6900 l
+ cp gs col0 s gr 
+% Polyline
+n 4950 6300 m 5850 6300 l 5850 6900 l 4950 6900 l
+ cp gs col0 s gr 
+% Polyline
+n 5850 6300 m 6750 6300 l 6750 6900 l 5850 6900 l
+ cp gs col0 s gr 
+% Polyline
+n 8550 6300 m 9450 6300 l 9450 6900 l 8550 6900 l
+ cp gs col0 s gr 
+/Times-Roman ff 480.00 scf sf
+6975 6750 m
+gs 1 -1 sc (Q5) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+7875 6750 m
+gs 1 -1 sc (Q6) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+2475 6750 m
+gs 1 -1 sc (R1) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+3375 6750 m
+gs 1 -1 sc (R2) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+4275 6750 m
+gs 1 -1 sc (R3) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+5175 6750 m
+gs 1 -1 sc (Q4) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+6075 6750 m
+gs 1 -1 sc (R4) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+8775 6750 m
+gs 1 -1 sc (R6) col0 sh gr
+% Polyline
+gs  clippath
+8230 5801 m 8138 5725 l 7954 5945 l 8154 5800 l 8046 6022 l cp
+eoclip
+n 7800 6225 m
+ 8175 5775 l gs col0 s gr gr
+
+% arrowhead
+n 8046 6022 m 8154 5800 l 7954 5945 l 8046 6022 l  cp gs 0.00 setgray ef gr  col0 s
+/Times-Roman ff 480.00 scf sf
+8175 6225 m
+gs 1 -1 sc (I) col0 sh gr
+% Polyline
+n 900 1200 m 1800 1200 l 1800 1800 l 900 1800 l
+ cp gs col0 s gr 
+% Polyline
+n 1800 1200 m 2700 1200 l 2700 1800 l 1800 1800 l
+ cp gs col0 s gr 
+% Polyline
+n 2700 1200 m 3600 1200 l 3600 1800 l 2700 1800 l
+ cp gs col0 s gr 
+% Polyline
+n 3600 1200 m 4500 1200 l 4500 1800 l 3600 1800 l
+ cp gs col0 s gr 
+% Polyline
+n 5400 5100 m 6300 5100 l 6300 5700 l 5400 5700 l
+ cp gs col0 s gr 
+% Polyline
+n 6300 5100 m 7200 5100 l 7200 5700 l 6300 5700 l
+ cp gs col0 s gr 
+% Polyline
+n 900 5100 m 1800 5100 l 1800 5700 l 900 5700 l
+ cp gs col0 s gr 
+% Polyline
+n 1800 5100 m 2700 5100 l 2700 5700 l 1800 5700 l
+ cp gs col0 s gr 
+% Polyline
+n 2700 5100 m 3600 5100 l 3600 5700 l 2700 5700 l
+ cp gs col0 s gr 
+% Polyline
+n 3600 5100 m 4500 5100 l 4500 5700 l 3600 5700 l
+ cp gs col0 s gr 
+% Polyline
+n 4500 5100 m 5400 5100 l 5400 5700 l 4500 5700 l
+ cp gs col0 s gr 
+% Polyline
+n 7200 5100 m 8100 5100 l 8100 5700 l 7200 5700 l
+ cp gs col0 s gr 
+/Times-Roman ff 480.00 scf sf
+1125 1650 m
+gs 1 -1 sc (R1) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+2025 1650 m
+gs 1 -1 sc (R2) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+2925 1650 m
+gs 1 -1 sc (R3) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+3825 1650 m
+gs 1 -1 sc (Q4) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+-300 1650 m
+gs 1 -1 sc (CPU) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+-300 2925 m
+gs 1 -1 sc (GPU) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+5625 5550 m
+gs 1 -1 sc (Q5) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+6525 5550 m
+gs 1 -1 sc (Q6) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+1125 5550 m
+gs 1 -1 sc (R1) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+2025 5550 m
+gs 1 -1 sc (R2) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+2925 5550 m
+gs 1 -1 sc (R3) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+3825 5550 m
+gs 1 -1 sc (Q4) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+4725 5550 m
+gs 1 -1 sc (R4) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+7425 5550 m
+gs 1 -1 sc (R6) col0 sh gr
+/Times-Roman ff 480.00 scf sf
+-300 5550 m
+gs 1 -1 sc (CPU) col0 sh gr
+% Polyline
+n 2250 2400 m 3150 2400 l 3150 3000 l 2250 3000 l
+ cp gs col0 s gr 
+% here ends figure;
+$F2psEnd
+rs
+showpage
Index: trunk/VUT/doc/SciReport/figs/makefile
===================================================================
--- trunk/VUT/doc/SciReport/figs/makefile	(revision 243)
+++ trunk/VUT/doc/SciReport/figs/makefile	(revision 243)
@@ -0,0 +1,45 @@
+
+FIG := $(shell ls *.fig)
+
+OBJ := $(shell ls *.obj)
+
+EPS = ${FIG:.fig=.eps} ${OBJ:.obj=.eps}
+
+PDF = ${FIG:.fig=.pdf} ${OBJ:.obj=.pdf}
+
+
+DEFAULT: $(EPS) $(PDF)
+
+pdf:
+	@make $(PDF)
+
+eps:
+	@make $(EPS)
+
+clean:
+	rm -f $(EPS) $(PDF)
+
+
+.SUFFIXES: .fig .eps .pdf .obj
+
+
+.fig.eps: 
+	@echo "Converting $< to $@ ..."
+	@fig2dev -L eps $< $@
+	@echo "done."
+
+.eps.pdf: 
+	@echo "Converting $< to $@ ..."
+	@epstopdf $<
+	@echo "done."
+
+
+.obj.eps: 
+	@echo "Converting $< to $@ ..."
+	@tgif -print -color -eps $< $@
+	@echo "done."
+
+#.obj.pdf: 
+#	@echo "Converting $< to $@ ..."
+#	@tgif -eps $< $@
+#	@echo "done."
Index: trunk/VUT/doc/SciReport/code/pullup.txt
===================================================================
--- trunk/VUT/doc/SciReport/code/pullup.txt	(revision 243)
+++ trunk/VUT/doc/SciReport/code/pullup.txt	(revision 243)
@@ -0,0 +1,11 @@
+void     NV_PureKdTreeRenderAction::KdTreeNode::MakeParentsVisible() 
+{ 
+     register KdTreeNode * pTempNode     = m_pParent; 
+ 
+     while ((pTempNode) && (!pTempNode->m_bVisible)) 
+     { 
+          //pTempNode->m_bCut          = FALSE; 
+          pTempNode->m_bVisible     = TRUE; 
+          pTempNode     = pTempNode->m_pParent; 
+     } 
+} 
Index: trunk/VUT/doc/SciReport/code/actualcode.tex
===================================================================
--- trunk/VUT/doc/SciReport/code/actualcode.tex	(revision 243)
+++ trunk/VUT/doc/SciReport/code/actualcode.tex	(revision 243)
@@ -0,0 +1,105 @@
+\input default.mac
+\keya{}\leftline{void\symbol{}\ \normal{}NV_PureKdTreeRenderAction\symbol{}::\normal{}TraverseNode\symbol{}(\normal{}KdTreeNode\symbol{}\ *\normal{}pCurrNode\symbol{}) }
+\leftline{ 1:\ \ \ $\{$ }
+\leftline{ 2:\ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}pCurrNode\symbol{}->\normal{}m_bLeaf\symbol{}) }
+\leftline{ 3:\ \ \ \ \ \ \ \ \ \ $\{$ }
+\leftline{ 4:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \comment{}//\ this\ has\ a\ frame\ counter\ to\ prevent\ double\ rendering }
+\symbol{}\leftline{ 5:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}pCurrNode\symbol{}->\normal{}RenderGeometry\symbol{}(); }
+\leftline{ 6:\ \ \ \ \ \ \ \ \ \ $\}$ }
+\leftline{ 7:\ \ \ \ \ \ \ \ \ \ \keya{}else\symbol{} }
+\leftline{ 8:\ \ \ \ \ \ \ \ \ \ $\{$ }
+\leftline{ 9:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}Point3f\symbol{}\ \ \ \ \ \ \normal{}ptViewpoint\symbol{}\ \ =\ \normal{}GetState\symbol{}()->\normal{}GetCamera\symbol{}()->\normal{}GetPosition\symbol{}(); }
+\leftline{10:\ \ \  }
+\leftline{11:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \comment{}//----\ insert\ the\ children\ in\ the\ reverse\ order\ as\ they\ shall\ be\ dealt\ with }
+\symbol{}\leftline{12:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}ptViewpoint\symbol{}[\normal{}pCurrNode\symbol{}->\normal{}m_iSplitAxis\symbol{}]\ >\ \normal{}pCurrNode\symbol{}->\normal{}m_fSplitValue\symbol{}) }
+\leftline{13:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ $\{$ }
+\leftline{14:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}m_TraverseStack.Push\symbol{}(\normal{}pCurrNode\symbol{}->\normal{}m_pLeftChild\symbol{}); }
+\leftline{15:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}m_TraverseStack.Push\symbol{}(\normal{}pCurrNode\symbol{}->\normal{}m_pRightChild\symbol{}); }
+\leftline{16:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ $\}$ }
+\leftline{17:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \keya{}else\symbol{} }
+\leftline{18:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ $\{$ }
+\leftline{19:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}m_TraverseStack.Push\symbol{}(\normal{}pCurrNode\symbol{}->\normal{}m_pRightChild\symbol{}); }
+\leftline{20:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}m_TraverseStack.Push\symbol{}(\normal{}pCurrNode\symbol{}->\normal{}m_pLeftChild\symbol{}); }
+\leftline{21:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ $\}$ }
+\leftline{22:\ \ \ \ \ \ \ \ \ \ $\}$\ \comment{}//\ no\ leaf }
+\symbol{}\leftline{23:\ \ \ $\}$ }
+\leftline{24:\ \ \  }
+\leftline{25:\ \ \  }
+\comment{}\leftline{26:\ \ \ //----\ the\ actual\ render\ algorithm }
+\keya{}\leftline{27:\ \ \ void\symbol{}\ \ \ \normal{}NV_PureKdTreeRenderAction\symbol{}::\normal{}RenderSorted\symbol{}() }
+\leftline{28:\ \ \ $\{$ }
+\leftline{29:\ \ \ \ \ \ \ \ \ \ \normal{}KdTreeNode\symbol{}\ \ \ \ *\ \normal{}pCurrNode\symbol{}; }
+\leftline{30:\ \ \ \ \ \ \ \ \ \ \keya{}int\symbol{}\ \ \ \ \ \ \normal{}iTestCounter\symbol{}\ \ \ \ =\ \normal{}0\symbol{}; }
+\leftline{31:\ \ \  }
+\leftline{32:\ \ \ \ \ \ \ \ \ \ \comment{}//----\ clear\ the\ two\ needed\ datastructures }
+\symbol{}\leftline{33:\ \ \ \ \ \ \ \ \ \ \normal{}m_TraverseStack.Clear\symbol{}(); }
+\leftline{34:\ \ \ \ \ \ \ \ \ \ \normal{}m_NVTestQueue.Clear\symbol{}(); }
+\leftline{35:\ \ \  }
+\leftline{36:\ \ \ \ \ \ \ \ \ \ \comment{}//----\ generate\ the\ occlusion\ queries }
+\symbol{}\leftline{37:\ \ \ \ \ \ \ \ \ \ \normal{}glGenOcclusionQueriesNV\symbol{}(\normal{}m_nNumNodes\symbol{},\ \normal{}m_pOcclusionQueries\symbol{}); }
+\leftline{38:\ \ \  }
+\leftline{39:\ \ \ \ \ \ \ \ \ \ \comment{}//----\ take\ the\ root\ as\ a\ start }
+\symbol{}\leftline{40:\ \ \ \ \ \ \ \ \ \ \normal{}m_pKdTree\symbol{}->\normal{}m_iPlaneMask\symbol{}\ \ \ \ \ \ \ =\ \normal{}0x3f\symbol{};\ \ \ \ \ \ \ \comment{}//\ =\ 0011\ 1111\ which\ means\ that\ at\ the\ beginning,\ all\ six\ planes\ have\ to\ frustum\ culled }
+\symbol{}\leftline{41:\ \ \ \ \ \ \ \ \ \ \normal{}m_TraverseStack.Push\symbol{}(\normal{}m_pKdTree\symbol{}); }
+\leftline{42:\ \ \  }
+\leftline{43:\ \ \ \ \ \ \ \ \ \ \comment{}//----\ the\ loop }
+\symbol{}\leftline{44:\ \ \ \ \ \ \ \ \ \ \keya{}while\symbol{}\ ((!\normal{}m_TraverseStack.Empty\symbol{}())\ ||\ (!\normal{}m_NVTestQueue.Empty\symbol{}())) }
+\leftline{45:\ \ \ \ \ \ \ \ \ \ $\{$ }
+\leftline{46:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}bool\symbol{}\ \normal{}result_available\symbol{}; }
+\leftline{47:\ \ \  }
+\leftline{48:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \keya{}while\symbol{}\ (!\normal{}m_NVTestQueue.Empty\symbol{}()\ \&\&\  }
+\leftline{49:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ (\normal{}m_TraverseStack.Empty\symbol{}()\ || }
+\leftline{50:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ (\normal{}result_available\symbol{}\ =\ \normal{}ResultAvailable\symbol{}(\normal{}m_NVTestQueue.GetFirst\symbol{}()->\normal{}m_nTest\symbol{})) }
+\leftline{51:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ ) }
+\leftline{52:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ ) }
+\leftline{53:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ $\{$ }
+\leftline{54:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}pCurrNode\symbol{}\ =\ \normal{}m_NVTestQueue.GetFirst\symbol{}();\ \normal{}m_NVTestQueue.RemoveFirst\symbol{}(); }
+\leftline{55:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \  }
+\leftline{56:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \comment{}//\ the\ next\ line\ is\ only\ interesting\ if\ we\ want\ to\ avoid\ double\ rendering\ already\ here: }
+\symbol{}\leftline{57:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \comment{}//bool\ was_visible\ =\ pCurrNode->m_bVisible\ \&\&\ (m_nLastVisitedId\ ==\ (GetCurrentFrame()\ -\ 1)); }
+\symbol{}\leftline{58:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \  }
+\leftline{59:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \comment{}//\ update\ visibility\ classification\ (this\ is\ the\ wait\ variety!) }
+\symbol{}\leftline{60:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}pCurrNode\symbol{}->\normal{}m_bVisible\symbol{}\ =\ \normal{}GetVisiblePixels\symbol{}(\normal{}pCurrNode\symbol{}->\normal{}m_nTest\symbol{})\ >\ \normal{}Settings\symbol{}::\normal{}Global\symbol{}()->\normal{}get_nvocc_pixel_treshold\symbol{}(); }
+\leftline{61:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}pCurrNode\symbol{}->\normal{}m_nLastVisitedId\symbol{}\ =\ \normal{}GetCurrentFrame\symbol{}(); }
+\leftline{62:\ \ \  }
+\leftline{63:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}pCurrNode\symbol{}->\normal{}m_bVisible\symbol{})\ \comment{}//\ \&\&\ !was_visible)\ \ \ \ \ \ //\ note:\ could\ prevent\ double\ rendering\ already\ here! }
+\symbol{}\leftline{64:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ $\{$ }
+\leftline{65:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}pCurrNode\symbol{}->\normal{}MakeParentsVisible\symbol{}(); }
+\leftline{66:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}TraverseNode\symbol{}(\normal{}pCurrNode\symbol{}); }
+\leftline{67:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ $\}$\ \comment{}//\ visible }
+\symbol{}\leftline{68:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ $\}$ }
+\leftline{69:\ \ \  }
+\leftline{70:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \comment{}//----\ the\ second\ part\ manages\ the\ distance\ heap }
+\symbol{}\leftline{71:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (!\normal{}m_TraverseStack.Empty\symbol{}()) }
+\leftline{72:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ $\{$ }
+\leftline{73:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \comment{}//----\ get\ the\ element\ with\ the\ lowest\ distance }
+\symbol{}\leftline{74:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}pCurrNode\symbol{}\ \ \ =\ \normal{}m_TraverseStack.Pop\symbol{}();\ \ \ \ \ \ \ \ \ \ \  }
+\leftline{75:\ \ \  }
+\leftline{76:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \comment{}//\ question:\ what\ is\ the\ difference\ if\ we\ do\ frustum\ culling\ only\ after\ setting\ visibility? }
+\symbol{}\leftline{77:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}pCurrNode\symbol{}->\normal{}IsWithinViewFrustum\symbol{}()) }
+\leftline{78:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ $\{$ }
+\leftline{79:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}bool\symbol{}\ \normal{}was_visible\symbol{}\ =\ \normal{}pCurrNode\symbol{}->\normal{}m_bVisible\symbol{}\ \&\&\ (\normal{}pCurrNode\symbol{}->\normal{}m_nLastVisitedId\symbol{}\ ==\ (\normal{}GetCurrentFrame\symbol{}()\ -\ \normal{}1\symbol{})); }
+\leftline{80:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \  }
+\leftline{81:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \comment{}//\ note:\ this\ is\ actually\ only\ done\ for\ internal\ nodes\ and\ could\ be\ skipped\ for\ leaf\ nodes }
+\symbol{}\leftline{82:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \comment{}//\ in\ which\ case\ leaf\ node\ double\ rendering\ could\ be\ prevented\ here\ (see\ above) }
+\symbol{}\leftline{83:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}pCurrNode\symbol{}->\normal{}m_bVisible\symbol{}\ =\ \normal{}FALSE\symbol{}; }
+\leftline{84:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}pCurrNode\symbol{}->\normal{}m_nLastVisitedId\symbol{}\ =\ \normal{}GetCurrentFrame\symbol{}(); }
+\leftline{85:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \  }
+\leftline{86:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}pCurrNode\symbol{}->\normal{}m_bLeaf\symbol{}\ ||\ !\normal{}was_visible\symbol{}) }
+\leftline{87:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ $\{$ }
+\leftline{88:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}pCurrNode\symbol{}->\normal{}m_pSuccessor\symbol{}->\normal{}IssueNVTest\symbol{}(\normal{}m_pOcclusionQueries\symbol{}[\normal{}iTestCounter\symbol{}]))\ ++\normal{}iTestCounter\symbol{}; }
+\leftline{89:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}m_NVTestQueue.Append\symbol{}(\normal{}pCurrNode\symbol{}); }
+\leftline{90:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ $\}$ }
+\leftline{91:\ \ \  }
+\leftline{92:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}was_visible\symbol{}) }
+\leftline{93:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ $\{$ }
+\leftline{94:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}TraverseNode\symbol{}(\normal{}pCurrNode\symbol{}); }
+\leftline{95:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ $\}$ }
+\leftline{96:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ $\}$ }
+\leftline{97:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ $\}$ }
+\leftline{98:\ \ \ \ \ \ \ \ \ \ $\}$ }
+\leftline{99:\ \ \  }
+\leftline{100:\ \ \ \ \ \ \ \ \ \ \comment{}//----\ tell\ the\ driver\ that\ the\ occlusion\ queries\ won't\ be\ needed\ any\ more }
+\symbol{}\leftline{101:\ \ \ \ \ \ \ \ \ \ \normal{}glDeleteOcclusionQueriesNV\symbol{}(\normal{}m_nNumNodes\symbol{},\ \normal{}m_pOcclusionQueries\symbol{}); }
+\leftline{102:\ \ \  }
+\leftline{103:\ \ \ $\}$
Index: trunk/VUT/doc/SciReport/code/c2tex.tex
===================================================================
--- trunk/VUT/doc/SciReport/code/c2tex.tex	(revision 243)
+++ trunk/VUT/doc/SciReport/code/c2tex.tex	(revision 243)
@@ -0,0 +1,532 @@
+\input default.mac
+\symbol{}\leftline{ }
+\comment{}\leftline{ 1:\ \ \ /************************************************************************** }
+\leftline{ 2:\ \ \ c2tex\ -\ Konverze\ C++\ do\ TeXu }
+\leftline{ 3:\ \ \ Jiri\ Bittner,\ Cerven\ 1996 }
+\leftline{ 4:\ \ \ **************************************************************************/\symbol{} }
+\leftline{ 5:\ \ \  }
+\keyb{}\leftline{ 6:\ \ \ \#include\symbol{}\ <\normal{}stdlib.h\symbol{}> }
+\keyb{}\leftline{ 7:\ \ \ \#include\symbol{}\ <\normal{}stdio.h\symbol{}> }
+\keyb{}\leftline{ 8:\ \ \ \#include\symbol{}\ <\normal{}string.h\symbol{}> }
+\keyb{}\leftline{ 9:\ \ \ \#include\symbol{}\ <\normal{}iostream.h\symbol{}> }
+\keyb{}\leftline{10:\ \ \ \#include\symbol{}\ <\normal{}fstream.h\symbol{}> }
+\leftline{11:\ \ \  }
+\leftline{12:\ \ \  }
+\keyb{}\leftline{13:\ \ \ \#define\symbol{}\ \ \ \ \ \ \ \ \normal{}KEYWORD1\symbol{}\ \ \ \ \ \ \ \normal{}1\symbol{}\ \ \ \ \ \comment{}//\ kody\ pro\ jednotlive\ znacky }
+\keyb{}\leftline{14:\ \ \ \#define\symbol{}\ \ \ \ \ \ \ \ \normal{}KEYWORD2\symbol{}\ \ \ \ \ \ \ \normal{}2\symbol{} }
+\keyb{}\leftline{15:\ \ \ \#define\symbol{}\ \ \ \ \ \ \ \ \normal{}SYMBOL\symbol{}\ \ \ \ \ \ \ \ \ \normal{}3\symbol{} }
+\keyb{}\leftline{16:\ \ \ \#define\symbol{}\ \ \ \ \ \ \ \ \normal{}COMMENT\symbol{}\ \ \ \ \ \ \ \ \normal{}4\symbol{} }
+\keyb{}\leftline{17:\ \ \ \#define\symbol{}\ \ \ \ \ \ \ \ \normal{}NORMAL\symbol{}\ \ \ \ \ \ \ \ \ \normal{}5\symbol{} }
+\leftline{18:\ \ \  }
+\keyb{}\leftline{19:\ \ \ \#define\symbol{}\ \ \ \ \ \ \ \ \normal{}WORD\symbol{}\ \ \ \normal{}10\symbol{} }
+\leftline{20:\ \ \  }
+\keyb{}\leftline{21:\ \ \ \#define\symbol{}\ \ \ \ \ \ \ \ \normal{}S_LEN\symbol{}\ \ \normal{}256\symbol{} }
+\leftline{22:\ \ \  }
+\keya{}\leftline{23:\ \ \ int\symbol{}\ \keya{}pascal\symbol{}=\normal{}0\symbol{}; }
+\leftline{24:\ \ \  }
+\keya{}\leftline{25:\ \ \ char\symbol{}\ \normal{}comment_1b\symbol{}='/',\normal{}comment_2b\symbol{}='*',\normal{}comment_1e\symbol{}='*',\normal{}comment_2e\symbol{}='/'; }
+\leftline{26:\ \ \  }
+\keya{}\leftline{27:\ \ \ class\symbol{}\ \normal{}BaseC\symbol{} }
+\leftline{28:\ \ \ $\{$ }
+\leftline{29:\ \ \  }
+\leftline{30:\ \ \ $\}$; }
+\leftline{31:\ \ \  }
+\leftline{32:\ \ \  }
+\keya{}\leftline{33:\ \ \ typedef\symbol{}\ \keya{}double\symbol{}\ \normal{}Real\symbol{}; }
+\leftline{34:\ \ \  }
+\leftline{35:\ \ \  }
+\keya{}\leftline{36:\ \ \ class\symbol{}\ \normal{}OptionsC\symbol{}\ :\ \keya{}public\symbol{}\ \normal{}BaseC\symbol{} }
+\leftline{37:\ \ \ $\{$ }
+\keya{}\leftline{38:\ \ \ public\symbol{}: }
+\leftline{39:\ \ \  }
+\leftline{40:\ \ \ \ \ \keya{}int\symbol{}\ \ \ \ \normal{}number\symbol{}; }
+\leftline{41:\ \ \ \ \ \keya{}char\symbol{}\ **\normal{}strings\symbol{}; }
+\leftline{42:\ \ \ \ \  }
+\comment{}\leftline{43:\ \ \ //\ \ OptionsC()\ $\{$\ number=0;\ $\}$ }
+\symbol{}\leftline{44:\ \ \ \ \ \normal{}OptionsC\symbol{}(\keya{}int\symbol{}\ \normal{}n\symbol{},\keya{}char\symbol{}\ **\normal{}a\symbol{})\ $\{$\ \normal{}init\symbol{}(\normal{}n\symbol{},\normal{}a\symbol{});\ $\}$ }
+\leftline{45:\ \ \  }
+\leftline{46:\ \ \ \ \ \keya{}void\symbol{}\ \normal{}init\symbol{}(\keya{}int\symbol{}\ \normal{}n\symbol{},\keya{}char\symbol{}\ **\normal{}s\symbol{})\ $\{$\ \normal{}number\symbol{}=\normal{}n\symbol{};\ \normal{}strings\symbol{}=\normal{}s\symbol{};\ $\}$ }
+\leftline{47:\ \ \ \ \ \keya{}int\symbol{}\ \normal{}isOption\symbol{}(\keya{}char\symbol{}\ *\normal{}string\symbol{}); }
+\leftline{48:\ \ \ \ \ \keya{}int\symbol{}\ \normal{}isOption\symbol{}(\keya{}char\symbol{}\ *\normal{}string\symbol{},\keya{}int\symbol{}\ *\normal{}number\symbol{}); }
+\leftline{49:\ \ \ \ \ \keya{}int\symbol{}\ \normal{}getParam\symbol{}(\keya{}char\symbol{}\ *\normal{}s\symbol{},\keya{}int\symbol{}\ \normal{}n\symbol{}=\normal{}1\symbol{}); }
+\leftline{50:\ \ \  }
+\leftline{51:\ \ \ \ \ \keya{}int\symbol{}\ \normal{}getOptionValue\symbol{}(\keya{}char\symbol{}\ *\normal{}string\symbol{},\keya{}int\symbol{}\ *\normal{}result\symbol{}); }
+\leftline{52:\ \ \ \ \ \keya{}int\symbol{}\ \normal{}getOptionValue\symbol{}(\keya{}char\symbol{}\ *\normal{}string\symbol{},\normal{}Real\symbol{}\ *\normal{}r\symbol{}); }
+\leftline{53:\ \ \ \ \ \keya{}int\symbol{}\ \normal{}getOptionValue\symbol{}(\keya{}char\symbol{}\ *\normal{}string\symbol{},\keya{}char\symbol{}\ *\normal{}result\symbol{}); }
+\leftline{54:\ \ \  }
+\leftline{55:\ \ \ $\}$; }
+\leftline{56:\ \ \  }
+\leftline{57:\ \ \  }
+\keya{}\leftline{58:\ \ \ class\symbol{}\ \normal{}LexanC\symbol{}:\ \keya{}public\symbol{}\ \normal{}BaseC\symbol{} }
+\leftline{59:\ \ \ $\{$ }
+\keya{}\leftline{60:\ \ \ public\symbol{}: }
+\normal{}\leftline{61:\ \ \ FILE\symbol{}\ *\normal{}file\symbol{}; }
+\leftline{62:\ \ \  }
+\keya{}\leftline{63:\ \ \ int\symbol{}\ \ \ \ \normal{}nsep\symbol{},\normal{}nkey\symbol{}[\normal{}2\symbol{}]; }
+\keya{}\leftline{64:\ \ \ char\symbol{}\ \ \ *\normal{}separators\symbol{}; }
+\keya{}\leftline{65:\ \ \ char\symbol{}\ \ \ **\normal{}key\symbol{}[\normal{}2\symbol{}]; }
+\leftline{66:\ \ \  }
+\normal{}\leftline{67:\ \ \ LexanC\symbol{}()$\{$\normal{}init\symbol{}("\normal{}default.lex\symbol{}");$\}$ }
+\leftline{68:\ \ \  }
+\keya{}\leftline{69:\ \ \ int\symbol{}\ \ \ \ \normal{}isSeparator\symbol{}(\keya{}int\symbol{}\ \normal{}c\symbol{})$\{$\ \keya{}return\symbol{}\ \normal{}strchr\symbol{}(\normal{}separators\symbol{},\normal{}c\symbol{})!=\normal{}NULL\symbol{};\ $\}$ }
+\keya{}\leftline{70:\ \ \ int\symbol{}\ \ \ \ \normal{}isKey\symbol{}(\keya{}char\symbol{}\ *\normal{}s\symbol{}); }
+\leftline{71:\ \ \  }
+\keya{}\leftline{72:\ \ \ int\symbol{}\ \ \ \ \normal{}init\symbol{}(\keya{}const\symbol{}\ \keya{}char\symbol{}\ *\normal{}lexname\symbol{}); }
+\keya{}\leftline{73:\ \ \ int\symbol{}\ \ \ \ \normal{}open\symbol{}(\keya{}const\symbol{}\ \keya{}char\symbol{}\ *\normal{}filename\symbol{}); }
+\leftline{74:\ \ \  }
+\keya{}\leftline{75:\ \ \ int\symbol{}\ \ \ \ \normal{}readWord\symbol{}(\normal{}FILE\symbol{}\ *\normal{}f\symbol{},\keya{}char\symbol{}\ *\normal{}string\symbol{}); }
+\leftline{76:\ \ \  }
+\keya{}\leftline{77:\ \ \ int\symbol{}\ \ \ \ \normal{}read\symbol{}(\keya{}char\symbol{}\ *\normal{}string\symbol{}); }
+\keya{}\leftline{78:\ \ \ void\symbol{}\ \ \ \normal{}close\symbol{}()$\{$\normal{}fclose\symbol{}(\normal{}file\symbol{});$\}$ }
+\leftline{79:\ \ \  }
+\keya{}\leftline{80:\ \ \ virtual\symbol{}\ \ \ \ \ \ \ \ \normal{}ostream\symbol{}\&\ \keya{}operator\symbol{}>>(\normal{}ostream\symbol{}\ \&\normal{}s\symbol{})\ $\{$\  }
+\leftline{81:\ \ \ \ \ \ \ \ \ \ \normal{}s\symbol{}<<\normal{}nsep\symbol{}<<"\\normal{}n\symbol{}"<<\normal{}nkey\symbol{}[\normal{}0\symbol{}]<<"\\normal{}n\symbol{}"<<\normal{}nkey\symbol{}[\normal{}1\symbol{}]<<"\\normal{}n\symbol{}"; }
+\leftline{82:\ \ \ \ \ \ \ \ \ \ \keya{}return\symbol{}\ \normal{}s\symbol{}; }
+\leftline{83:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ $\}$ }
+\leftline{84:\ \ \ \~{}\normal{}LexanC\symbol{}()$\{$\normal{}fclose\symbol{}(\normal{}file\symbol{});$\}$ }
+\leftline{85:\ \ \ $\}$; }
+\leftline{86:\ \ \  }
+\keya{}\leftline{87:\ \ \ class\symbol{}\ \normal{}TexC\symbol{}:\ \keya{}public\symbol{}\ \normal{}BaseC\symbol{} }
+\leftline{88:\ \ \ $\{$ }
+\keya{}\leftline{89:\ \ \ public\symbol{}: }
+\leftline{90:\ \ \ \ \ \normal{}FILE\symbol{}\ *\normal{}file\symbol{}; }
+\leftline{91:\ \ \ \ \ \keya{}int\symbol{}\ \normal{}numbers\symbol{}; }
+\leftline{92:\ \ \ \ \ \keya{}int\symbol{}\ \normal{}lnumber\symbol{}; }
+\leftline{93:\ \ \ \ \  }
+\leftline{94:\ \ \ \ \ \normal{}TexC\symbol{}()$\{$\normal{}numbers\symbol{}=\normal{}0\symbol{};\ \normal{}init\symbol{}("\normal{}output.tex\symbol{}");$\}$ }
+\leftline{95:\ \ \ \ \ \normal{}TexC\symbol{}(\keya{}int\symbol{}\ \normal{}n\symbol{},\ \keya{}const\symbol{}\ \keya{}char\symbol{}\ *\normal{}s\symbol{})$\{$ }
+\leftline{96:\ \ \ \ \ \ \ \normal{}lnumber\symbol{}=\normal{}0\symbol{}; }
+\leftline{97:\ \ \ \ \ \ \ \normal{}numbers\symbol{}=\normal{}n\symbol{};\ \normal{}init\symbol{}(\normal{}s\symbol{});$\}$ }
+\leftline{98:\ \ \ \ \  }
+\leftline{99:\ \ \ \ \ \keya{}int\symbol{}\ \normal{}init\symbol{}(\keya{}const\symbol{}\ \keya{}char\symbol{}\ *\normal{}filename\symbol{}); }
+\leftline{100:\ \ \ \ \ \keya{}int\symbol{}\ \normal{}write\symbol{}(\keya{}const\symbol{}\ \keya{}int\symbol{}\ \normal{}code\symbol{},\keya{}const\symbol{}\ \keya{}char\symbol{}\ *\normal{}string\symbol{}); }
+\leftline{101:\ \ \ \ \ \~{}\normal{}TexC\symbol{}()\ $\{$\ \comment{}/*\ fprintf(file,"\n\\bye\n");\ */\symbol{}\ \normal{}fclose\symbol{}(\normal{}file\symbol{});$\}$ }
+\leftline{102:\ \ \  }
+\leftline{103:\ \ \ $\}$; }
+\leftline{104:\ \ \  }
+\leftline{105:\ \ \  }
+\leftline{106:\ \ \  }
+\leftline{107:\ \ \  }
+\leftline{108:\ \ \  }
+\leftline{109:\ \ \  }
+\leftline{110:\ \ \  }
+\leftline{111:\ \ \  }
+\keya{}\leftline{112:\ \ \ int\symbol{}\ \normal{}OptionsC\symbol{}::\normal{}isOption\symbol{}(\keya{}char\symbol{}\ *\normal{}s\symbol{}) }
+\leftline{113:\ \ \ $\{$ }
+\keya{}\leftline{114:\ \ \ int\symbol{}\ \normal{}found\symbol{}=\normal{}0\symbol{}; }
+\leftline{115:\ \ \ \  }
+\leftline{116:\ \ \ \ \keya{}for\symbol{}\ (\keya{}int\symbol{}\ \normal{}i\symbol{}=\normal{}1\symbol{};\normal{}i\symbol{}<\normal{}number\symbol{};\normal{}i\symbol{}++) }
+\leftline{117:\ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}strcmp\symbol{}(\normal{}s\symbol{},\normal{}strings\symbol{}[\normal{}i\symbol{}])==\normal{}0\symbol{})\ $\{$\ \normal{}found\symbol{}\ =\ \normal{}i\symbol{};\ \keya{}break\symbol{};$\}$ }
+\leftline{118:\ \ \  }
+\leftline{119:\ \ \ \ \keya{}return\symbol{}\ \normal{}found\symbol{}; }
+\leftline{120:\ \ \ $\}$ }
+\leftline{121:\ \ \  }
+\keya{}\leftline{122:\ \ \ int\symbol{}\ \normal{}OptionsC\symbol{}::\normal{}isOption\symbol{}(\keya{}char\symbol{}\ *\normal{}s\symbol{},\keya{}int\symbol{}\ *\normal{}n\symbol{}) }
+\leftline{123:\ \ \ $\{$ }
+\keya{}\leftline{124:\ \ \ int\symbol{}\ \normal{}found\symbol{}=\normal{}0\symbol{}; }
+\leftline{125:\ \ \  }
+\keya{}\leftline{126:\ \ \ for\symbol{}\ (\keya{}int\symbol{}\ \normal{}i\symbol{}=\normal{}1\symbol{};\normal{}i\symbol{}<\normal{}number\symbol{};\normal{}i\symbol{}++) }
+\leftline{127:\ \ \ \ \ \keya{}if\symbol{}\ (\normal{}strcmp\symbol{}(\normal{}s\symbol{},\normal{}strings\symbol{}[\normal{}i\symbol{}])==\normal{}0\symbol{}) }
+\leftline{128:\ \ \ \ \ \ \ $\{$ }
+\leftline{129:\ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}i\symbol{}+\normal{}1\symbol{}<\normal{}number\symbol{}) }
+\leftline{130:\ \ \ \ \ \ \ \ \ \ $\{$ }
+\leftline{131:\ \ \ \ \ \ \ \ \ \ \ \ *\normal{}n\symbol{}=\normal{}atoi\symbol{}(\normal{}strings\symbol{}[\normal{}i\symbol{}+\normal{}1\symbol{}]); }
+\leftline{132:\ \ \ \ \ \ \ \ \ \ \ \ \normal{}found\symbol{}\ =\ \normal{}i\symbol{}; }
+\leftline{133:\ \ \ \ \ \ \ \ \ \ \ \ \keya{}break\symbol{}; }
+\leftline{134:\ \ \ \ \ \ \ \ \ \ $\}$ }
+\leftline{135:\ \ \ \ \ \ \ $\}$ }
+\leftline{136:\ \ \  }
+\keya{}\leftline{137:\ \ \ return\symbol{}\ \normal{}found\symbol{}; }
+\leftline{138:\ \ \ $\}$ }
+\leftline{139:\ \ \  }
+\leftline{140:\ \ \  }
+\comment{}\leftline{141:\ \ \ //\ search\ for\ occurence\ of\ non-option }
+\keya{}\leftline{142:\ \ \ int\symbol{}\ \normal{}OptionsC\symbol{}::\normal{}getParam\symbol{}(\keya{}char\symbol{}\ *\normal{}s\symbol{},\keya{}int\symbol{}\ \normal{}n\symbol{}) }
+\leftline{143:\ \ \ $\{$ }
+\keya{}\leftline{144:\ \ \ int\symbol{}\ \normal{}i\symbol{},\normal{}k\symbol{}=\normal{}1\symbol{},\normal{}found\symbol{}=\normal{}0\symbol{}; }
+\leftline{145:\ \ \  }
+\keya{}\leftline{146:\ \ \ for\symbol{}\ (\normal{}i\symbol{}=\normal{}1\symbol{};\normal{}i\symbol{}<\normal{}number\symbol{};\normal{}i\symbol{}++) }
+\leftline{147:\ \ \ \ \ \keya{}if\symbol{}\ (\normal{}strings\symbol{}[\normal{}i\symbol{}][\normal{}0\symbol{}]!='-') }
+\leftline{148:\ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}k\symbol{}==\normal{}n\symbol{})\ $\{$\ \normal{}found\symbol{}=\normal{}1\symbol{};\ \keya{}break\symbol{};$\}$ }
+\leftline{149:\ \ \ \ \ \ \ \ \ \ \keya{}else\symbol{} }
+\leftline{150:\ \ \ \ \ \ \ \ \ \ \ \normal{}k\symbol{}++; }
+\leftline{151:\ \ \  }
+\keya{}\leftline{152:\ \ \ if\symbol{}\ (\normal{}found\symbol{})\ \normal{}strcpy\symbol{}(\normal{}s\symbol{},\normal{}strings\symbol{}[\normal{}i\symbol{}]); }
+\leftline{153:\ \ \  }
+\keya{}\leftline{154:\ \ \ return\symbol{}\ \normal{}found\symbol{}; }
+\leftline{155:\ \ \ $\}$ }
+\leftline{156:\ \ \  }
+\leftline{157:\ \ \  }
+\leftline{158:\ \ \  }
+\keya{}\leftline{159:\ \ \ int\symbol{}\ \normal{}OptionsC\symbol{}::\normal{}getOptionValue\symbol{}(\keya{}char\symbol{}\ *\normal{}s\symbol{},\keya{}int\symbol{}\ *\normal{}result\symbol{}) }
+\leftline{160:\ \ \ $\{$ }
+\keya{}\leftline{161:\ \ \ int\symbol{}\ \normal{}found\symbol{}=\normal{}0\symbol{}; }
+\keya{}\leftline{162:\ \ \ char\symbol{}\ *\normal{}pp\symbol{}; }
+\leftline{163:\ \ \  }
+\keya{}\leftline{164:\ \ \ for\symbol{}\ (\keya{}int\symbol{}\ \normal{}i\symbol{}=\normal{}1\symbol{};\normal{}i\symbol{}<\normal{}number\symbol{};\normal{}i\symbol{}++) }
+\leftline{165:\ \ \ \ \ $\{$ }
+\leftline{166:\ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}strstr\symbol{}(\normal{}strings\symbol{}[\normal{}i\symbol{}],\normal{}s\symbol{})) }
+\leftline{167:\ \ \ \ \ \ \ $\{$ }
+\leftline{168:\ \ \ \ \ \ \ \ \ \normal{}pp\symbol{}=\normal{}strings\symbol{}[\normal{}i\symbol{}]+\normal{}strlen\symbol{}(\normal{}s\symbol{}); }
+\leftline{169:\ \ \ \ \ \ \ \ \ *\normal{}result\symbol{}=\normal{}atoi\symbol{}(\normal{}pp\symbol{}); }
+\leftline{170:\ \ \ \ \ \ \ \ \ \normal{}found\symbol{}\ =\ \normal{}i\symbol{}; }
+\leftline{171:\ \ \ \ \ \ \ \ \ \keya{}break\symbol{}; }
+\leftline{172:\ \ \ \ \ \ \ $\}$ }
+\leftline{173:\ \ \ \ \ $\}$ }
+\keya{}\leftline{174:\ \ \ return\symbol{}\ \normal{}found\symbol{}; }
+\leftline{175:\ \ \ $\}$ }
+\leftline{176:\ \ \  }
+\keya{}\leftline{177:\ \ \ int\symbol{} }
+\normal{}\leftline{178:\ \ \ OptionsC\symbol{}::\normal{}getOptionValue\symbol{}(\keya{}char\symbol{}\ *\normal{}s\symbol{},\normal{}Real\symbol{}\ *\normal{}result\symbol{}) }
+\leftline{179:\ \ \ $\{$ }
+\keya{}\leftline{180:\ \ \ int\symbol{}\ \normal{}found\symbol{}=\normal{}0\symbol{}; }
+\keya{}\leftline{181:\ \ \ char\symbol{}\ *\normal{}pp\symbol{}; }
+\leftline{182:\ \ \  }
+\keya{}\leftline{183:\ \ \ for\symbol{}\ (\keya{}int\symbol{}\ \normal{}i\symbol{}=\normal{}1\symbol{};\normal{}i\symbol{}<\normal{}number\symbol{};\normal{}i\symbol{}++) }
+\leftline{184:\ \ \ \ \ $\{$ }
+\leftline{185:\ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}strstr\symbol{}(\normal{}strings\symbol{}[\normal{}i\symbol{}],\normal{}s\symbol{})) }
+\leftline{186:\ \ \ \ \ \ \ $\{$ }
+\leftline{187:\ \ \ \ \ \ \ \ \ \normal{}pp\symbol{}=\normal{}strings\symbol{}[\normal{}i\symbol{}]+\normal{}strlen\symbol{}(\normal{}s\symbol{}); }
+\leftline{188:\ \ \ \ \ \ \ \ \ *\normal{}result\symbol{}=\normal{}atof\symbol{}(\normal{}pp\symbol{}); }
+\leftline{189:\ \ \ \ \ \ \ \ \ \normal{}found\symbol{}\ =\ \normal{}i\symbol{}; }
+\leftline{190:\ \ \ \ \ \ \ \ \ \keya{}break\symbol{}; }
+\leftline{191:\ \ \ \ \ \ \ $\}$ }
+\leftline{192:\ \ \ \ \ $\}$ }
+\keya{}\leftline{193:\ \ \ return\symbol{}\ \normal{}found\symbol{}; }
+\leftline{194:\ \ \ $\}$ }
+\leftline{195:\ \ \  }
+\keya{}\leftline{196:\ \ \ int\symbol{}\ \normal{}OptionsC\symbol{}::\normal{}getOptionValue\symbol{}(\keya{}char\symbol{}\ *\normal{}s\symbol{},\keya{}char\symbol{}\ *\normal{}result\symbol{}) }
+\leftline{197:\ \ \ $\{$ }
+\keya{}\leftline{198:\ \ \ int\symbol{}\ \normal{}found\symbol{}=\normal{}0\symbol{}; }
+\keya{}\leftline{199:\ \ \ char\symbol{}\ *\normal{}pp\symbol{}; }
+\leftline{200:\ \ \  }
+\keya{}\leftline{201:\ \ \ for\symbol{}\ (\keya{}int\symbol{}\ \normal{}i\symbol{}=\normal{}1\symbol{};\normal{}i\symbol{}<\normal{}number\symbol{};\normal{}i\symbol{}++) }
+\leftline{202:\ \ \ \ \ $\{$ }
+\leftline{203:\ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}strstr\symbol{}(\normal{}strings\symbol{}[\normal{}i\symbol{}],\normal{}s\symbol{})) }
+\leftline{204:\ \ \ \ \ \ \ $\{$ }
+\leftline{205:\ \ \ \ \ \ \ \ \ \normal{}pp\symbol{}=\normal{}strings\symbol{}[\normal{}i\symbol{}]+\normal{}strlen\symbol{}(\normal{}s\symbol{}); }
+\leftline{206:\ \ \ \ \ \ \ \ \ \normal{}strcpy\symbol{}(\normal{}result\symbol{},\normal{}pp\symbol{}); }
+\leftline{207:\ \ \ \ \ \ \ \ \ \normal{}found\symbol{}\ =\ \normal{}i\symbol{}; }
+\leftline{208:\ \ \ \ \ \ \ \ \ \keya{}break\symbol{}; }
+\leftline{209:\ \ \ \ \ \ \ $\}$ }
+\leftline{210:\ \ \ \ \ $\}$ }
+\keya{}\leftline{211:\ \ \ return\symbol{}\ \normal{}found\symbol{}; }
+\leftline{212:\ \ \ $\}$ }
+\leftline{213:\ \ \  }
+\leftline{214:\ \ \  }
+\keya{}\leftline{215:\ \ \ int\symbol{}\ \normal{}TexC\symbol{}::\normal{}write\symbol{}(\keya{}const\symbol{}\ \keya{}int\symbol{}\ \normal{}code\symbol{},\keya{}const\symbol{}\ \keya{}char\symbol{}\ *\normal{}string\symbol{}) }
+\leftline{216:\ \ \ $\{$ }
+\keya{}\leftline{217:\ \ \ static\symbol{}\ \keya{}int\symbol{}\ \normal{}line\symbol{}=\normal{}1\symbol{}; }
+\keya{}\leftline{218:\ \ \ static\symbol{}\ \keya{}int\symbol{}\ \normal{}i\symbol{}=\normal{}0\symbol{}; }
+\keya{}\leftline{219:\ \ \ const\symbol{}\ \keya{}char\symbol{}\ *\normal{}sp\symbol{}; }
+\leftline{220:\ \ \  }
+\keya{}\leftline{221:\ \ \ switch\symbol{}(\normal{}code\symbol{})\ $\{$ }
+\leftline{222:\ \ \ \ \  }
+\leftline{223:\ \ \ \ \keya{}case\symbol{}\ \normal{}KEYWORD1\symbol{}\ :\ \normal{}fprintf\symbol{}(\normal{}file\symbol{},"\\\normal{}keya\symbol{}$\{$$\}$");\ \keya{}break\symbol{}; }
+\leftline{224:\ \ \ \ \keya{}case\symbol{}\ \normal{}KEYWORD2\symbol{}\ :\ \normal{}fprintf\symbol{}(\normal{}file\symbol{},"\\\normal{}keyb\symbol{}$\{$$\}$");\ \keya{}break\symbol{}; }
+\leftline{225:\ \ \ \ \keya{}case\symbol{}\ \normal{}COMMENT\symbol{}\ \ :\ \normal{}fprintf\symbol{}(\normal{}file\symbol{},"\\\normal{}comment\symbol{}$\{$$\}$");\ \keya{}break\symbol{}; }
+\leftline{226:\ \ \ \ \keya{}case\symbol{}\ \normal{}SYMBOL\symbol{}\ \ \ :\ \normal{}fprintf\symbol{}(\normal{}file\symbol{},"\\\normal{}symbol\symbol{}$\{$$\}$");\ \keya{}break\symbol{}; }
+\leftline{227:\ \ \ \ \keya{}case\symbol{}\ \normal{}NORMAL\symbol{}\ \ \ :\ \normal{}fprintf\symbol{}(\normal{}file\symbol{},"\\\normal{}normal\symbol{}$\{$$\}$");\ \keya{}break\symbol{}; }
+\leftline{228:\ \ \ $\}$ }
+\leftline{229:\ \ \ \  }
+\leftline{230:\ \ \ \ \keya{}for\symbol{}(\normal{}sp\symbol{}=\normal{}string\symbol{};*\normal{}sp\symbol{}!=\normal{}0\symbol{};\normal{}sp\symbol{}++,\normal{}i\symbol{}++) }
+\leftline{231:\ \ \ \ \ \ $\{$ }
+\leftline{232:\ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}line\symbol{})\ $\{$ }
+\leftline{233:\ \ \ \ \ \ \ \ \ \ \normal{}fprintf\symbol{}(\normal{}file\symbol{},"\\\normal{}leftline\symbol{}$\{$");\ \normal{}line\symbol{}=\normal{}0\symbol{}; }
+\leftline{234:\ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}strstr\symbol{}(\normal{}string\symbol{},\ "\keya{}Algorithm\symbol{}")\ ==\ \normal{}string\symbol{}) }
+\leftline{235:\ \ \ \ \ \ \ \ \ \ \ \normal{}lnumber\symbol{}\ =\ \normal{}0\symbol{}; }
+\leftline{236:\ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}numbers\symbol{}\ \&\&\ \normal{}lnumber\symbol{}) }
+\leftline{237:\ \ \ \ \ \ \ \ \ \ \ \normal{}fprintf\symbol{}(\normal{}file\symbol{},"\normal{}\%2d\symbol{}:\\\ \\\ \\\ ",\normal{}lnumber\symbol{}); }
+\leftline{238:\ \ \ \ \ \ \ \ \ \ \normal{}lnumber\symbol{}++; }
+\leftline{239:\ \ \ \ \ \ \ \ $\}$ }
+\leftline{240:\ \ \ \ \ \ \ \  }
+\leftline{241:\ \ \ \ \ \ \ \ \keya{}switch\symbol{}(*\normal{}sp\symbol{})\ $\{$ }
+\leftline{242:\ \ \ \ \ \ \ \ \ \  }
+\keyb{}\leftline{243:\ \ \ \#define\symbol{}\ \normal{}TAB_SIZE\symbol{}\ \ \ \ \ \ \ \normal{}8\symbol{} }
+\leftline{244:\ \ \ \ \ \ \ \ \keya{}case\symbol{}\ '\\normal{}t\symbol{}'\ :\ \ \ \ \ \ \  }
+\leftline{245:\ \ \ \ \ \ \ \ \ \ \comment{}//\ \ \ \ \ \ \ \ \ \ \ fprintf(file,"\\tab");\ break; }
+\symbol{}\leftline{246:\ \ \ \ \ \ \ \ \ \ \keya{}int\symbol{}\ \normal{}n\symbol{},\normal{}j\symbol{}; }
+\leftline{247:\ \ \ \ \ \ \ \ \ \ \normal{}n\symbol{}=((\normal{}i\symbol{}/\normal{}TAB_SIZE\symbol{})+\normal{}1\symbol{})*\normal{}TAB_SIZE\symbol{}-\normal{}i\symbol{}; }
+\leftline{248:\ \ \ \ \ \ \ \ \ \ \keya{}for\symbol{}(\normal{}j\symbol{}=\normal{}0\symbol{};\normal{}j\symbol{}<\normal{}n\symbol{};\normal{}j\symbol{}++)\ \normal{}fprintf\symbol{}(\normal{}file\symbol{},"\\\ "); }
+\leftline{249:\ \ \ \ \ \ \ \ \ \ \keya{}break\symbol{}; }
+\leftline{250:\ \ \ \ \ \ \ \ \ \  }
+\leftline{251:\ \ \ \ \ \ \ \ \ \  }
+\leftline{252:\ \ \ \ \ \ \ \ \keya{}case\symbol{}\ '\\normal{}n\symbol{}':\ \ \ \ \ \ \ \ \normal{}fprintf\symbol{}(\normal{}file\symbol{},"\ $\}$\\normal{}n\symbol{}"); }
+\leftline{253:\ \ \ \ \ \ \ \ \ \ \normal{}line\symbol{}=\normal{}1\symbol{};\ \normal{}i\symbol{}=\normal{}0\symbol{}; }
+\leftline{254:\ \ \ \ \ \ \ \ \ \ \keya{}break\symbol{}; }
+\leftline{255:\ \ \ \ \ \ \ \ \keya{}case\symbol{}\ '\ '\ :\ \ \ \ \ \ \ \ \normal{}fprintf\symbol{}(\normal{}file\symbol{},"\\\ "); }
+\leftline{256:\ \ \ \ \ \ \ \ \ \keya{}break\symbol{}; }
+\leftline{257:\ \ \ \ \ \ \ \ \ \keya{}case\symbol{}\ '\&'\ :\ \ \ \ \ \ \ \normal{}fprintf\symbol{}(\normal{}file\symbol{},"\\\&");\ \keya{}break\symbol{}; }
+\leftline{258:\ \ \ \ \ \ \ \ \ \keya{}case\symbol{}\ '\normal{}\#\symbol{}'\ :\ \ \ \ \ \ \ \normal{}fprintf\symbol{}(\normal{}file\symbol{},"\\\normal{}\#\symbol{}");\ \keya{}break\symbol{}; }
+\leftline{259:\ \ \ \ \ \ \ \ \ \ \comment{}//\ \ \ \ \ \ case\ '_'\ :\ \ \ \ fprintf(file,"\\_$\{$$\}$");\ break; }
+\symbol{}\leftline{260:\ \ \ \ \ \ \ \ \ \keya{}case\symbol{}\ '\normal{}_\symbol{}'\ :\ \ \ \ \ \ \ \normal{}fprintf\symbol{}(\normal{}file\symbol{},"\normal{}_\symbol{}");\ \keya{}break\symbol{}; }
+\leftline{261:\ \ \ \ \ \ \ \ \ \keya{}case\symbol{}\ '\^{}'\ :\ \ \ \ \ \ \ \normal{}fprintf\symbol{}(\normal{}file\symbol{},"\\\^{}$\{$$\}$");\ \keya{}break\symbol{}; }
+\leftline{262:\ \ \ \ \ \ \ \ \ \keya{}case\symbol{}\ '\normal{}\%\symbol{}'\ :\ \ \ \ \ \ \ \normal{}fprintf\symbol{}(\normal{}file\symbol{},"\\\normal{}\%\%\symbol{}");\ \keya{}break\symbol{}; }
+\leftline{263:\ \ \ \ \ \ \ \ \ \keya{}case\symbol{}\ '$\{$'\ :\ \ \ \ \ \ \ \normal{}fprintf\symbol{}(\normal{}file\symbol{},"\normal{}$\symbol{}\\$\{$\normal{}$\symbol{}");\ \keya{}break\symbol{}; }
+\leftline{264:\ \ \ \ \ \ \ \ \ \keya{}case\symbol{}\ '$\}$'\ :\ \ \ \ \ \ \ \normal{}fprintf\symbol{}(\normal{}file\symbol{},"\normal{}$\symbol{}\\$\}$\normal{}$\symbol{}");\ \keya{}break\symbol{}; }
+\leftline{265:\ \ \ \ \ \ \ \ \ \ \comment{}//\ \ case\ '\\'\ :\ \ \ \ \ \ \ fprintf(file,"$\\backslash$");\ break; }
+\symbol{}\leftline{266:\ \ \ \ \ \ \ \ \ \ \comment{}//\ \ case\ '$'\ :\ \ \ \ \ \ \ \ fprintf(file,"\\$");\ break; }
+\symbol{}\leftline{267:\ \ \ \ \ \ \ \comment{}//\ \ case\ '<'\ :\ \ \ \ \ fprintf(file,"\\<");\ break; }
+\symbol{}\leftline{268:\ \ \ \ \ \ \ \comment{}//\ \ case\ '>'\ :\ \ \ \ \ fprintf(file,"\\>");\ break; }
+\symbol{}\leftline{269:\ \ \  }
+\leftline{270:\ \ \ \ \ \keya{}case\symbol{}\ '\~{}'\ :\ \ \ \normal{}fprintf\symbol{}(\normal{}file\symbol{},"\\\~{}$\{$$\}$");\ \keya{}break\symbol{}; }
+\leftline{271:\ \ \ \ \ \ \ \ \  }
+\leftline{272:\ \ \ \ \ \ \  }
+\leftline{273:\ \ \ \ \ \keya{}default\symbol{}\ \ :\ \ \ \normal{}fputc\symbol{}(*\normal{}sp\symbol{},\normal{}file\symbol{}); }
+\leftline{274:\ \ \ \ \ $\}$ }
+\leftline{275:\ \ \ $\}$ }
+\keya{}\leftline{276:\ \ \ return\symbol{}\ \normal{}1\symbol{}; }
+\leftline{277:\ \ \ $\}$ }
+\leftline{278:\ \ \  }
+\leftline{279:\ \ \  }
+\keya{}\leftline{280:\ \ \ int\symbol{}\ \ \ \ \normal{}LexanC\symbol{}::\normal{}isKey\symbol{}(\keya{}char\symbol{}\ *\normal{}s\symbol{}) }
+\leftline{281:\ \ \ $\{$ }
+\keya{}\leftline{282:\ \ \ int\symbol{}\ \normal{}i\symbol{},\normal{}j\symbol{}; }
+\leftline{283:\ \ \  }
+\keya{}\leftline{284:\ \ \ for\symbol{}\ (\normal{}i\symbol{}=\normal{}0\symbol{};\normal{}i\symbol{}<\normal{}2\symbol{};\normal{}i\symbol{}++) }
+\leftline{285:\ \ \ \ \keya{}for\symbol{}(\normal{}j\symbol{}=\normal{}0\symbol{};\normal{}j\symbol{}<\normal{}nkey\symbol{}[\normal{}i\symbol{}];\normal{}j\symbol{}++) }
+\leftline{286:\ \ \ \ \ \keya{}if\symbol{}(\normal{}strcmp\symbol{}(\normal{}s\symbol{},\normal{}key\symbol{}[\normal{}i\symbol{}][\normal{}j\symbol{}])==\normal{}0\symbol{})\ \keya{}return\symbol{}\ \normal{}i\symbol{}+\normal{}1\symbol{}; }
+\leftline{287:\ \ \  }
+\keya{}\leftline{288:\ \ \ return\symbol{}\ \normal{}0\symbol{}; }
+\leftline{289:\ \ \ $\}$ }
+\leftline{290:\ \ \  }
+\leftline{291:\ \ \  }
+\keya{}\leftline{292:\ \ \ int\symbol{}\ \ \ \ \normal{}LexanC\symbol{}::\normal{}readWord\symbol{}(\normal{}FILE\symbol{}\ *\normal{}f\symbol{},\keya{}char\symbol{}\ *\normal{}s\symbol{}) }
+\leftline{293:\ \ \ $\{$ }
+\keya{}\leftline{294:\ \ \ int\symbol{}\ \ \ \ \normal{}i\symbol{}=\normal{}0\symbol{}; }
+\keya{}\leftline{295:\ \ \ int\symbol{}\ \ \ \ \normal{}c\symbol{}; }
+\leftline{296:\ \ \  }
+\keya{}\leftline{297:\ \ \ do\symbol{} }
+\leftline{298:\ \ \ $\{$ }
+\leftline{299:\ \ \ \ \ \ \ \ \ \ \normal{}c\symbol{}=\normal{}fgetc\symbol{}(\normal{}f\symbol{}); }
+\leftline{300:\ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}c\symbol{}==\normal{}EOF\symbol{})\ \keya{}return\symbol{}\ \normal{}0\symbol{}; }
+\leftline{301:\ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (!\normal{}isSeparator\symbol{}(\normal{}c\symbol{}))\ \keya{}break\symbol{}; }
+\leftline{302:\ \ \ $\}$\ \keya{}while\symbol{}(\normal{}1\symbol{}); }
+\leftline{303:\ \ \  }
+\leftline{304:\ \ \  }
+\keya{}\leftline{305:\ \ \ do\symbol{} }
+\leftline{306:\ \ \ $\{$ }
+\leftline{307:\ \ \ \ \ \ \ \ \ \ \normal{}s\symbol{}[\normal{}i\symbol{}++]=\normal{}c\symbol{}; }
+\leftline{308:\ \ \ \ \ \ \ \ \ \ \normal{}c\symbol{}=\normal{}fgetc\symbol{}(\normal{}f\symbol{}); }
+\leftline{309:\ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}c\symbol{}==\normal{}EOF\symbol{})\ \keya{}break\symbol{}; }
+\leftline{310:\ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}isSeparator\symbol{}(\normal{}c\symbol{}))\ \keya{}break\symbol{}; }
+\leftline{311:\ \ \ $\}$\ \keya{}while\symbol{}(\normal{}1\symbol{}); }
+\leftline{312:\ \ \  }
+\normal{}\leftline{313:\ \ \ s\symbol{}[\normal{}i\symbol{}]=\normal{}0\symbol{}; }
+\keya{}\leftline{314:\ \ \ return\symbol{}\ \normal{}1\symbol{}; }
+\leftline{315:\ \ \ $\}$ }
+\leftline{316:\ \ \  }
+\leftline{317:\ \ \  }
+\keya{}\leftline{318:\ \ \ int\symbol{}\ \ \ \ \normal{}LexanC\symbol{}::\normal{}init\symbol{}(\keya{}const\symbol{}\ \keya{}char\symbol{}\ *\normal{}lexname\symbol{}) }
+\leftline{319:\ \ \ $\{$ }
+\normal{}\leftline{320:\ \ \ FILE\symbol{}\ *\normal{}f\symbol{}; }
+\leftline{321:\ \ \  }
+\keya{}\leftline{322:\ \ \ if\symbol{}\ ((\normal{}f\symbol{}=\normal{}fopen\symbol{}(\normal{}lexname\symbol{},"\normal{}rt\symbol{}"))==\normal{}NULL\symbol{})\ \keya{}return\symbol{}\ \normal{}0\symbol{}; }
+\leftline{323:\ \ \  }
+\leftline{324:\ \ \  }
+\keyb{}\leftline{325:\ \ \ \#define\symbol{}\ \ \ \ \ \ \ \ \normal{}NKEY\symbol{}\ \ \normal{}512\symbol{} }
+\leftline{326:\ \ \  }
+\normal{}\leftline{327:\ \ \ separators\symbol{}\ =\ \keya{}new\symbol{}\ \keya{}char\symbol{}[\normal{}256\symbol{}]; }
+\normal{}\leftline{328:\ \ \ key\symbol{}[\normal{}0\symbol{}]\ \ \ =\ \keya{}new\symbol{}\ \keya{}char\symbol{}*[\normal{}NKEY\symbol{}]; }
+\normal{}\leftline{329:\ \ \ key\symbol{}[\normal{}1\symbol{}]\ \ \ =\ \keya{}new\symbol{}\ \keya{}char\symbol{}*[\normal{}NKEY\symbol{}]; }
+\leftline{330:\ \ \  }
+\normal{}\leftline{331:\ \ \ nsep\symbol{}=\normal{}0\symbol{}; }
+\normal{}\leftline{332:\ \ \ separators\symbol{}[\normal{}nsep\symbol{}++]='\ '; }
+\normal{}\leftline{333:\ \ \ separators\symbol{}[\normal{}nsep\symbol{}++]='\\normal{}n\symbol{}'; }
+\normal{}\leftline{334:\ \ \ separators\symbol{}[\normal{}nsep\symbol{}++]='\\normal{}t\symbol{}'; }
+\leftline{335:\ \ \  }
+\normal{}\leftline{336:\ \ \ fgets\symbol{}(\normal{}separators\symbol{}+\normal{}nsep\symbol{},\normal{}100\symbol{},\normal{}f\symbol{}); }
+\normal{}\leftline{337:\ \ \ nsep\symbol{}=\normal{}strlen\symbol{}(\normal{}separators\symbol{}); }
+\leftline{338:\ \ \  }
+\keya{}\leftline{339:\ \ \ int\symbol{}\ \normal{}i\symbol{}=\normal{}0\symbol{},\normal{}type\symbol{}=\normal{}0\symbol{}; }
+\keya{}\leftline{340:\ \ \ char\symbol{}\ \normal{}s\symbol{}[\normal{}64\symbol{}]; }
+\leftline{341:\ \ \  }
+\keya{}\leftline{342:\ \ \ while\symbol{}(\normal{}readWord\symbol{}(\normal{}f\symbol{},\normal{}s\symbol{})) }
+\leftline{343:\ \ \ \ \ \ \ \ \ \ $\{$ }
+\leftline{344:\ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}strcmp\symbol{}(\normal{}s\symbol{},"\normal{}KEYWORDS2\symbol{}")==\normal{}0\symbol{})\  }
+\leftline{345:\ \ \ \ \ \ \ \ \ \ $\{$ }
+\leftline{346:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}printf\symbol{}("\normal{}KEYWORDS2\symbol{}\\normal{}n\symbol{}"); }
+\leftline{347:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}nkey\symbol{}[\normal{}type\symbol{}]=\normal{}i\symbol{};\  }
+\leftline{348:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}type\symbol{}++;\  }
+\leftline{349:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}i\symbol{}=\normal{}0\symbol{};\ \  }
+\leftline{350:\ \ \ \ \ \ \ \ \ \ $\}$ }
+\leftline{351:\ \ \ \ \ \ \ \ \ \ \keya{}else\symbol{} }
+\leftline{352:\ \ \ \ \ \ \ \ \ \ $\{$ }
+\leftline{353:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}printf\symbol{}("\normal{}\%s\symbol{}\\normal{}n\symbol{}",\normal{}s\symbol{});\ \ \ \  }
+\leftline{354:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}key\symbol{}[\normal{}type\symbol{}][\normal{}i\symbol{}]=\keya{}new\symbol{}\ \keya{}char\symbol{}[\normal{}strlen\symbol{}(\normal{}s\symbol{})+\normal{}1\symbol{}]; }
+\leftline{355:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}strcpy\symbol{}(\normal{}key\symbol{}[\normal{}type\symbol{}][\normal{}i\symbol{}],\normal{}s\symbol{}); }
+\leftline{356:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}i\symbol{}++; }
+\leftline{357:\ \ \ \ \ \ \ \ \ \ $\}$ }
+\leftline{358:\ \ \ \ \ \ \ \ \ \ $\}$ }
+\leftline{359:\ \ \  }
+\normal{}\leftline{360:\ \ \ nkey\symbol{}[\normal{}type\symbol{}]=\normal{}i\symbol{};\  }
+\leftline{361:\ \ \  }
+\normal{}\leftline{362:\ \ \ fclose\symbol{}(\normal{}f\symbol{}); }
+\leftline{363:\ \ \  }
+\leftline{364:\ \ \ \  }
+\keya{}\leftline{365:\ \ \ return\symbol{}\ \normal{}1\symbol{}; }
+\leftline{366:\ \ \ $\}$ }
+\leftline{367:\ \ \  }
+\keya{}\leftline{368:\ \ \ int\symbol{}\ \ \ \ \normal{}LexanC\symbol{}::\normal{}open\symbol{}(\keya{}const\symbol{}\ \keya{}char\symbol{}\ *\normal{}filename\symbol{}) }
+\leftline{369:\ \ \ $\{$ }
+\normal{}\leftline{370:\ \ \ file\symbol{}=\normal{}fopen\symbol{}(\normal{}filename\symbol{},"\normal{}rt\symbol{}"); }
+\keya{}\leftline{371:\ \ \ return\symbol{}\ \normal{}file\symbol{}!=\normal{}NULL\symbol{}; }
+\leftline{372:\ \ \ $\}$ }
+\leftline{373:\ \ \  }
+\keya{}\leftline{374:\ \ \ int\symbol{}\ \ \ \ \normal{}LexanC\symbol{}::\normal{}read\symbol{}(\keya{}char\symbol{}\ *\normal{}s\symbol{}) }
+\leftline{375:\ \ \ $\{$ }
+\keya{}\leftline{376:\ \ \ int\symbol{}\ \ \ \ \normal{}i\symbol{}=\normal{}0\symbol{}; }
+\keya{}\leftline{377:\ \ \ int\symbol{}\ \ \ \ \normal{}type\symbol{}=\normal{}EOF\symbol{}; }
+\keya{}\leftline{378:\ \ \ int\symbol{}\ \ \ \ \normal{}wasSlash\symbol{}=\normal{}0\symbol{}; }
+\keya{}\leftline{379:\ \ \ static\symbol{}\ \keya{}int\symbol{}\ \ \ \ \ \normal{}c\symbol{}=-\normal{}2\symbol{}; }
+\leftline{380:\ \ \  }
+\keya{}\leftline{381:\ \ \ if\symbol{}\ (\normal{}c\symbol{}==-\normal{}2\symbol{})\ \ \normal{}c\symbol{}=\normal{}fgetc\symbol{}(\normal{}file\symbol{}); }
+\leftline{382:\ \ \  }
+\keya{}\leftline{383:\ \ \ if\symbol{}\ (\normal{}c\symbol{}==\normal{}EOF\symbol{})\ \keya{}return\symbol{}\ \normal{}c\symbol{}; }
+\leftline{384:\ \ \  }
+\keya{}\leftline{385:\ \ \ do\symbol{}$\{$ }
+\keya{}\leftline{386:\ \ \ if\symbol{}\ (\normal{}isSeparator\symbol{}(\normal{}c\symbol{}))\ $\{$ }
+\leftline{387:\ \ \ \ \ \ \ \ \ \ \normal{}type\symbol{}=\normal{}SYMBOL\symbol{}; }
+\leftline{388:\ \ \ \ \ \ \ \ \ \ \normal{}s\symbol{}[\normal{}i\symbol{}++]=\normal{}c\symbol{}; }
+\leftline{389:\ \ \  }
+\leftline{390:\ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}(\normal{}wasSlash\symbol{})\ $\{$ }
+\leftline{391:\ \ \ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}(\normal{}c\symbol{}==\normal{}comment_1b\symbol{})\ \ \comment{}//\ line\ comment }
+\symbol{}\leftline{392:\ \ \ \ \ \ \ \ \ \ \ \ \ \ $\{$\  }
+\leftline{393:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}i\symbol{}>\normal{}2\symbol{})\ $\{$\ \normal{}c\symbol{}=\normal{}s\symbol{}[\normal{}i\symbol{}-\normal{}2\symbol{}];\ \normal{}fseek\symbol{}(\normal{}file\symbol{},-\normal{}1\symbol{},\normal{}SEEK_CUR\symbol{});\ \normal{}s\symbol{}[\normal{}i\symbol{}-\normal{}2\symbol{}]=\normal{}0\symbol{};\  }
+\leftline{394:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \keya{}return\symbol{}\ \normal{}type\symbol{};\ $\}$ }
+\leftline{395:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}fgets\symbol{}(\normal{}s\symbol{}+\normal{}i\symbol{},\normal{}S_LEN\symbol{},\normal{}file\symbol{});\  }
+\leftline{396:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}c\symbol{}=\normal{}fgetc\symbol{}(\normal{}file\symbol{}); }
+\leftline{397:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \keya{}return\symbol{}\ \normal{}COMMENT\symbol{}; }
+\leftline{398:\ \ \ \ \ \ \ \ \ \ \ \ \ \ $\}$ }
+\leftline{399:\ \ \ \ \ \ \ \ \ \ \ \ \keya{}else\symbol{} }
+\leftline{400:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}(\normal{}c\symbol{}==\normal{}comment_2b\symbol{})\ \ \comment{}//\ line\ comment }
+\symbol{}\leftline{401:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ $\{$\  }
+\leftline{402:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}i\symbol{}>\normal{}2\symbol{})\ $\{$\ \normal{}c\symbol{}=\normal{}s\symbol{}[\normal{}i\symbol{}-\normal{}2\symbol{}];\ \normal{}fseek\symbol{}(\normal{}file\symbol{},-\normal{}1\symbol{},\normal{}SEEK_CUR\symbol{});\ \normal{}s\symbol{}[\normal{}i\symbol{}-\normal{}2\symbol{}]=\normal{}0\symbol{};\  }
+\leftline{403:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \keya{}return\symbol{}\ \normal{}type\symbol{};\ $\}$ }
+\leftline{404:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}c\symbol{}=\normal{}fgetc\symbol{}(\normal{}file\symbol{}); }
+\leftline{405:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}(\normal{}c\symbol{}!=\normal{}EOF\symbol{}) }
+\leftline{406:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ $\{$ }
+\leftline{407:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}s\symbol{}[\normal{}i\symbol{}++]=\normal{}c\symbol{}; }
+\leftline{408:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \keya{}int\symbol{}\ \normal{}count\symbol{}=\normal{}1\symbol{}; }
+\leftline{409:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \keya{}do\symbol{}$\{$ }
+\leftline{410:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}c\symbol{}=\normal{}fgetc\symbol{}(\normal{}file\symbol{}); }
+\leftline{411:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}(\normal{}c\symbol{}==\normal{}EOF\symbol{})\ \keya{}break\symbol{}; }
+\leftline{412:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}s\symbol{}[\normal{}i\symbol{}++]=\normal{}c\symbol{}; }
+\leftline{413:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}s\symbol{}[\normal{}i\symbol{}-\normal{}2\symbol{}]==\normal{}comment_1e\symbol{}\ \&\&\ \normal{}s\symbol{}[\normal{}i\symbol{}-\normal{}1\symbol{}]==\normal{}comment_2e\symbol{})\ \normal{}count\symbol{}--; }
+\leftline{414:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}s\symbol{}[\normal{}i\symbol{}-\normal{}2\symbol{}]==\normal{}comment_1b\symbol{}\ \&\&\normal{}s\symbol{}[\normal{}i\symbol{}-\normal{}1\symbol{}]==\normal{}comment_2b\symbol{})\ \normal{}count\symbol{}++; }
+\leftline{415:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ $\}$\ \keya{}while\symbol{}(\normal{}count\symbol{}!=\normal{}0\symbol{}); }
+\leftline{416:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ $\}$ }
+\leftline{417:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}s\symbol{}[\normal{}i\symbol{}]=\normal{}0\symbol{}; }
+\leftline{418:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}c\symbol{}=\normal{}fgetc\symbol{}(\normal{}file\symbol{}); }
+\leftline{419:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \keya{}return\symbol{}\ \normal{}COMMENT\symbol{}; }
+\leftline{420:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ $\}$ }
+\leftline{421:\ \ \ \ \ \ \ \ \ \ \ \ \ \ $\}$ }
+\leftline{422:\ \ \ \ \ \ \ \ \ \ \ \ \keya{}else\symbol{} }
+\leftline{423:\ \ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}wasSlash\symbol{}=(\normal{}c\symbol{}==\normal{}comment_1b\symbol{});\  }
+\leftline{424:\ \ \ $\}$\ \keya{}else\symbol{} }
+\leftline{425:\ \ \ \ \ \keya{}if\symbol{}\ (\normal{}c\symbol{}=='')\ $\{$ }
+\leftline{426:\ \ \ \ \ \ \ if\ (i>=1)\ $\{$ }
+\leftline{427:\ \ \ \ \ \ \ \ \ s[i]=0; }
+\leftline{428:\ \ \ \ \ \ \ \ \ return\ type; }
+\leftline{429:\ \ \ \ \ \ \ $\}$ }
+\leftline{430:\ \ \ \ \ \ \ c=fgetc(file); }
+\leftline{431:\ \ \ \ \ \ \ while(c!='\symbol{}')\ $\{$ }
+\leftline{432:\ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}c\symbol{}==\normal{}EOF\symbol{})\ \keya{}break\symbol{}; }
+\leftline{433:\ \ \ \ \ \ \ \ \ \normal{}s\symbol{}[\normal{}i\symbol{}++]=\normal{}c\symbol{}; }
+\leftline{434:\ \ \ \ \ \ \ \ \ \normal{}c\symbol{}=\normal{}fgetc\symbol{}(\normal{}file\symbol{}); }
+\leftline{435:\ \ \ \ \ \ \ $\}$ }
+\leftline{436:\ \ \ \ \ \ \ \normal{}s\symbol{}[\normal{}i\symbol{}]=\normal{}0\symbol{}; }
+\leftline{437:\ \ \ \ \ \ \ \normal{}c\symbol{}=\normal{}fgetc\symbol{}(\normal{}file\symbol{}); }
+\leftline{438:\ \ \ \ \ \ \ \keya{}return\symbol{}\ \normal{}WORD\symbol{}; }
+\leftline{439:\ \ \ \ \ $\}$\ \keya{}else\symbol{}\ $\{$ }
+\leftline{440:\ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}type\symbol{}==\normal{}EOF\symbol{})\ \normal{}type\symbol{}=\normal{}WORD\symbol{}; }
+\leftline{441:\ \ \ \ \ \ \ \keya{}break\symbol{}; }
+\leftline{442:\ \ \ \ \ $\}$ }
+\leftline{443:\ \ \ $\}$\ \keya{}while\symbol{}((\normal{}c\symbol{}=\normal{}fgetc\symbol{}(\normal{}file\symbol{}))!=\normal{}EOF\symbol{}); }
+\leftline{444:\ \ \ \  }
+\keya{}\leftline{445:\ \ \ if\symbol{}\ (\normal{}c\symbol{}!=\normal{}EOF\symbol{}) }
+\keya{}\leftline{446:\ \ \ if\symbol{}\ (\normal{}type\symbol{}==\normal{}WORD\symbol{}) }
+\leftline{447:\ \ \ $\{$ }
+\keya{}\leftline{448:\ \ \ do\symbol{} }
+\leftline{449:\ \ \ $\{$ }
+\normal{}\leftline{450:\ \ \ s\symbol{}[\normal{}i\symbol{}++]=\normal{}c\symbol{}; }
+\normal{}\leftline{451:\ \ \ c\symbol{}=\normal{}fgetc\symbol{}(\normal{}file\symbol{}); }
+\keya{}\leftline{452:\ \ \ if\symbol{}\ (\normal{}c\symbol{}==\normal{}EOF\symbol{})\ \keya{}break\symbol{}; }
+\leftline{453:\ \ \ $\}$\ \keya{}while\symbol{}(!\normal{}isSeparator\symbol{}(\normal{}c\symbol{})); }
+\leftline{454:\ \ \  }
+\normal{}\leftline{455:\ \ \ s\symbol{}[\normal{}i\symbol{}]=\normal{}0\symbol{}; }
+\keya{}\leftline{456:\ \ \ int\symbol{}\ \normal{}k\symbol{}=\normal{}isKey\symbol{}(\normal{}s\symbol{}); }
+\keya{}\leftline{457:\ \ \ if\symbol{}\ (\normal{}k\symbol{}==\normal{}0\symbol{})\ \keya{}return\symbol{}\ \normal{}NORMAL\symbol{}; }
+\keya{}\leftline{458:\ \ \ return\symbol{}\ \normal{}k\symbol{}; }
+\leftline{459:\ \ \ $\}$ }
+\leftline{460:\ \ \  }
+\normal{}\leftline{461:\ \ \ s\symbol{}[\normal{}i\symbol{}]=\normal{}0\symbol{}; }
+\keya{}\leftline{462:\ \ \ return\symbol{}\ \normal{}type\symbol{}; }
+\leftline{463:\ \ \  }
+\leftline{464:\ \ \ $\}$ }
+\leftline{465:\ \ \  }
+\keya{}\leftline{466:\ \ \ int\symbol{}\ \normal{}TexC\symbol{}::\normal{}init\symbol{}(\keya{}const\symbol{}\ \keya{}char\symbol{}\ *\normal{}filename\symbol{}) }
+\leftline{467:\ \ \ $\{$ }
+\normal{}\leftline{468:\ \ \ file\symbol{}=\normal{}fopen\symbol{}(\normal{}filename\symbol{},"\normal{}wt\symbol{}"); }
+\normal{}\leftline{469:\ \ \ fprintf\symbol{}(\normal{}file\symbol{},"\\\normal{}input\symbol{}\ \normal{}default.mac\symbol{}\\normal{}n\symbol{}"); }
+\keya{}\leftline{470:\ \ \ return\symbol{}\ \normal{}file\symbol{}!=\normal{}NULL\symbol{}; }
+\leftline{471:\ \ \ $\}$ }
+\leftline{472:\ \ \  }
+\leftline{473:\ \ \  }
+\keya{}\leftline{474:\ \ \ void\symbol{}\ \normal{}Help\symbol{}() }
+\leftline{475:\ \ \ $\{$ }
+\leftline{476:\ \ \ \ \ \normal{}printf\symbol{}("\normal{}Syntax\symbol{}\ :\ \normal{}c2tex\symbol{}\ \normal{}in_file\symbol{}\ [\normal{}out_file\symbol{}]\ [-\keya{}pascal\symbol{}]\ [-\normal{}numbers\symbol{}]\\normal{}n\symbol{}\\normal{}n\symbol{}"); }
+\leftline{477:\ \ \ \ \ \normal{}printf\symbol{}("\normal{}Default\symbol{}\ \normal{}out_file\symbol{}\ \normal{}is\symbol{}\ \normal{}output.tex.\symbol{}\\normal{}n\symbol{}"); }
+\leftline{478:\ \ \ \ \ \normal{}printf\symbol{}("-\keya{}pascal\symbol{}\ \ \ \ \ \normal{}use\symbol{}\ \keya{}pascal\symbol{}\ \normal{}comments\symbol{}\ (*\ *)\normal{}.\symbol{}\\normal{}n\symbol{}"); }
+\leftline{479:\ \ \ \ \ \normal{}printf\symbol{}("-\normal{}numbers\symbol{}\ \ \ \ \normal{}print\symbol{}\ \normal{}line\symbol{}\ \normal{}numbers.\symbol{}\\normal{}n\symbol{}"); }
+\leftline{480:\ \ \ \ \ \normal{}exit\symbol{}(\normal{}1\symbol{}); }
+\leftline{481:\ \ \ $\}$ }
+\leftline{482:\ \ \  }
+\keya{}\leftline{483:\ \ \ int\symbol{}\ \normal{}main\symbol{}(\keya{}int\symbol{}\ \normal{}argc\symbol{},\ \keya{}char\symbol{}\ **\normal{}argv\symbol{}) }
+\leftline{484:\ \ \ $\{$ }
+\keya{}\leftline{485:\ \ \ char\symbol{}\ \ \ \normal{}s\symbol{}[\normal{}16384\symbol{}];\ \comment{}//\ docasny\ buffer }
+\symbol{}\leftline{486:\ \ \  }
+\normal{}\leftline{487:\ \ \ OptionsC\symbol{}\ \normal{}options\symbol{}(\normal{}argc\symbol{},\normal{}argv\symbol{}); }
+\leftline{488:\ \ \ \  }
+\leftline{489:\ \ \ \ \keya{}if\symbol{}\ (\normal{}argc\symbol{}<\normal{}2\symbol{})\ \normal{}Help\symbol{}(); }
+\leftline{490:\ \ \ \ \keya{}if\symbol{}\ (\normal{}argc\symbol{}>=\normal{}3\symbol{}\ \&\&\ (*\normal{}argv\symbol{}[\normal{}2\symbol{}]!='-')\ ) }
+\leftline{491:\ \ \ \ \ \ \normal{}strcpy\symbol{}(\normal{}s\symbol{},\normal{}argv\symbol{}[\normal{}2\symbol{}]); }
+\leftline{492:\ \ \ \ \keya{}else\symbol{} }
+\leftline{493:\ \ \ \ \ \ \normal{}strcpy\symbol{}(\normal{}s\symbol{},"\normal{}output.tex\symbol{}"); }
+\leftline{494:\ \ \ \  }
+\leftline{495:\ \ \ \ \keya{}if\symbol{}\ (\normal{}options.isOption\symbol{}("-\keya{}pascal\symbol{}"))\ $\{$ }
+\leftline{496:\ \ \ \ \ \ \ \keya{}pascal\symbol{}=\normal{}1\symbol{}; }
+\leftline{497:\ \ \ \ \ \ \ \normal{}comment_1b\symbol{}='('; }
+\leftline{498:\ \ \ \ \ \ \ \normal{}comment_2b\symbol{}='*'; }
+\leftline{499:\ \ \ \ \ \ \ \normal{}comment_1e\symbol{}='*'; }
+\leftline{500:\ \ \ \ \ \ \ \normal{}comment_2e\symbol{}=')'; }
+\leftline{501:\ \ \ \ $\}$ }
+\leftline{502:\ \ \  }
+\leftline{503:\ \ \ \ \keya{}int\symbol{}\ \normal{}numbers\symbol{}; }
+\leftline{504:\ \ \ \  }
+\leftline{505:\ \ \ \ \normal{}numbers\symbol{}\ =\ \normal{}options.isOption\symbol{}("-\normal{}numbers\symbol{}"); }
+\leftline{506:\ \ \ \  }
+\leftline{507:\ \ \ \  }
+\leftline{508:\ \ \ \ \ \normal{}LexanC\symbol{}\ \ \ \ \ \ \ \normal{}lexan\symbol{}; }
+\leftline{509:\ \ \ \ \ \normal{}TexC\symbol{}\ \normal{}tex\symbol{}(\normal{}numbers\symbol{},\ \normal{}s\symbol{}); }
+\leftline{510:\ \ \ \ \ \normal{}lexan.open\symbol{}(\normal{}argv\symbol{}[\normal{}1\symbol{}]); }
+\leftline{511:\ \ \  }
+\leftline{512:\ \ \ \ \ \keya{}int\symbol{}\ \ \normal{}t\symbol{}; }
+\leftline{513:\ \ \ \ \ \normal{}cout\symbol{}<<\normal{}tex.numbers\symbol{}; }
+\leftline{514:\ \ \  }
+\leftline{515:\ \ \ \ \  }
+\leftline{516:\ \ \ \ \ \keya{}while\symbol{}((\normal{}t\symbol{}=\normal{}lexan.read\symbol{}(\normal{}s\symbol{}))!=\normal{}EOF\symbol{}) }
+\leftline{517:\ \ \ \ \ \ \ $\{$ }
+\leftline{518:\ \ \ \ \ \ \ \ \ \comment{}//printf("Type\ :\ \%d\ -\ \%s\n",t,s); }
+\symbol{}\leftline{519:\ \ \ \ \ \ \ \ \ \normal{}printf\symbol{}("\normal{}\%s\symbol{}",\normal{}s\symbol{}); }
+\leftline{520:\ \ \ \ \ \ \ \ \ \normal{}tex.write\symbol{}(\normal{}t\symbol{},\normal{}s\symbol{}); }
+\leftline{521:\ \ \ \ \ \ \ \ \ \comment{}//getchar(); }
+\symbol{}\leftline{522:\ \ \ \ \ \ \ $\}$ }
+\leftline{523:\ \ \  }
+\keya{}\leftline{524:\ \ \ return\symbol{}\ \normal{}0\symbol{}; }
+\leftline{525:\ \ \ $\}$ }
+\leftline{526:\ \ \  }
+\leftline{527:\ \ \  }
+\leftline{528:\ \ \  }
+\leftline{529:\ \ \  }
+\leftline{530:\ \ \  }
Index: trunk/VUT/doc/SciReport/code/actualcode.cpp
===================================================================
--- trunk/VUT/doc/SciReport/code/actualcode.cpp	(revision 243)
+++ trunk/VUT/doc/SciReport/code/actualcode.cpp	(revision 243)
@@ -0,0 +1,104 @@
+void NV_PureKdTreeRenderAction::TraverseNode(KdTreeNode *pCurrNode)
+{
+	if (pCurrNode->m_bLeaf)
+	{
+		// this has a frame counter to prevent double rendering
+		pCurrNode->RenderGeometry();
+	}
+	else
+	{
+		Point3f	ptViewpoint	= GetState()->GetCamera()->GetPosition();
+
+		//---- insert the children in the reverse order as they shall be dealt with
+		if (ptViewpoint[pCurrNode->m_iSplitAxis] > pCurrNode->m_fSplitValue)
+		{
+			m_TraverseStack.Push(pCurrNode->m_pLeftChild);
+			m_TraverseStack.Push(pCurrNode->m_pRightChild);
+		}
+		else
+		{
+			m_TraverseStack.Push(pCurrNode->m_pRightChild);
+			m_TraverseStack.Push(pCurrNode->m_pLeftChild);
+		}
+	} // no leaf
+}
+
+
+//---- the actual render algorithm
+void	NV_PureKdTreeRenderAction::RenderSorted()
+{
+	KdTreeNode	* pCurrNode;
+	int			iTestCounter	= 0;
+
+	//---- clear the two needed datastructures
+	m_TraverseStack.Clear();
+	m_NVTestQueue.Clear();
+
+	//---- generate the occlusion queries
+	glGenOcclusionQueriesNV(m_nNumNodes, m_pOcclusionQueries);
+
+	//---- take the root as a start
+	m_pKdTree->m_iPlaneMask	= 0x3f;	// = 0011 1111 which means that at the beginning, all six planes have to frustum culled
+	m_TraverseStack.Push(m_pKdTree);
+
+	//---- the loop
+	while ((!m_TraverseStack.Empty()) || (!m_NVTestQueue.Empty()))
+	{
+		bool result_available;
+
+		while (!m_NVTestQueue.Empty() && 
+					(m_TraverseStack.Empty() ||
+					 (result_available = ResultAvailable(m_NVTestQueue.GetFirst()->m_nTest))
+					)
+			   )
+		{
+			pCurrNode = m_NVTestQueue.GetFirst(); m_NVTestQueue.RemoveFirst();
+			
+			// the next line is only interesting if we want to avoid double rendering already here:
+			//bool was_visible = pCurrNode->m_bVisible && (m_nLastVisitedId == (GetCurrentFrame() - 1));
+			
+			// update visibility classification (this is the wait variety!)
+			pCurrNode->m_bVisible = GetVisiblePixels(pCurrNode->m_nTest) > Settings::Global()->get_nvocc_pixel_treshold();
+			pCurrNode->m_nLastVisitedId = GetCurrentFrame();
+
+			if (pCurrNode->m_bVisible) // && !was_visible)	// note: could prevent double rendering already here!
+			{
+				pCurrNode->MakeParentsVisible();
+				TraverseNode(pCurrNode);
+			} // visible
+		}
+
+		//---- the second part manages the distance heap
+		if (!m_TraverseStack.Empty())
+		{
+			//---- get the element with the lowest distance
+			pCurrNode	= m_TraverseStack.Pop();			
+
+			// question: what is the difference if we do frustum culling only after setting visibility?
+			if (pCurrNode->IsWithinViewFrustum())
+			{
+				bool was_visible = pCurrNode->m_bVisible && (pCurrNode->m_nLastVisitedId == (GetCurrentFrame() - 1));
+				
+				// note: this is actually only done for internal nodes and could be skipped for leaf nodes
+				// in which case leaf node double rendering could be prevented here (see above)
+				pCurrNode->m_bVisible = FALSE;
+				pCurrNode->m_nLastVisitedId = GetCurrentFrame();
+				
+				if (pCurrNode->m_bLeaf || !was_visible)
+				{
+					if (pCurrNode->m_pSuccessor->IssueNVTest(m_pOcclusionQueries[iTestCounter])) ++iTestCounter;
+					m_NVTestQueue.Append(pCurrNode);
+				}
+
+				if (was_visible)
+				{
+					TraverseNode(pCurrNode);
+				}
+			}
+		}
+	}
+
+	//---- tell the driver that the occlusion queries won't be needed any more
+	glDeleteOcclusionQueriesNV(m_nNumNodes, m_pOcclusionQueries);
+
+}
Index: trunk/VUT/doc/SciReport/code/c2tex.cpp
===================================================================
--- trunk/VUT/doc/SciReport/code/c2tex.cpp	(revision 243)
+++ trunk/VUT/doc/SciReport/code/c2tex.cpp	(revision 243)
@@ -0,0 +1,531 @@
+
+/**************************************************************************
+c2tex - Konverze C++ do TeXu
+Jiri Bittner, Cerven 1996
+**************************************************************************/
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <string.h>
+#include <iostream.h>
+#include <fstream.h>
+
+
+#define	KEYWORD1	1	// kody pro jednotlive znacky
+#define	KEYWORD2	2
+#define	SYMBOL		3
+#define	COMMENT        4
+#define	NORMAL		5
+
+#define	WORD	10
+
+#define	S_LEN	256
+
+int pascal=0;
+
+char comment_1b='/',comment_2b='*',comment_1e='*',comment_2e='/';
+
+class BaseC
+{
+
+};
+
+
+typedef double Real;
+
+
+class OptionsC : public BaseC
+{
+public:
+
+  int    number;
+  char **strings;
+  
+//  OptionsC() { number=0; }
+  OptionsC(int n,char **a) { init(n,a); }
+
+  void init(int n,char **s) { number=n; strings=s; }
+  int isOption(char *string);
+  int isOption(char *string,int *number);
+  int getParam(char *s,int n=1);
+
+  int getOptionValue(char *string,int *result);
+  int getOptionValue(char *string,Real *r);
+  int getOptionValue(char *string,char *result);
+
+};
+
+
+class LexanC: public BaseC
+{
+public:
+FILE *file;
+
+int 	nsep,nkey[2];
+char	*separators;
+char	**key[2];
+
+LexanC(){init("default.lex");}
+
+int	isSeparator(int c){ return strchr(separators,c)!=NULL; }
+int	isKey(char *s);
+
+int	init(const char *lexname);
+int 	open(const char *filename);
+
+int	readWord(FILE *f,char *string);
+
+int	read(char *string);
+void 	close(){fclose(file);}
+
+virtual	ostream& operator>>(ostream &s) { 
+	s<<nsep<<"\n"<<nkey[0]<<"\n"<<nkey[1]<<"\n";
+	return s;
+					}
+~LexanC(){fclose(file);}
+};
+
+class TexC: public BaseC
+{
+public:
+  FILE *file;
+  int numbers;
+  int lnumber;
+  
+  TexC(){numbers=0; init("output.tex");}
+  TexC(int n, const char *s){
+    lnumber=0;
+    numbers=n; init(s);}
+  
+  int init(const char *filename);
+  int write(const int code,const char *string);
+  ~TexC() { /* fprintf(file,"\n\\bye\n"); */ fclose(file);}
+
+};
+
+
+
+
+
+
+
+
+int OptionsC::isOption(char *s)
+{
+int found=0;
+ 
+ for (int i=1;i<number;i++)
+   if (strcmp(s,strings[i])==0) { found = i; break;}
+
+ return found;
+}
+
+int OptionsC::isOption(char *s,int *n)
+{
+int found=0;
+
+for (int i=1;i<number;i++)
+  if (strcmp(s,strings[i])==0)
+    {
+      if (i+1<number)
+	{
+	  *n=atoi(strings[i+1]);
+	  found = i;
+	  break;
+	}
+    }
+
+return found;
+}
+
+
+// search for occurence of non-option
+int OptionsC::getParam(char *s,int n)
+{
+int i,k=1,found=0;
+
+for (i=1;i<number;i++)
+  if (strings[i][0]!='-')
+    if (k==n) { found=1; break;}
+       else
+	 k++;
+
+if (found) strcpy(s,strings[i]);
+
+return found;
+}
+
+
+
+int OptionsC::getOptionValue(char *s,int *result)
+{
+int found=0;
+char *pp;
+
+for (int i=1;i<number;i++)
+  {
+    if (strstr(strings[i],s))
+    {
+      pp=strings[i]+strlen(s);
+      *result=atoi(pp);
+      found = i;
+      break;
+    }
+  }
+return found;
+}
+
+int
+OptionsC::getOptionValue(char *s,Real *result)
+{
+int found=0;
+char *pp;
+
+for (int i=1;i<number;i++)
+  {
+    if (strstr(strings[i],s))
+    {
+      pp=strings[i]+strlen(s);
+      *result=atof(pp);
+      found = i;
+      break;
+    }
+  }
+return found;
+}
+
+int OptionsC::getOptionValue(char *s,char *result)
+{
+int found=0;
+char *pp;
+
+for (int i=1;i<number;i++)
+  {
+    if (strstr(strings[i],s))
+    {
+      pp=strings[i]+strlen(s);
+      strcpy(result,pp);
+      found = i;
+      break;
+    }
+  }
+return found;
+}
+
+
+int TexC::write(const int code,const char *string)
+{
+static int line=1;
+static int i=0;
+const char *sp;
+
+switch(code) {
+  
+ case KEYWORD1 : fprintf(file,"\\keya{}"); break;
+ case KEYWORD2 : fprintf(file,"\\keyb{}"); break;
+ case COMMENT  : fprintf(file,"\\comment{}"); break;
+ case SYMBOL   : fprintf(file,"\\symbol{}"); break;
+ case NORMAL   : fprintf(file,"\\normal{}"); break;
+}
+ 
+ for(sp=string;*sp!=0;sp++,i++)
+   {
+     if (line) {
+       fprintf(file,"\\leftline{"); line=0;
+       if (strstr(string, "Algorithm") == string)
+	 lnumber = 0;
+       if (numbers && lnumber)
+	 fprintf(file,"%2d:\\ \\ \\ ",lnumber);
+       lnumber++;
+     }
+     
+     switch(*sp) {
+       
+#define TAB_SIZE	8
+     case '\t' :	
+       //		fprintf(file,"\\tab"); break;
+       int n,j;
+       n=((i/TAB_SIZE)+1)*TAB_SIZE-i;
+       for(j=0;j<n;j++) fprintf(file,"\\ ");
+       break;
+       
+       
+     case '\n': 	fprintf(file," }\n");
+       line=1; i=0;
+       break;
+     case ' ' :	fprintf(file,"\\ ");
+      break;
+      case '&' :	fprintf(file,"\\&"); break;
+      case '#' :	fprintf(file,"\\#"); break;
+	//      case '_' :	fprintf(file,"\\_{}"); break;
+      case '_' :	fprintf(file,"_"); break;
+      case '^' :	fprintf(file,"\\^{}"); break;
+      case '%' :	fprintf(file,"\\%%"); break;
+      case '{' :	fprintf(file,"$\\{$"); break;
+      case '}' :	fprintf(file,"$\\}$"); break;
+	//  case '\\' :	fprintf(file,"$\\backslash$"); break;
+	//  case '$' :	fprintf(file,"\\$"); break;
+    //  case '<' :	fprintf(file,"\\<"); break;
+    //  case '>' :	fprintf(file,"\\>"); break;
+
+  case '~' :	fprintf(file,"\\~{}"); break;
+      
+    
+  default  :	fputc(*sp,file);
+  }
+}
+return 1;
+}
+
+
+int	LexanC::isKey(char *s)
+{
+int i,j;
+
+for (i=0;i<2;i++)
+ for(j=0;j<nkey[i];j++)
+  if(strcmp(s,key[i][j])==0) return i+1;
+
+return 0;
+}
+
+
+int 	LexanC::readWord(FILE *f,char *s)
+{
+int	i=0;
+int	c;
+
+do
+{
+	c=fgetc(f);
+	if (c==EOF) return 0;
+	if (!isSeparator(c)) break;
+} while(1);
+
+
+do
+{
+	s[i++]=c;
+	c=fgetc(f);
+	if (c==EOF) break;
+	if (isSeparator(c)) break;
+} while(1);
+
+s[i]=0;
+return 1;
+}
+
+
+int	LexanC::init(const char *lexname)
+{
+FILE *f;
+
+if ((f=fopen(lexname,"rt"))==NULL) return 0;
+
+
+#define 	NKEY	512
+
+separators = new char[256];
+key[0]   = new char*[NKEY];
+key[1]   = new char*[NKEY];
+
+nsep=0;
+separators[nsep++]=' ';
+separators[nsep++]='\n';
+separators[nsep++]='\t';
+
+fgets(separators+nsep,100,f);
+nsep=strlen(separators);
+
+int i=0,type=0;
+char s[64];
+
+while(readWord(f,s))
+	{
+	if (strcmp(s,"KEYWORDS2")==0) 
+	{
+	    printf("KEYWORDS2\n");
+	    nkey[type]=i; 
+	    type++; 
+	    i=0;  
+	}
+	else
+	{
+		printf("%s\n",s);	
+		key[type][i]=new char[strlen(s)+1];
+		strcpy(key[type][i],s);
+		i++;
+	}
+	}
+
+nkey[type]=i; 
+
+fclose(f);
+
+ 
+return 1;
+}
+
+int 	LexanC::open(const char *filename)
+{
+file=fopen(filename,"rt");
+return file!=NULL;
+}
+
+int	LexanC::read(char *s)
+{
+int	i=0;
+int	type=EOF;
+int	wasSlash=0;
+static	int	c=-2;
+
+if (c==-2)  c=fgetc(file);
+
+if (c==EOF) return c;
+
+do{
+if (isSeparator(c)) {
+	type=SYMBOL;
+	s[i++]=c;
+
+	if(wasSlash) {
+	  if(c==comment_1b)  // line comment
+	    { 
+	      if (i>2) { c=s[i-2]; fseek(file,-1,SEEK_CUR); s[i-2]=0; 
+	      return type; }
+	      fgets(s+i,S_LEN,file); 
+	      c=fgetc(file);
+	      return COMMENT;
+	    }
+	  else
+	    if(c==comment_2b)  // line comment
+	      { 
+		if (i>2) { c=s[i-2]; fseek(file,-1,SEEK_CUR); s[i-2]=0; 
+		return type; }
+		c=fgetc(file);
+		if(c!=EOF)
+		  {
+		    s[i++]=c;
+		    int count=1;
+			do{
+			  c=fgetc(file);
+			  if(c==EOF) break;
+			  s[i++]=c;
+			  if (s[i-2]==comment_1e && s[i-1]==comment_2e) count--;
+			  if (s[i-2]==comment_1b &&s[i-1]==comment_2b) count++;
+			} while(count!=0);
+		      }
+		    s[i]=0;
+		    c=fgetc(file);
+		    return COMMENT;
+		  }
+	    }
+	  else
+	    wasSlash=(c==comment_1b);	
+} else
+  if (c=='`') {
+    if (i>=1) {
+      s[i]=0;
+      return type;
+    }
+    c=fgetc(file);
+    while(c!='`') {
+      if (c==EOF) break;
+      s[i++]=c;
+      c=fgetc(file);
+    }
+    s[i]=0;
+    c=fgetc(file);
+    return WORD;
+  } else {
+    if (type==EOF) type=WORD;
+    break;
+  }
+} while((c=fgetc(file))!=EOF);
+ 
+if (c!=EOF)
+if (type==WORD)
+{
+do
+{
+s[i++]=c;
+c=fgetc(file);
+if (c==EOF) break;
+} while(!isSeparator(c));
+
+s[i]=0;
+int k=isKey(s);
+if (k==0) return NORMAL;
+return k;
+}
+
+s[i]=0;
+return type;
+
+}
+
+int TexC::init(const char *filename)
+{
+file=fopen(filename,"wt");
+fprintf(file,"\\input default.mac\n");
+return file!=NULL;
+}
+
+
+void Help()
+{
+  printf("Syntax : c2tex in_file [out_file] [-pascal] [-numbers]\n\n");
+  printf("Default out_file is output.tex.\n");
+  printf("-pascal     use pascal comments (* *).\n");
+  printf("-numbers    print line numbers.\n");
+  exit(1);
+}
+
+int main(int argc, char **argv)
+{
+char	s[16384]; // docasny buffer
+
+OptionsC options(argc,argv);
+ 
+ if (argc<2) Help();
+ if (argc>=3 && (*argv[2]!='-') )
+   strcpy(s,argv[2]);
+ else
+   strcpy(s,"output.tex");
+ 
+ if (options.isOption("-pascal")) {
+    pascal=1;
+    comment_1b='(';
+    comment_2b='*';
+    comment_1e='*';
+    comment_2e=')';
+ }
+
+ int numbers;
+ 
+ numbers = options.isOption("-numbers");
+ 
+ 
+  LexanC	lexan;
+  TexC	tex(numbers, s);
+  lexan.open(argv[1]);
+
+  int	t;
+  cout<<tex.numbers;
+
+  
+  while((t=lexan.read(s))!=EOF)
+    {
+      //printf("Type : %d - %s\n",t,s);
+      printf("%s",s);
+      tex.write(t,s);
+      //getchar();
+    }
+
+return 0;
+}
+
+
+
+
+
Index: trunk/VUT/doc/SciReport/code/pseudocode.tex
===================================================================
--- trunk/VUT/doc/SciReport/code/pseudocode.tex	(revision 243)
+++ trunk/VUT/doc/SciReport/code/pseudocode.tex	(revision 243)
@@ -0,0 +1,113 @@
+\input default.mac
+\comment{}\leftline{//----\ initialisation
+ }
+\normal{}\leftline{ 1:\ \ \ Stack.Push\symbol{}(\normal{}kDTree.Root\symbol{});\normal{}
+\symbol{} }
+\comment{}\leftline{ 2:\ \ \ //----\ while\ there\ are\ some\ nodes\ in\ the\ stack\ or\ the\ query\ queue
+ }
+\keya{}\leftline{ 3:\ \ \ while\symbol{}\ (!\normal{}Stack.Empty\symbol{}()\ \normal{}$\symbol{}||\normal{}$\symbol{}\ !\normal{}QueryQueue.Empty\symbol{}())\ $\{$\normal{}
+\symbol{} }
+\leftline{ 4:\ \ \ \ \ \comment{}//----\ PART\ 1:\ processing\ finished\ occlusion\ queries
+ }
+\symbol{}\leftline{ 5:\ \ \ \ \ \keya{}while\symbol{}\ (!\normal{}QueryQueue.Empty\symbol{}()\ \&\&\normal{}
+\symbol{} }
+\leftline{ 6:\ \ \ \ \ \ \ \ \ \ \ (\normal{}ResultAvailable\symbol{}(\normal{}QueryQueue.Front\symbol{}())\ \normal{}$\symbol{}||\normal{}$\symbol{}\ \normal{}Stack.Empty\symbol{}()))\ $\{$\normal{}
+\symbol{} }
+\leftline{ 7:\ \ \ \ \ \ \ \keya{}if\symbol{}\ (!\normal{}ResultAvailable\symbol{}(\normal{}QueryQueue.Front\symbol{}()))\ $\{$\normal{}
+\symbol{} }
+\leftline{ 8:\ \ \ \ \ \ \ \ \ \comment{}//---\ result\ is\ not\ available\ and\ the\ stack\ is\ empty
+ }
+\symbol{}\leftline{ 9:\ \ \ \ \ \ \ \ \ \comment{}//---\ check\ if\ we\ can\ do\ some\ conservative\ decision
+ }
+\symbol{}\leftline{10:\ \ \ \ \ \ \ \ \ \normal{}N\symbol{}\ =\ \normal{}QueryQueue.GetLeastCostNode\symbol{}();\normal{}
+\symbol{} }
+\leftline{11:\ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}N.renderingCost\symbol{}\ <\ \normal{}MaxRenderCost\symbol{})\ $\{$\normal{}
+\symbol{} }
+\leftline{12:\ \ \ \ \ \ \ \ \ \ \normal{}RenderSubtree\symbol{}(\normal{}N\symbol{});\normal{}
+\symbol{} }
+\leftline{13:\ \ \ \ \ \ \ \ \ \ \normal{}QueryQueue.DequeLeastCostNode\symbol{}();\normal{}
+\symbol{} }
+\leftline{14:\ \ \ \ \ \ \ \ \ \ \comment{}//--\ we\ do\ not\ change\ N's\ visibility\ classfication\ -
+ }
+\symbol{}\leftline{15:\ \ \ \ \ \ \ \ \ \ \comment{}//--\ N\ remains\ in\ the\ cut\ for\ the\ next\ frame
+ }
+\symbol{}\leftline{16:\ \ \ \ \ \ \ \ \ $\}$\ \normal{}else
+\symbol{} }
+\leftline{17:\ \ \ \ \ \ \ \ \ \ \comment{}//--\ wait\ for\ the\ availability\ of\ the\ result
+ }
+\symbol{}\leftline{18:\ \ \ \ \ \ \ \ \ \ \keya{}while\symbol{}\ (!\normal{}QueryQueue.ResultAvailable\symbol{})\ \normal{}Wait\symbol{}();\normal{}
+\symbol{} }
+\leftline{19:\ \ \ \ \ \ \ $\}$\ \keya{}else\symbol{}\ $\{$\normal{}
+\symbol{} }
+\leftline{20:\ \ \ \ \ \ \ \ \ \normal{}N\symbol{}\ =\ \normal{}QueryQueue.Dequeue\symbol{}();\normal{}
+\symbol{} }
+\leftline{21:\ \ \ \ \ \ \ \ \ \comment{}//--\ check\ the\ result\ of\ the\ query
+ }
+\symbol{}\leftline{22:\ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\ \normal{}N.visiblePixels\symbol{}\ \normal{}$\symbol{}>\normal{}$\symbol{}\ \normal{}VisibilityThreshold\symbol{}\ )\ \ $\{$\normal{}
+\symbol{} }
+\leftline{23:\ \ \ \ \ \ \ \ \ \ \normal{}N.visibility\symbol{}\ =\ \normal{}VISIBLE\symbol{};\normal{}
+\symbol{} }
+\leftline{24:\ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}IsLeaf\symbol{}(\normal{}N\symbol{}))\normal{}
+\symbol{} }
+\leftline{25:\ \ \ \ \ \ \ \ \ \ \ \ \normal{}Render\symbol{}(\normal{}N\symbol{});\normal{}
+\symbol{} }
+\leftline{26:\ \ \ \ \ \ \ \ \ \ \keya{}else\symbol{}\ $\{$\normal{}
+\symbol{} }
+\leftline{27:\ \ \ \ \ \ \ \ \ \ \ \ \comment{}//--\ pull\ down
+ }
+\symbol{}\leftline{28:\ \ \ \ \ \ \ \ \ \ \ \ \normal{}Stack.Push\symbol{}(\normal{}FarChild\symbol{}(\normal{}N\symbol{}));\ \normal{}Stack.Push\symbol{}(\normal{}CloseChild\symbol{}(\normal{}N\symbol{}));\normal{}
+\symbol{} }
+\leftline{29:\ \ \ \ \ \ \ \ \ \ $\}$\normal{}
+\symbol{} }
+\leftline{30:\ \ \ \ \ \ \ \ \ $\}$\ \keya{}else\symbol{}\ $\{$\normal{}
+\symbol{} }
+\leftline{31:\ \ \ \ \ \ \ \ \ \ \normal{}N.visibility\symbol{}\ =\ \normal{}INVISIBLE\symbol{};\normal{}
+\symbol{} }
+\leftline{32:\ \ \ \ \ \ \ \ \ \ \comment{}//--\ pull\ up
+ }
+\symbol{}\leftline{33:\ \ \ \ \ \ \ \ \ \ \normal{}PullUpInvisibility\symbol{}(\normal{}N\symbol{});\normal{}
+\symbol{} }
+\leftline{34:\ \ \ \ \ \ \ \ \ $\}$\normal{}
+\symbol{} }
+\leftline{35:\ \ \ \ \ \ \ $\}$\normal{}
+\symbol{} }
+\leftline{36:\ \ \ \ \ $\}$\normal{}
+\symbol{} }
+\leftline{37:\ \ \ \ \ \normal{}
+\symbol{} }
+\leftline{38:\ \ \ \ \ \comment{}//----\ PART\ 2:\ kd-tree\ traversal
+ }
+\symbol{}\leftline{39:\ \ \ \ \ \keya{}if\symbol{}\ (!\normal{}Stack.Empty\symbol{}())\ $\{$\normal{}
+\symbol{} }
+\leftline{40:\ \ \ \ \ \ \ \normal{}N\symbol{}\ =\ \normal{}Stack.Pop\symbol{}();\normal{}
+\symbol{} }
+\leftline{41:\ \ \ \ \ \ \ \normal{}N.lastVisited\symbol{}\ =\ \normal{}frameID\symbol{};\normal{}
+\symbol{} }
+\leftline{42:\ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}InsideViewFrustum\symbol{}(\normal{}N\symbol{}))\ $\{$\normal{}
+\symbol{} }
+\leftline{43:\ \ \ \ \ \ \ \ \ \comment{}//--\ skip\ testing\ of\ all\ nodes\ above\ the\ cut
+ }
+\symbol{}\leftline{44:\ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (!\normal{}IsAboveTheCut\symbol{}(\normal{}N\symbol{}))\ $\{$\normal{}
+\symbol{} }
+\leftline{45:\ \ \ \ \ \ \ \ \ \ \normal{}IssueOcclustionQuery\symbol{}(\normal{}N\symbol{});\ \normal{}QueryQueue.Enqueue\symbol{}(\normal{}N\symbol{});\normal{}
+\symbol{} }
+\leftline{46:\ \ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\normal{}WasVisible\symbol{}(\normal{}N\symbol{})\ \normal{}$\symbol{}\&\&\normal{}$\symbol{}\ \normal{}IsLeaf\symbol{}(\normal{}N\symbol{}))\normal{}
+\symbol{} }
+\leftline{47:\ \ \ \ \ \ \ \ \ \ \ \ \normal{}Render\symbol{}(\normal{}N\symbol{});\normal{}
+\symbol{} }
+\leftline{48:\ \ \ \ \ \ \ \ \ \ \keya{}else\symbol{}\ $\{$\normal{}
+\symbol{} }
+\leftline{49:\ \ \ \ \ \ \ \ \ \ \ \ \comment{}//--\ go\ down\ the\ kD-tree
+ }
+\symbol{}\leftline{50:\ \ \ \ \ \ \ \ \ \ \ \ \normal{}Stack.Push\symbol{}(\normal{}FarChild\symbol{}(\normal{}N\symbol{}));\ \normal{}Stack.Push\symbol{}(\normal{}CloseChild\symbol{}(\normal{}N\symbol{}));\ \normal{}
+\symbol{} }
+\leftline{51:\ \ \ \ \ \ \ \ \ \ $\}$\normal{}
+\symbol{} }
+\leftline{52:\ \ \ \ \ \ \ \ \ $\}$\normal{}
+\symbol{} }
+\leftline{53:\ \ \ \ \ \ \ $\}$\normal{}
+\symbol{} }
+\leftline{54:\ \ \ \ \ $\}$\normal{}
+\symbol{} }
+\leftline{55:\ \ \ $\}$\normal{}
+\symbol{} }
Index: trunk/VUT/doc/SciReport/code/CVS/Repository
===================================================================
--- trunk/VUT/doc/SciReport/code/CVS/Repository	(revision 243)
+++ trunk/VUT/doc/SciReport/code/CVS/Repository	(revision 243)
@@ -0,0 +1,1 @@
+bittner/papers/EG.04/code
Index: trunk/VUT/doc/SciReport/code/CVS/Root
===================================================================
--- trunk/VUT/doc/SciReport/code/CVS/Root	(revision 243)
+++ trunk/VUT/doc/SciReport/code/CVS/Root	(revision 243)
@@ -0,0 +1,1 @@
+bittner@zwirn:/usr/local/cvsroot
Index: trunk/VUT/doc/SciReport/code/CVS/Entries
===================================================================
--- trunk/VUT/doc/SciReport/code/CVS/Entries	(revision 243)
+++ trunk/VUT/doc/SciReport/code/CVS/Entries	(revision 243)
@@ -0,0 +1,10 @@
+/actualcode.cpp/1.1/Sat Jan 31 00:06:56 2004//
+/c2tex/1.2/Sun Feb  1 21:26:24 2004/-kb/
+/c2tex.cpp/1.2/Sun Feb  1 21:25:48 2004//
+/default.lex/1.2/Sat Jan 31 09:10:56 2004//
+/pseudocode.cpp/1.2/Thu Jan 29 20:15:32 2004//
+/pseudocode.tex/1.1/Sun Feb  1 21:26:24 2004//
+/makefile/1.4/Mon Feb  2 23:18:56 2004//
+/pseudocode2.cpp/1.6/Wed May  5 13:59:42 2004//
+/pseudocode2.tex/1.8/Wed May  5 13:59:44 2004//
+D
Index: trunk/VUT/doc/SciReport/code/default.lex
===================================================================
--- trunk/VUT/doc/SciReport/code/default.lex	(revision 243)
+++ trunk/VUT/doc/SciReport/code/default.lex	(revision 243)
@@ -0,0 +1,14 @@
+{}[]()=+-*/:;<>|&,~!^?'"\
+
+asm auto break case catch cdecl char class const continue default
+delete double do else enum extern far float for friend goto huge
+if interrupt int long near new operator pascal private protected
+public register return short signed sizeof static struct switch
+template this throw try typedef union unsigned virtual void
+volatile while yield foreach then begin end Algorithm and or not
+
+KEYWORDS2
+#define #elif #else #endif #error #ifdef #ifndef #if #include
+#line #pragma #undef elif inline warn
+
+
Index: trunk/VUT/doc/SciReport/code/pseudocode.cpp
===================================================================
--- trunk/VUT/doc/SciReport/code/pseudocode.cpp	(revision 243)
+++ trunk/VUT/doc/SciReport/code/pseudocode.cpp	(revision 243)
@@ -0,0 +1,56 @@
+//---- initialisation
+Stack.Push(kDTree.Root);
+//---- while there are some nodes in the stack or the query queue
+while (!Stack.Empty() $||$ !QueryQueue.Empty()) {
+  //---- PART 1: processing finished occlusion queries
+  while (!QueryQueue.Empty() &&
+	 (ResultAvailable(QueryQueue.Front()) $||$ Stack.Empty())) {
+    if (!ResultAvailable(QueryQueue.Front())) {
+      //--- result is not available and the stack is empty
+      //--- check if we can do some conservative decision
+      N = QueryQueue.GetLeastCostNode();
+      if (N.renderingCost < MaxRenderCost) {
+	RenderSubtree(N);
+	QueryQueue.DequeLeastCostNode();
+	//-- we do not change N's visibility classfication -
+	//-- N remains in the cut for the next frame
+      } else
+	//-- wait for the availability of the result
+	while (!QueryQueue.ResultAvailable) Wait();
+    } else {
+      N = QueryQueue.Dequeue();
+      //-- check the result of the query
+      if ( N.visiblePixels $>$ VisibilityThreshold )  {
+	N.visibility = VISIBLE;
+	if (IsLeaf(N))
+	  Render(N);
+	else {
+	  //-- pull down
+	  Stack.Push(FarChild(N)); Stack.Push(CloseChild(N));
+	}
+      } else {
+	N.visibility = INVISIBLE;
+	//-- pull up
+	PullUpInvisibility(N);
+      }
+    }
+  }
+  
+  //---- PART 2: kd-tree traversal
+  if (!Stack.Empty()) {
+    N = Stack.Pop();
+    N.lastVisited = frameID;
+    if (InsideViewFrustum(N)) {
+      //-- skip testing of all nodes above the cut
+      if (!IsAboveTheCut(N)) {
+	IssueOcclustionQuery(N); QueryQueue.Enqueue(N);
+	if (WasVisible(N) $&&$ IsLeaf(N))
+	  Render(N);
+	else {
+	  //-- go down the kD-tree
+	  Stack.Push(FarChild(N)); Stack.Push(CloseChild(N)); 
+	}
+      }
+    }
+  }
+}
Index: trunk/VUT/doc/SciReport/code/pseudocode2.tex
===================================================================
--- trunk/VUT/doc/SciReport/code/pseudocode2.tex	(revision 243)
+++ trunk/VUT/doc/SciReport/code/pseudocode2.tex	(revision 243)
@@ -0,0 +1,48 @@
+\input default.mac
+\keya{}\leftline{Algorithm\symbol{}:\ \normal{}Traversal\symbol{}\ \normal{}of\symbol{}\ \normal{}the\symbol{}\ \normal{}kD\symbol{}-\normal{}tree\symbol{} }
+\normal{}\leftline{ 1:\ \ \ TraversalStack.Push\symbol{}(\normal{}kDTree.Root\symbol{}); }
+\keya{}\leftline{ 2:\ \ \ while\symbol{}\ (\ \keya{}not\symbol{}\ \normal{}TraversalStack.Empty\symbol{}()\ \keya{}or\symbol{} }
+\leftline{ 3:\ \ \ \ \ \ \ \ \ \ \ \keya{}not\symbol{}\ \normal{}QueryQueue.Empty\symbol{}()\ )\ $\{$ }
+\leftline{ 4:\ \ \ \ \ \comment{}//----\ PART\ 1:\ processing\ finished\ occlusion\ queries }
+\symbol{}\leftline{ 5:\ \ \ \ \ \keya{}while\symbol{}\ (\ \keya{}not\symbol{}\ \normal{}QueryQueue.Empty\symbol{}()\ \keya{}and\symbol{} }
+\leftline{ 6:\ \ \ \ \ \ \ \ \ \ \ \ (\normal{}ResultAvailable\symbol{}(\normal{}QueryQueue.Front\symbol{}())\ \keya{}or\symbol{} }
+\leftline{ 7:\ \ \ \ \ \ \ \ \ \ \ \ \ \normal{}TraversalStack.Empty\symbol{}())\ )\ $\{$ }
+\leftline{ 8:\ \ \ \ \ \ \ \normal{}N\symbol{}\ =\ \normal{}QueryQueue.Dequeue\symbol{}(); }
+\leftline{ 9:\ \ \ \ \ \ \ \comment{}//\ wait\ if\ result\ not\ available }
+\symbol{}\leftline{10:\ \ \ \ \ \ \ \normal{}visiblePixels\symbol{}\ =\ \normal{}GetOcclussionQueryResult\symbol{}(\normal{}N\symbol{}); }
+\leftline{11:\ \ \ \ \ \ \ \keya{}if\symbol{}\ (\ \normal{}visiblePixels\symbol{}\ >\ \normal{}VisibilityThreshold\symbol{}\ )\ $\{$ }
+\leftline{12:\ \ \ \ \ \ \ \ \ \normal{}PullUpVisibility\symbol{}(\normal{}N\symbol{}); }
+\leftline{13:\ \ \ \ \ \ \ \ \ \normal{}TraverseNode\symbol{}(\normal{}N\symbol{}); }
+\leftline{14:\ \ \ \ \ \ \ $\}$ }
+\leftline{15:\ \ \ \ \ $\}$ }
+\leftline{16:\ \ \ \ \ \comment{}//----\ PART\ 2:\ kd-tree\ traversal }
+\symbol{}\leftline{17:\ \ \ \ \ \keya{}if\symbol{}\ (\ \keya{}not\symbol{}\ \normal{}TraversalStack.Empty\symbol{}()\ )\ $\{$ }
+\leftline{18:\ \ \ \ \ \ \ \normal{}N\symbol{}\ =\ \normal{}TraversalStack.Pop\symbol{}(); }
+\leftline{19:\ \ \ \ \ \ \ \keya{}if\symbol{}\ (\ \normal{}InsideViewFrustum\symbol{}(\normal{}N\symbol{})\ )\ $\{$ }
+\leftline{20:\ \ \ \ \ \ \ \ \ \comment{}//\ identify\ previously\ visible\ nodes }
+\symbol{}\leftline{21:\ \ \ \ \ \ \ \ \ \normal{}wasVisible\symbol{}\ =\ \normal{}N.visible\symbol{}\ \&\&\ (\normal{}N.lastVisited\symbol{}\ ==\ \normal{}frameID\symbol{}\ -\normal{}1\symbol{}); }
+\leftline{22:\ \ \ \ \ \ \ \ \ \comment{}//\ identify\ previously\ opened\ nodes }
+\symbol{}\leftline{23:\ \ \ \ \ \ \ \ \ \normal{}opened\symbol{}\ =\ \normal{}wasVisible\symbol{}\ \&\&\ !\normal{}IsLeaf\symbol{}(\normal{}N\symbol{}); }
+\leftline{24:\ \ \ \ \ \ \ \ \ \comment{}//\ reset\ node's\ visibility\ classification }
+\symbol{}\leftline{25:\ \ \ \ \ \ \ \ \ \normal{}N.visible\symbol{}\ =\ \normal{}false\symbol{}; }
+\leftline{26:\ \ \ \ \ \ \ \ \ \comment{}//\ update\ node's\ visited\ flag }
+\symbol{}\leftline{27:\ \ \ \ \ \ \ \ \ \normal{}N.lastVisited\symbol{}\ =\ \normal{}frameID\symbol{}; }
+\leftline{28:\ \ \ \ \ \ \ \ \ \comment{}//\ skip\ testing\ all\ previously\ opened\ nodes }
+\symbol{}\leftline{29:\ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\ !\normal{}opened\symbol{}\ )\ $\{$ }
+\leftline{30:\ \ \ \ \ \ \ \ \ \ \normal{}IssueOcclusionQuery\symbol{}(\normal{}N\symbol{});\ \normal{}QueryQueue.Enqueue\symbol{}(\normal{}N\symbol{}); }
+\leftline{31:\ \ \ \ \ \ \ \ \ $\}$ }
+\leftline{32:\ \ \ \ \ \ \ \ \ \comment{}//\ traverse\ a\ node\ unless\ it\ was\ invisible }
+\symbol{}\leftline{33:\ \ \ \ \ \ \ \ \ \keya{}if\symbol{}\ (\ \normal{}wasVisible\symbol{}\ ) }
+\leftline{34:\ \ \ \ \ \ \ \ \ \ \normal{}TraverseNode\symbol{}(\normal{}N\symbol{}); }
+\leftline{35:\ \ \ \ \ \ \ $\}$ }
+\leftline{36:\ \ \ \ \ $\}$ }
+\leftline{37:\ \ \ $\}$ }
+\normal{}\leftline{38:\ \ \ TraverseNode\symbol{}(\normal{}N\symbol{})\ $\{$ }
+\leftline{39:\ \ \ \ \ \keya{}if\symbol{}\ (\ \normal{}IsLeaf\symbol{}(\normal{}N\symbol{})\ ) }
+\leftline{40:\ \ \ \ \ \ \ \normal{}Render\symbol{}(\normal{}N\symbol{}); }
+\leftline{41:\ \ \ \ \ \keya{}else\symbol{} }
+\leftline{42:\ \ \ \ \ \ \ \normal{}TraversalStack.PushChildren\symbol{}(\normal{}N\symbol{}); }
+\leftline{43:\ \ \ $\}$ }
+\normal{}\leftline{44:\ \ \ PullUpVisibility\symbol{}(\normal{}N\symbol{})\ $\{$ }
+\leftline{45:\ \ \ \ \ \keya{}while\symbol{}\ (!\normal{}N.visible\symbol{})\ $\{$\ \normal{}N.visible\symbol{}\ =\ \normal{}true\symbol{};\ \normal{}N\symbol{}\ =\ \normal{}N.parent\symbol{};\ $\}$ }
+\leftline{46:\ \ \ $\}$ }
Index: trunk/VUT/doc/SciReport/code/makefile
===================================================================
--- trunk/VUT/doc/SciReport/code/makefile	(revision 243)
+++ trunk/VUT/doc/SciReport/code/makefile	(revision 243)
@@ -0,0 +1,34 @@
+PAS := $(shell ls *.pas)
+
+CPP := $(shell ls *.cpp)
+
+TEX = ${PAS:.pas=.tex} ${CPP:.cpp=.tex}
+
+C2TEX = ./c2tex
+
+
+DEFAULT: $(C2TEX) $(TEX)
+
+
+clean:
+	rm -f $(TEX)
+
+
+$(C2TEX):
+	g++ c2tex.cpp -o c2tex
+
+
+.SUFFIXES: .pas .cpp .tex
+
+
+
+.pas.tex: $(C2TEX)
+	@echo "Converting $< to $@ ..."
+	@$(C2TEX) $< $@ -pascal -numbers
+	@echo "done."
+
+.cpp.tex: $(C2TEX)
+	@echo "Converting $< to $@ ..."
+	@$(C2TEX) $< $@ -numbers
+	@echo "done."
+
Index: trunk/VUT/doc/SciReport/code/pseudocode2.cpp
===================================================================
--- trunk/VUT/doc/SciReport/code/pseudocode2.cpp	(revision 243)
+++ trunk/VUT/doc/SciReport/code/pseudocode2.cpp	(revision 243)
@@ -0,0 +1,47 @@
+Algorithm: Traversal of the kD-tree
+TraversalStack.Push(kDTree.Root);
+while ( not TraversalStack.Empty() or
+        not QueryQueue.Empty() ) {
+  //---- PART 1: processing finished occlusion queries
+  while ( not QueryQueue.Empty() and
+	  (ResultAvailable(QueryQueue.Front()) or
+	   TraversalStack.Empty()) ) {
+    N = QueryQueue.Dequeue();
+    // wait if result not available
+    visiblePixels = GetOcclussionQueryResult(N);
+    if ( visiblePixels > VisibilityThreshold ) {
+      PullUpVisibility(N);
+      TraverseNode(N);
+    }
+  }
+  //---- PART 2: kd-tree traversal
+  if ( not TraversalStack.Empty() ) {
+    N = TraversalStack.Pop();
+    if ( InsideViewFrustum(N) ) {
+      // identify previously visible nodes
+      wasVisible = N.visible && (N.lastVisited == frameID -1);
+      // identify previously opened nodes
+      opened = wasVisible && !IsLeaf(N);
+      // reset node's visibility classification
+      N.visible = false;
+      // update node's visited flag
+      N.lastVisited = frameID;
+      // skip testing all previously opened nodes
+      if ( !opened ) {
+	IssueOcclusionQuery(N); QueryQueue.Enqueue(N);
+      }
+      // traverse a node unless it was invisible
+      if ( wasVisible )
+	TraverseNode(N);
+    }
+  }
+}
+TraverseNode(N) {
+  if ( IsLeaf(N) )
+    Render(N);
+  else
+    TraversalStack.PushChildren(N);
+}
+PullUpVisibility(N) {
+  while (!N.visible) { N.visible = true; N = N.parent; }
+}
Index: trunk/VUT/doc/SciReport/report.tex
===================================================================
--- trunk/VUT/doc/SciReport/report.tex	(revision 243)
+++ trunk/VUT/doc/SciReport/report.tex	(revision 243)
@@ -0,0 +1,140 @@
+% ---------------------------------------------------------------------------
+% Author guideline and sample document for EG publication using LaTeX2e input
+% D.Fellner, v1.00, Oct 28, 2003
+
+\documentclass[a4paper,times]{report}
+
+% prepare for electronic version of your document
+\usepackage{times}
+\usepackage{a4wide}
+
+% For backwards compatibility to old LaTeX type font selection.
+% Uncomment if your document adheres to LaTeX2e recommendations.
+\let\rm=\rmfamily    \let\sf=\sffamily    \let\tt=\ttfamily
+\let\it=\itshape     \let\sl=\slshape     \let\sc=\scshape
+\let\bf=\bfseries
+
+% end of prologue
+
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
+
+\def\papername{Scientific Description of Algorithms for WP3 (Visibility)}
+\def\paperkeywords{Visibility}
+
+%deklarace tucneho fontu pro matematickou sazbu
+\DeclareSymbolFont{mathbold}{OML}{cmm}{b}{it}
+\DeclareMathAlphabet\mbi{OML}{cmm}{b}{it}
+\def\mc#1{\multicolumn{1}{|c|}{#1}}
+\def\mlc#1{\begin{tabular}{c}#1\end{tabular}}
+
+\def\m25d{2${1 \over 2}$D}
+\def\plucker{Pl\"ucker\ }
+\def\nvoq{NV\_occlusion\_query}
+\def\arboq{ARB\_occlusion\_query}
+\def\hpot{HP\_occlusion\_test}
+
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+% INCLUDING IMAGES ON/OFF
+\def\DRAFTFIGS{false}
+\def\DRAFTIMAGES{false}
+
+
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+%% Latin-2: Pøíli¹ Ÿlu»ouèký kùò úpìl ïábelské ódy.
+%% Win1250?: 'Pøíli± µlu ouèký kùò pìl ïábelské ódy.'
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
+
+\usepackage{thumbpdf}
+\usepackage{alltt}
+\usepackage{times}
+\usepackage{hhline}
+\usepackage{multirow}
+%\usepackage{mathptm}
+%\usepackage{algorithmic}
+%\usepackage{algorithm}
+\usepackage{url}
+\usepackage{rotating}
+
+\usepackage{ifpdf}
+\ifpdf
+\usepackage{graphicx}
+\DeclareGraphicsExtensions{.pdf,.png,.gif,.jpg}
+\else
+\usepackage{graphicx}
+%\usepackage[dvips]{graphicx}
+\DeclareGraphicsExtensions{.eps,.png,.gif,.jpg}
+\fi
+
+
+
+%-------------------------------------------------------------------------
+\begin{document}
+
+
+% ---------------------------------------------------------------------
+% EG author guidelines plus sample file for EG publication using LaTeX2e input
+% D.Fellner, v1.00, Oct 28, 2003
+
+
+\title
+      {\papername}
+
+% for anonymous conference submission please enter your SUBMISSION ID
+% instead of the author's name (and leave the affiliation blank) !!
+\author{Ji\v{r}\'\i{} Bittner, Oliver Mattausch, Michael Wimmer\\
+        Institute of Computer Graphics and Algorithms, Vienna University of Technology\\
+}
+
+
+
+
+% ------------------------------------------------------------------------
+
+% if the Editors-in-Chief have given you the data, you may uncomment
+% the following five lines and insert it here
+%
+% \volume{23}   % the volume in which the issue will be published;
+% \issue{2}     % the issue number of the publication
+% \pStartPage{201}      % set starting page
+
+
+
+\maketitle
+
+\include{online}
+
+\include{preprocessing}
+
+
+\section*{Acknowledgements}
+
+This work has been supported by the {\em Kontakt OE/CZ} grant
+no. 2004/20. Many thanks to Stefan Jeschke for his help with importing
+the Power Plant model.
+
+
+%Use bibtex to produce references
+%\bibliographystyle{unsrt}
+%\bibliographystyle{plain}
+%\bibliographystyle{abbrv}
+%\bibliographystyle{alpha}
+%\bibliographystyle{abbrvnat}
+\bibliographystyle{is-alpha}
+\bibliography{Bib/jiri,Bib/renmame,Bib/rtmame,Bib/cgemame,Bib/vismame,Bib/bookmame,Bib/minimum,Bib/new}
+
+
+
+%% the main contribution of the paper is that it schedules occlusion
+%% queries in an order minimizing the overhead to to latency, and uses
+%% temporal and spatial coherence to do so.  (16:05:46) salzrat:
+%% (basically what we said at the end of the introduction, there it is in
+%% the correct order of importance, because it states the new
+%% contribution first) (16:06:12) salzrat: if we stress the scheduling
+%% more, then the other thing will not be so obviously a reuse of the
+%% other paper
+
+\end{document}
Index: trunk/VUT/doc/SciReport/Bib/grafici.bib
===================================================================
--- trunk/VUT/doc/SciReport/Bib/grafici.bib	(revision 243)
+++ trunk/VUT/doc/SciReport/Bib/grafici.bib	(revision 243)
@@ -0,0 +1,2654 @@
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Antos 95 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; 
+@InProceedings{Antos95,
+  author	= "K. Anto\v{s} and B. Je\v{z}ek and A. Homola and P. Felkel
+		  and R. Prymula",
+  title		= "Human Anatomy and Virtual Reality",
+  booktitle	= "MASERV'95 -- Proceedings of the Second International
+                   Conference on the Military Applications of Synthetic
+                   Enviroments and Virtual Reality, 06.12.95 -- 10.12.95",
+  year		= "1996",
+  key		= "virtmed, virtual reality, medicine",
+  place		= "Stockholm",
+  publisher     = "FWM, Stockholm",
+  month		= dec,
+  pages		= "198--202"
+}
+
+@Article{Antos96:actaV96,
+  author = 	 {K. Anto¹ and B. JeŸek and A. Homola and
+                  L. Kubínová and P. Felkel},
+  title = 	 {{Methods for Reconstruction of Three-Dimensional
+                  Structures}},
+  journal = 	 {Acta Veterinaria },
+  year = 	 1996,
+  number =	 65,
+  pages =	 {237--245},
+  where =	 {Brno : Vysoká ¹kola veterinární. (4x roènì)}
+}
+
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Benes 90 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; 
+@Article{Benes:bajt90,
+  author	= "B. Bene\v{s}",
+  title		= "Jak se vlastn\v{e} pozn\'a kvalita po\v{c}\'{\i}ta\v{c}e
+		  ?",
+  journal	= "Bajt",
+  year		= 1990,
+  number	= 5,
+  pages		= "??",
+  note		= "In Czech."
+}
+
+;;;;;;;;;;;;;; Benes 91 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; 
+@Article{Benes:bajt91a,
+  author	= "Bene\v{s}, B. ",
+  title		= "Frakt\'aly 1",
+  key		= "Fractals",
+  journal	= "Bajt",
+  year		= "1991",
+  number	= "3",
+  note		= "In Czech."
+}
+
+@Article{Benes:bajt:91b,
+  author	= "Bene\v{s}, B. ",
+  title		= "Frakt\'aly 2",
+  key		= "Fractals",
+  journal	= "Bajt",
+  year		= "1991",
+  number	= "4",
+  note		= "In Czech."
+}
+
+;;;;;;;;;;;;;; Benes 92 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Benes:geom92,
+  author	= "B. Bene\v{s}",
+  title		= "Frakt\'aln\'{\i} geometrie a po\v{c}\'{\i}ta\v{c}ov\'a
+		  grafika",
+  booktitle	= "Sborn\'{\i}k setk\'an\'{\i} spole\v{c}nosti pro
+		  po\v{c}\'{\i}ta\v{c}ovou grafiku a geometrii",
+  year		= "1992",
+  editor	= "F. Je\v{z}ek",
+  publisher	= "Technical University Pilsen",
+  month		= oct,
+  pages		= "??"
+}
+
+
+;;;;;;;;;;;;;; Benes 93 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; 
+@Article{Benes:cecho93,
+  author	= "Bene\v{s}, B. ",
+  title		= "Frakt\'aln\'{\i} geometrie a po\v{c}\'{\i}ta\v{c}ov\'a
+		  grafika",
+  key		= "Fractals",
+  journal	= "Computer Echo",
+  year		= "1993",
+  volume	= "II",
+  number	= "3",
+  pages		= "38-41",
+  note		= "In Czech"
+}
+
+
+;;;;;;;;;;;;;; Benes 94 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; 
+@InProceedings{Benes:dg94,
+  author	= "Bene\v{s}, B.",
+  title		= "Modelling of Plants using {NURBS}",
+  key		= "benes",
+  pages		= "97--102",
+  booktitle	= "Sborn\'{\i}k 14.setk\'{a}n\'{\i} spole\v{c}osti pro
+		  deskript\'{\i}vn\'{\i} geometrii, po\v{c}\'{\i}ta\v{c}ovou
+		  grafiku a technick\'{e} kreslen\'{\i}",
+  year		= "1994",
+  note		= "In Czech"
+}
+
+@InProceedings{Benes:geom94,
+  author	= "Bene\v{s}, B.",
+  title		= "Modelov\'{a}n\'{\i} rostlin pomoc\'{\i} {NURBS}",
+  booktitle	= "Sborn\'{\i}k 14.setk\'{a}n\'{\i} spole\v{c}osti pro
+		  deskript\'{\i}vn\'{\i} geometrii, po\v{c}\'{\i}ta\v{c}ovou
+		  grafiku a technick\'{e} kreslen\'{\i}",
+  key		= "Benes",
+  pages		= "97-102",
+  publisher	= "Technical University Pilsen",
+  year		= 1994,
+  note		= "In Czech"
+}
+
+@InProceedings{Benes:ws94,
+  author	= "B. Bene\v{s} and T. Pavlis and J. \v{Z}\'{a}ra",
+  title		= "Generating Trees and Plants for Computer Graphics",
+  crossref	= "ws94",
+  key		= "benes",
+  pages		= "29--30"
+}
+
+@InProceedings{Benes:wscg94,
+  author	= "Bene\v{s}, B.",
+  title		= "Generating Plants for Computer Graphics",
+  crossref	= "wscg94",
+  key		= "benes",
+  pages		= "221--223"
+}
+
+
+;;;;;;;;;;;;;; Benes 95 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; 
+@Article{Benes:cecho95,
+  author	= "Bene\v{s}, B. and \v{Z}\'ara, J.",
+  title		= "Laborato\v{r} po\v{c}\'{\i}ta\v{c}ov\'e grafiky na {FEL}
+		  {\v{C}VUT}",
+  journal	= "Computer ECHO",
+  year		= "1995",
+  volume	= "IV",
+  number	= "1",
+  pages		= "8-12",
+  month		= feb,
+  note		= "In Czech"
+}
+
+
+@Article{Benes:sgiw95,
+  author	= "Bene\v{s}, B. and Pavlis, T. and \v{Z}\'ara, J.",
+  title		= {Interactive Data Visualization},
+  journal	= "Silicon World",
+  year		= "1995",
+  volume	= "3",
+  number	= "10",
+  pages		= "38--41",
+  note		= "In Czech"
+}
+
+@InProceedings{Benes:ws95,
+  author	= "Bene\v{s}, B.",
+  title		= "Generating plants using {NURBS}",
+  crossref	= "ws95",
+  key		= "benes",
+  pages		= "253--254"
+}
+
+@InProceedings{Benes:wscg95,
+  author	= "Bene\v{s}, B.",
+  title		= "Generating a model of plant using {NURBS}",
+  crossref	= "wscg95",
+  key		= "Benes",
+  volume	= "I",
+  pages		= "1--4"
+}
+
+
+;;;;;;;;;;;;;; Benes 96 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; 
+@InProceedings{Benes:EGCAS96,
+  author        = "Bene\v{s}, B.",
+  title         = "An {E}fficient {E}stimation of {L}ight in
+		   {S}imulation of {P}lant {D}evelopment",
+  editor        = "R.Boulic and G.H\'egron",
+  series        = "Springer Computer Science",
+  pages         =  "153-165",
+  booktitle     = "Computer {A}nimation and {S}imulation'96",
+  year          =  1996,
+  publisher     = "Springer--Verlag Wien New York",
+  abstract      = "During a simulation of plant development
+                   evaluation of the amount of light plays a
+                   significant role. Most of the previous works take
+                   into account only constant amount and constant
+                   direction of the light in the scene without respect
+                   to local shadows in the tree. In the other works
+                   this evaluation strongly depends on the number of
+                   objects in the scene.
+
+                   This paper introduces a new method for evaluation
+                   of amount of light for the artificial plants. This
+                   technique is based on Z-buffer algorithm and has
+                   the ability to evaluate the direction and the
+                   amount of light for every leaf in the plant with a
+                   significantly decreased time of
+                   calculation. Several new aspects of lifetime of the
+                   plant elements and of the whole plant are
+                   discussed."
+}
+
+@Article{Benes:cadgr96a,
+ author         = "Bene\v{s}, B. and \v{Z}\'ara, J.",
+ title          = {Za tajemnstv\'{\i}m {O}pen{GL}},
+ journal        = "{CAD} \& {G}raphics",
+ year           = 1996,
+ volume         = "I",
+ number         = 3,
+ pages          = "58-61",
+ note           = "In Czech"
+}
+
+@Article{Benes:cadgr96b,
+ author         = "Bene\v{s}, B.",
+ title          = {{P}ohled do budoucnosti: {E}urographics'96},
+ journal        = "{CAD} \& {G}raphics",
+ year           = "1996",
+ volume         = "I",
+ number         = "5",
+ pages          = "24--30",
+ note           = "In Czech"
+}
+
+@Article{Benes:sgiw96,
+  author	= "Bene\v{s}, B. and \v{Z}\'ara, J.",
+  title		= {{OpenGL} -- {N}ov\'e paradigma v po\v{c}\'{\i}ta\v{c}ov\'e
+		  grafice?},
+  journal	= "Silicon World",
+  year		= "1996",
+  volume	= "I",
+  number	= "12",
+  pages		= "37--40",
+  note		= "In Czech"
+}
+
+@InProceedings{Benes:ws96,
+  author	= "Bene\v{s}, B. and \v{S}och, M.",
+  title		= "Simulation of plant development using extended
+		  strand model",
+  crossref	= "ws96",
+  key		= "benes",
+  year		= "1996",
+  pages		= "289-290"
+}
+
+@InProceedings{Benes:wscg96,
+  author	= "Bene\v{s}, B. and Hole\v{c}ek, A. and \v{Z}\'ara, J.",
+  title		= "Language {S}upport for {D}istributed {V}irtual {R}eality",
+  key		= "virtual reality, benes, holecek, zara",
+  crossref	= "wscg96",
+  volume	= "II",
+  pages		= "233-243"
+}
+
+;;;;;;;;;;;;;; Benes 97 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; 
+@Book{Benes:skr97,
+  author	= {Bene¹, Bedøich and Felkel, Petr and Sochor, Jiøí and
+		  ®ára, Jiøí},
+  title		= {{Vizualizace}},
+  edition	= {1},
+  address	= {Praha},
+  publisher	= {ÈVUT},
+  year		= {1997},
+  pages		= {197},
+  figures	= {163},
+  isbn		= {80-01-01582-3},
+  note		= {(in Czech)}
+}
+
+@Article{Benes97a,
+  author	= {Bene¹, Bedøich},
+  title		= {{Eurographics'96}},
+  journal	= {Silicon World},
+  number	= {16},
+  volume        = {IV},
+  year		= {1997},
+  pages		= {64--65},
+  note		= {(in Czech)}
+}
+
+@Article{Benes97b,
+  author	= {Bene¹, Bedøich},
+  title		= {{Eurographics '97}},
+  journal	= {Pixel},
+  volume        = {II},
+  number	= {11},
+  year		= {1997},
+  pages		= {14--15},
+  issn		= {1211-5401},
+  note		= {(in Czech)}
+}
+
+@Article{Benes97c,
+  author	= {Bene¹, Bedøich},
+  title		= {{Eurographics'97: Grafika, 3D a Internet}},
+  journal	= {Computer Design},
+  volume        = {I},
+  number	= {5},
+  year		= {1997},
+  pages		= {6--13},
+  issn		= {1211-1082},
+  note		= {(in Czech)}
+}
+
+@Article{Benes97d,
+  author	= {Bene¹, Bedøich and Vorlíèek, Jan},
+  title		= {{Esa tøetího rozmìru}},
+  journal	= {Computer},
+  volume        = {IV},
+  number	= {4},
+  year		= {1997},
+  pages		= {4--8},
+  issn		= {1210-8790},
+  note		= {(in Czech)}
+}
+
+@Unpublished{Benes97e,
+  author	= {Bene¹, Bedøich},
+  title		= {{Fraktály}},
+  note		= {Invited Lecture},
+  address	= {VUT Brno},
+  organisation	= {VUT Brno, doc.J.Sochor,CSc.},
+  date		= {10.12.97},
+  year		= {1997}
+}
+
+@InProceedings{Benes97f,
+  author	= {Bene¹, Bedøich},
+  title		= {{The Growth Direction in Virtual Plants Simulation}},
+  booktitle	= {{Workshop 97}},
+  volume	= {I},
+  address	= {Prague},
+  publisher	= {CTU},
+  year		= {1997},
+  pages		= {293--294}
+}
+
+@InProceedings{Benes97g,
+  author	= {Bene¹, Bedøich and Marák, Ivo and ©imek, Pavel and
+		  Slavík, Pavel},
+  title		= {{Hierarchical Erosion of Synthetical Terrains}},
+  booktitle	= {{Spring Conference on Computer Graphics}},
+  address	= {Bratislava},
+  publisher	= {Comenius University},
+  year		= {1997},
+  pages		= {93--100},
+  isbn		= {80-223-1176-6}
+}
+
+@InProceedings{Benes97h,
+  author	= {Bene¹, Bedøich},
+  title		= {{Visual Simulation of Plant Development with Respect to
+		  Influence of Light}},
+  booktitle	= {{Computer Animation and Simulation '97}},
+  address	= {Wien},
+  publisher	= {Springer},
+  year		= {1997},
+  pages		= {125--136},
+  isbn		= {3-211-83048-0}
+}
+
+@InProceedings{Benes97i,
+  author	= {Bene¹, Bedøich},
+  title		= {{Fast Estimation of Light in Simulation of Plant
+		  Development}},
+  booktitle	= {{WSCG '97}},
+  volume	= {1},
+  address	= {Pilsen},
+  publisher	= {University of West Bohemia},
+  year		= {1997},
+  pages		= {1--10},
+  isbn		= {80-7082-306-2}
+}
+
+
+@InProceedings{Benes:wscg97,
+  author = 	 {B. Bene\v{s}},
+  title = 	 {Fast Estimation of Growth Direction in Virtual Plants
+		  Simulation},
+  crossref =	 {wscg97},
+  volume =	 {I},
+  pages =	 {1--10},
+  note =	 {benes}
+}
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Berka 94 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Berka:sscg94,
+  author	= "R. Berka and I. Jel\'{\i}nek",
+  title		= "Formal Methods in Human Body Model Animation",
+  crossref	= "sscg94",
+  key		= "berka, jelinek",
+  pages		= "220--225"
+}
+
+@InProceedings{Berka:ws94,
+  author	= "R. Berka and I. Jel\'{\i}nek",
+  title		= "{VITALIATOR} - the human body animation system",
+  crossref	= "ws94",
+  key		= "berka, jelinek",
+  pages		= "45--46"
+}
+
+
+;;;;;;;;;;;;;; Berka 95 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Berka:ws95,
+  author	= "R. Berka and I. Jel\'{\i}nek",
+  title		= "Using formal methods in the control of independent
+		  animated objects",
+  crossref	= "ws95",
+  key		= "berka, jelinek",
+  pages		= "251--252"
+}
+
+@InProceedings{Berka:wscg95,
+  author	= "R. Berka and I. Jel\'{\i}nek",
+  title		= "One Method of the Human Body Model Animation",
+  crossref	= "wscg95",
+  key		= "berka, jelinek",
+  volume	= "I",
+  pages		= "5--15"
+}
+
+;;;;;;;;;;;;;; Berka 96 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Berka:rostock96,
+  author =       {R. Berka and M. Brachtl and A. Hole\v{c}ek and
+                  M. Novotn\'{y} and J. P\v{r}ikryl and P. Slav\'{i}k
+                  and J. \v{Z}\'{a}ra},
+  title =        {Three-Dimensional Information System on the World
+                  Wide Web},
+  booktitle =    {Multimedia '96},
+  editor =       {B. Urban},
+  year =         1996,
+  organization = {Eurographics},
+  publisher =    {Springer-Verlag},
+  address =      {Wien, New York},
+  postscript =   {/Publications/Berka_rostock96.ps.gz},
+  pages =        {70--78}
+}
+
+;;;;;;;;;;;;;; Berka 97 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; 
+@InProceedings{Berka97a,
+  author	= {Berka, Roman},
+  title		= {{Reduction of Computations in Physics-Based Animation
+		  Using Level of Detail}},
+  booktitle	= {{Spring Conference on Computer Graphics}},
+  address	= {Bratislava},
+  publisher	= {Comenius University},
+  year		= {1997},
+  pages		= {69--76},
+  isbn		= {80-223-1176-6}
+}
+
+@InProceedings{Berka97b,
+  author	= {Berka, Roman and Novotný, Martin and Píè, V. and
+		  Slavík, Pavel},
+  title		= {{EYE - the Navigation and Training System for Blind}},
+  booktitle	= {{Workshop 97}},
+  volume	= {I},
+  address	= {Prague},
+  publisher	= {CTU},
+  year		= {1997},
+  pages		= {291--292}
+}
+
+;;;;;;;;;;;;;; Berka 98 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; 
+
+
+@InProceedings{Berka:poster98,
+  author = 	 {M. Koutek and R. Berka },
+  title = 	 {Optimizing Motion of Two-Legged Creature},
+  crossref =	 {poster98},
+  pages =	 {IC-26}
+}
+
+@InProceedings{Berka:ecdvrat98,
+  author =       {R. Berka and P. Slav\'{\i}k},
+  title =        {Virtual {R}eality for {B}lind {U}sers},
+  booktitle =    {The 2nd Conference on Disability, Virtual Reality
+                  and Associated Technologies},
+  editor =	 {P. Sharkey and D. Rose and Jan-Ingvar Lindstr\"{o}m},
+  year =         1998,
+  publisher =	 {University of Reading, UK},
+  address =	 {Sk\"{o}vde, Sweden},
+  month =	 {September},
+  pages =	 {89--98}
+}
+
+
+
+;;;;;;;;;;;;;; Bila 97 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Bila97,
+  author	= {Bíla, J. and Jelínek, Ivan},
+  title		= {{Gate off Complexity - Artificial Intelligence or
+		  Artificial Life}},
+  booktitle	= {{Workshop 97}},
+  volume	= {I},
+  address	= {Prague},
+  publisher	= {CTU},
+  year		= {1997},
+  pages		= {245--246}
+}
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Bittner 96 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@TechReport{Bittner:delft96,
+  author = 	 {Bittner, J.},
+  title = 	 {RECNET - The speech recognition system},
+  institution =  {Technical University, Delft},
+  year = 	 1996,
+  month = 	 jun,
+}
+
+@TechReport{Bittner:dresden95,
+  author = 	 {Bittner, J. and Cup\'ak, M.},
+  title = 	 {Dragon Voice Tools},
+  institution =  {HTW Dresden},
+  year = 	 1995,
+  month = 	 sep,
+}
+
+@TechReport{Bittner:ecp96,
+  author = 	 {Bittner, J.},
+  title = 	 {Enumeration of Convex Polyhedra in Arbitrary Dimension},
+  institution =  {Department of Computers, Czech Technical University },
+  year = 	 1996,
+}
+
+
+;;;;;;;;;;;;;; Bittner 97 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Bittner97,
+  author	= {Bittner, Jiøí},
+  title		= {{Global Visibility}},
+  booktitle	= {{CESCG '97}},
+  address	= {Wien},
+  publisher	= {Technische Universität},
+  year		= {1997},
+  pages		= {105--111}
+}
+
+@InProceedings{Bittner:gaw97,
+  author = 	 {Bittner, J.},
+  title = 	 {Object Space Visibility Computations},
+  booktitle =    {Graphics and WEB '97},
+  year =         1997,
+  organization = {HTW Dresden, Germany},
+  key =          {global visibility, VRML, conservative visibility, spatial
+                  subdivision, visibility computations},
+}
+
+@MastersThesis{Bittner:masters97,
+  author = 	 {Bittner, J.},
+  title = 	 {Global Visibility Computations},
+  school = 	 {Department of Computers, Czech Technical University},
+  year = 	 1997,
+  month = 	 jan,
+}
+;;;;;;;;;;;;;; Bittner 98 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Bittner:poster98,
+  author = {Ji\v{r}\'{\i} Bittner},
+  title = {Conservative Hierarchical Visibility with Occlusion Trees},
+  crossref = {poster98},
+  pages = {IC-3}
+}
+
+@inproceedings{bittner98b,
+  author = "Bittner, J. and Havran, V. and Slavik, P.",
+  title = "Hierarchical Visibility Culling with Occlusion Trees",
+  booktitle = "Proceedings of Computer Graphics International '98 (CGI'98)",
+  year = "1998",
+  month = jun,
+  pages = "207--219",
+  address = "Hannover, Germany",
+  publisher = "IEEE, New York",
+}
+
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Brachtl 95 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Brachtl:poster95,
+  author	= "M. Brachtl and R. Berka",
+  title		= "{Comparing Test of a Few Graphical Workstations}",
+  crossref	= "Poster95",
+  key		= "benchmark, brachtl",
+  pages		= "125"
+}
+
+;;;;;;;;;;;;;; Brachtl 96 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Brachtl:ws96,
+  author	= "M. Brachtl",
+  title		= "Distributed Information System on {World Wide Web}",
+  crossref	= "ws96",
+  key		= "www, brachtl",
+  pages		= "251--252"
+}
+
+;;;;;;;;;;;;;; Brachtl 97 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Brachtl97,
+  author	= {Brachtl, Martin},
+  title		= {{Particle-System Based Support for Behavioral Animation}},
+  booktitle	= {{Workshop 97}},
+  volume	= {I},
+  address	= {Prague},
+  publisher	= {CTU},
+  year		= {1997},
+  pages		= {327--328}
+}
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Cerveny 97 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Cerveny97,
+  author	= {Èervený, Martin and Dryák, Ale¹},
+  title		= {{Routing in ATM Networks Using PNNI 1.0}},
+  booktitle	= {{Workshop 97}},
+  volume	= {I},
+  address	= {Prague},
+  publisher	= {CTU},
+  year		= {1997},
+  pages		= {313--314}
+}
+
+;;;;;;;;;;;;;; Chlumsky 97 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Chlumsky97,
+  author	= {Chlumský, Petr},
+  title		= {{3D-Dithering}},
+  booktitle	= {{CESCG '97}},
+  address	= {Wien},
+  publisher	= {Technische Universität},
+  year		= {1997},
+  pages		= {113--121}
+}
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Diblik 97 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Diblik97,
+  author	= {Diblík, Pavel and Slavík, Pavel},
+  title		= {{Control of Lossy Compression of Three-Dimensional Data}},
+  booktitle	= {{Workshop 97}},
+  volume	= {I},
+  address	= {Prague},
+  publisher	= {CTU},
+  year		= {1997},
+  pages		= {295--296}
+}
+
+@InProceedings{Diblik97a,
+  author	= {Diblík, Pavel and Slavík, Pavel},
+  title		= {{Control of Lossy Compression of Three-dimensional Data}},
+  booktitle	= {{Spring Conference on Computer Graphics}},
+  address	= {Bratislava},
+  publisher	= {Comenius University},
+  year		= {1997},
+  pages		= {144--151},
+  isbn		= {80-223-1176-6}
+}
+
+@InProceedings{Diblik97b,
+  author	= {Diblík, Pavel and Slavík, Pavel},
+  title		= {{Controlled Lossy Compression of Multidimensional Data}},
+  booktitle	= {{Proceedings of 8th Eurographics Workshop on Visualization
+		  in Scientific Computing}},
+  volume	= {1},
+  address	= {Boulogne sur Mer},
+  publisher	= {Universite du Littoral},
+  year		= {1997},
+  pages		= {183--192}
+}
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Felkel 93 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{  Felkel:ws93,
+  author = 	 {P. Felkel and J. \v{Z}\'ara},
+  title = 	 {{The  Roof  Construction Problem}},
+  booktitle = 	 {Proceedings  of CTU Workshop '93},
+  editor =	 {A. Strejc},
+  volume =	 {I - Informatics \& Cybernetics},
+  year =	 1993,
+  publisher =	 {CTU-Publishing House, Prague},
+  month =	 jan # { 18--21,},
+  pages =	 {85--86},
+  where =	 {Grlab, PF sfcs-5},
+  procenta =	 {80,20},
+  annote =	 {Popis alg. na konstrukci støech - tj. de Facto konstrukci 
+                  bisector Angular Network, jak to nazyva Oliva}
+}
+
+;;;;;;;;;;;;;; Felkel 94 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@TechReport{Felkel:bericht94,
+  author	= "P. Felkel",
+  title		= {{AutoCAD STEP} Processor Implementation. {D}evelopment of
+		  an {AutoCAD STEP} Postprocessor for a Ship Hull Geometry
+		  Model},
+  institution	= "ZGDV Rostock",
+  year		= 1994,
+  key		= "felkel",
+  pages		= "1--23",
+  number	= "79/94",
+  month		= apr
+}
+
+@Article{Felkel:topics94,
+  author	= "P. Felkel and G. Vatterrott",
+  title		= { {STEP} {P}rozessor f{\"u}r {AutoCAD} (Auf der {G}rundlage
+		  der {K2-T}ools)},
+  key		= "felkel",
+  journal	= "Computer Graphics Topics",
+  year		= "1994",
+  volume	= "6",
+  number	= "2",
+  pages		= "9",
+  note		= "In German."
+}
+
+;;;;;;;;;;;;;; Felkel 95 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Felkel95,
+  author	= "P. Felkel and J. \v{Z}\'ara",
+  title		= "Segmentation and Visualization of data acquitted by {MR}
+		  scanner",
+  year		= "1995",
+  key		= "virtmed, virtual reality, medicine",
+  pages		= "62",
+  month		= may,
+  place		= "Prague",
+  editor	= "J. Hozman",
+  booktitle	= {Proceedings of contributions on workshop "Teaching and
+		  Research within the Biomedical Engineering and
+		  Biotechnology at FEE CTU in Prague"},
+  note		= "In Czech"
+}
+
+@Proceedings{Felkel:sr95,
+  title = 	 {Selected Readings of Computer Graphics Group},
+  year = 	 1995,
+  editor =	 {P. Felkel and J. Mallat},
+  series =	 {DC-96-04 and 05},
+  publisher =	 {Czech Technical University},
+  address =	 {Prague},
+  note =	 {Collaborative Report},
+  procenta =     {70,30}
+}
+
+@InProceedings{Felkel:ws95,
+  author	= "P. Felkel and J. \v{Z}\'{a}ra",
+  title		= "{VIRTMED}--A Project for {3D} Medical Data Processing and
+		  Visualization",
+  crossref	= "ws95",
+  pages         = "165--166",
+  key		= "virtmed, felkel, zara"
+}
+
+
+;;;;;;;;;;;;;; Felkel 96 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Felkel:egvisc96,
+  author = 	 {P. Felkel and P. Mr\'{a}zek and L. S\'{y}kora and
+		  J. \v{Z}\'{a}ra and B. Je\v{z}ek},
+  title = 	 {On Segmentation for Medical Data Visualization},
+  crossref =     {egvisc96},
+  key =		 {segmentation, PDM, point distribution model,
+		  morphology, topology, 2,5D model},
+  pages =	 {189--198},
+  postscript =   {/Publications/felkel_egvisc_96.ps.gz},
+  abstract =     {Segmentation forms the crucial step of Magnetic
+		  Resonance  (MR) data visualization. The aim  of our
+		  article  is to present  two fundamental methods for
+		  segmentation of medical data acquired by MR
+		  scanners. After a short overview of rendering
+		  techniques the appropriate segmentation step for
+		  each of them is discussed. \\
+
+		  Firstly, we describe a segmentation algorithm
+ 		  suitable for surface rendering. We present a model
+ 		  of object shape and appearance, and show how to
+ 		  match the model to the actual image data. Genetic
+ 		  algorithms perform the initial, rough estimation and
+ 		  the position is then refined by a gradient
+ 		  method. We demonstrate the functionality of a
+ 		  simple, one-level model, as well as that of a
+ 		  multiple resolution extended model.\\
+
+		  Secondly, an algorithm suitable for volume rendering
+ 		  is discussed. It is based on combined model which
+ 		  stores not only grey level and gradient information,
+ 		  but takes into account also adjacency of organs and
+ 		  their hierarchical partitioning.
+
+		  We present results of practical tests of both
+ 		  methods described.}  
+}
+
+@Article{Felkel:sn96,
+  author	= "P. Felkel and J. \v{Z}\'{a}ra",
+  title		= "Systems for scientific visualization
+                  (Systémy pro vizualizaci dat)",
+  key		= "scientific visualization, AVS, Explorer, ",
+  journal	= "Software newspaper (Softwarov\'e noviny)",
+  year		= "1996",
+  volume	= "VII",
+  number	= "2",
+  pages		= "26--30",
+  month		= feb,
+  note		= "In. Czech",
+  annote	= "pokec o AVS a Exploreru + zdroje med. dat"
+}
+		  
+@InProceedings{Felkel:ws96,
+  author	= "P. Felkel and J. \v{Z}\'{a}ra and P. Mr\'{a}zek",
+  title		= "Towards Knowledge Based Segmentation of Brain Structures",
+  crossref	= "ws96",
+  key		= "virtmed, knowledge based segmentation, brain, active shape
+		  model, genetic algorithms",
+  pages		= "253--254",
+  month		= jan
+}
+
+
+;;;;;;;;;;;;;; Felkel 97 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@Article{Felkel:actaP97,
+  author	= {Felkel, Petr and Sýkora, Libor and ®ára, Jiøí},
+  title		= {{Three Medical Image Segmentation Algorithms}},
+  journal	= {Acta Polytechnica},
+  publisher     = {Published by Czech Technical
+                   University, Prague},
+  volume	= {37},
+  number	= {2},
+  year		= {1997},
+  html          = {http://www.cvut.cz/ascii/ctu/publishing/acta.html},
+  postscript    = {/Publications/felkel_actaP_96.ps.gz},
+  pages		= {51--63},
+  issn		= {1210-2709},
+  note          = {Published by Czech Technical
+                   University, Prague}
+}
+
+@InProceedings{Felkel:itab97,
+  author	= {Felkel, Petr and Janáèek, Jiøí},
+  title		= {{Custom-Made Modules of the Explorer Programme Package for
+		  Image/Volume Processing}},
+  booktitle	= {{Information Technology Applications in Biomedicine
+                   -- ITAB'97}},
+  address	= {Piscataway, NJ},
+  publisher	= {IEEE},
+  editor =       {V. Eck},
+  year		= {1997},
+  month =        sep # "7--9",
+  pages		= {90--91},
+  isbn		= {0-7803-4318-2}
+}
+
+@Article{Antos:lat97,
+  author	= "K. Anto¹ and B. JeŸek and A. Homola and P. Felkel
+		  and L. Kubínová",
+  title = 	 {Analyze -- programový nástroj pro vizualizaci
+                   medicínských dat},
+  journal = 	 {Lékaø a technika},
+  year = 	 1997,
+  volume =	 28,
+  number =	 6,
+  month =	 nov,
+  ISSN =         {0301-5491},
+  anote =        {Vydává Èeská lékaøská spoleènost J. E. Purkynì 6x za rok},
+  pages =	 {127--132},
+  where =	 {grlab},
+  note =         {In Czech.}
+}
+
+@InProceedings{Felkel:sccg97,
+  author	= {Felkel, Petr and Janáèek, Jiøí},
+  title		= {{Biomedical imaging application of Explorer}},
+  booktitle	= {{SCCG 1997-Company Presentions Posters}},
+  volume	= {2},
+  address	= {Bratislava},
+  publisher	= {Comenius University},
+  year		= {1997},
+  pages		= {19--20}
+}
+
+;;;;;;;;;;;;;; Felkel 98 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Felkel:ws98,
+  author = 	 {P. Felkel},
+  title = 	 {{3D Reconstruction from Cross Sections by means 
+                  of Contour Tiling}},
+  crossref =	 {ws98},
+  pages =	 {241--242}
+}
+
+
+
+
+@InProceedings{Felkel:poster98,
+  author = 	 {P. Felkel},
+  title = 	 {Straight Skeleton Implementation},
+  crossref =	 {poster98},
+  pages =	 {IC-12}
+}
+
+@InProceedings{Felkel:sccg98,
+  author = 	 {P. Felkel and ©. ObdrŸálek},
+  title = 	 {Straight Skeleton Computation},
+  crossref =     {sccg98},
+  pages =	 {210--218},
+  postscript =	 {/Publications/felkel_sccg_98.ps.gz}
+}
+
+
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Havran 95 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@Booklet{Havran95,
+  title		= {Effective Homogeneous Transformation of Large Raster
+		  Images},
+  author	= {V. Havran and J. \v{Z}\'{a}ra},
+  howpublished	= {Poster on SOFSEM'95: 22nd Seminar on Current Trends
+		  inTheory and Practice of Informatics},
+  address	= {Milovy, Czech Republic},
+  year		= 1995,
+  month 	= nov
+}
+
+@InProceedings{Havran:ws95,
+  author	= "V. Havran and J. \v{Z}\'{a}ra",
+  title		= "Simulation of Real Camera for Rendering",
+  crossref	= "ws95",
+  key		= "havran, zara",
+  pages		= "183--184"
+}
+
+
+;;;;;;;;;;;;;; Havran 96 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Havran96:d,
+  author = {Havran, V.},
+  title = {Parallel Implementation of Ray Tracing on Shared Memory
+           Architecture},
+  booktitle = {Poster Section at SOFSEM'96},
+  month = {November 23-30},
+  year = {1996},
+  address = {Milovy, Czech Republic},
+}
+
+@InProceedings{Havran96:c,
+  author = {Havran, V. and \v{Z}\'{a}ra, J.},
+  title = {Some Practical Aspects of Ray Tracing on Shared Memory Machine},
+  booktitle = {Poster Section in Eurographics Workshop on Parallel Rendering},
+  month = {August 26-27},
+  year = {1996},
+  address = {Bristol, UK},
+}
+
+@InProceedings{Havran96:poster96,
+  author = {Havran, V.},
+  title = {Load Balancing Techniques for Ray-tracer on Shared Memory
+           Machine},
+  crossref = "poster96",
+  pages = {74-74}, 
+}
+
+@MastersThesis{Havran96:a,
+  author = {Havran, V.},
+  title = {The simulation of Optical Effects},
+  address = {Prague, Czech Republic},
+  month = {February},
+  school = {CTU-FEE Prague, Department of Computer Science and Engineering},
+  year = 1996,
+}
+
+
+;;;;;;;;;;;;;; Havran 97 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Havran97:f,
+  author = {Havran, V.},
+  title = {Cache Sensitive Representation for the BSP Tree},
+  booktitle = {Proceedings of Compugraphics'97},
+  note  = {Accepted to Compugraphics'97, International Conference
+           on Computer Graphics, 8 pages, Portugal,
+           held 15-18th of December},
+  year  = {1997},
+  month = {December},
+}
+
+@TechReport{Havran97:rep,
+  author = {V. Havran},
+  title = {Spatial Data Structures for Visibility Computation},
+  institution = {CTU-FEE Prague},
+  number = {DC-PSR-97-05},
+  month = {May},
+  year = {1997},
+  note = {Postgraduate Study Report, 34 pages, available at 
+          ftp://sgi.felk.cvut.cz/outgoing/havran/minimum/dc-psr-97-05.ps.gz},
+}
+
+@InProceedings{Havran97:poster97,
+  author = {V. Havran},
+  title  = {Evaluation of BSP trees for ray-tracing},
+  crossref = "poster97",
+  pages = {2 pages},
+  year  = {1997},
+}
+
+@InProceedings{Havran97:sccg97,
+  author	= {Havran, Vlastimil and ®ára, Jiøí},
+  title		= {{Evaluation of BSP Properties for Ray-tracing}},
+  booktitle	= {{Spring Conference on Computer Graphics}},
+  address	= {Bratislava},
+  publisher	= {Comenius University},
+  year		= {1997},
+  pages		= {155--162},
+  isbn		= {80-223-1176-6}
+}
+
+@InProceedings{Havran97:ws97a,
+  author	= {Havran, Vlastimil},
+  title		= {{Parallel Ray-Tracer on Shared Memory Multiprocessor
+		  Machines Connected via Internet}},
+  booktitle	= {{Workshop 97}},
+  volume	= {I},
+  address	= {Prague},
+  publisher	= {CTU},
+  year		= {1997},
+  pages		= {321--322}
+}
+
+@InProceedings{Havran97:ws97b,
+  author	= {Havran, Vlastimil and ©imek, Pavel and ©och, Michal and
+		  Tvrdík, Pavel},
+  title		= {{Parallel Merge Sort on Shared Memory Multicomputer}},
+  booktitle	= {{Workshop 97}},
+  volume	= {I},
+  address	= {Prague},
+  publisher	= {CTU},
+  year		= {1997},
+  pages		= {287--288}
+}
+
+;;;;;;;;;;;;;; Havran 98 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Havran:poster98,
+   author = "Vlastimil Havran",
+   title = "Constructing Surface Area Binary Space Partitioning with
+            Rope Trees for Ray Tracing",
+   crossref = {poster98},
+   pages = {IC15} 
+}
+
+@misc{Havran98:a,
+   author = { Havran, V.},
+   title = {Statistically Optimized Traversal Algorithm for BSP trees},
+   booktitle = {Proceedings of Workshop'98},
+   organization = { CTU--FEE },
+   address = { Prague, Czech Republic },
+   editor= { A.Strejc },
+   month = { February 3--5 },
+   pages = { 365--166},
+   year  = { 1998 },
+}
+
+@InProceedings{Havran98:b,
+  author = { Havran, V. and Bittner, J. and \v{Z}\'{a}ra, J.},
+  title  = { Ray Tracing with Rope Trees},
+  booktitle = { Proceedings of 13th Spring Conference on Computer Graphics}, 
+  address = { Budme\v{r}ice},
+  date  = {April 23--26},
+  year  = 1998,
+  pages = "130--139",
+}
+
+@misc{Havran98:d,
+   author = {Havran, V. and Kopal, T. and Bittner, J. and \v{Z}\'{a}ra, J.},
+   title = {FAST ROBUST BSP TREE TRAVERSAL ALGORITHM FOR RAY TRACING},
+   note = { 8 pages, Submitted to Journal of Graphics Tools},
+   year = { 1998 },
+}
+
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Hejda 98 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{hejda:poster98,
+   author = {Hejda, P.},
+   title = {Visual \& Interactive Simulation Package},
+   crossref = {poster98},
+   pages = {IC16}
+}
+
+
+;;;;;;;;;;;;;; Hejda 94 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@MastersThesis{Hejda:94,
+  author =       {Petr Hejda},
+  title =        {{Stochastic Textures (in Czech)}},
+  school =       {Department of Computer Science and Engineering, FEE,
+                  CTU Prague, Czech Republic},
+  year =         1994
+}
+
+;;;;;;;;;;;;;; Hejda 95 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Hejda:poster95,
+  author	= "Hejda, P.",
+  title		= "Channel as Representation of Data Flow",
+  key		= "hejda",
+  pages		= "173",
+  crossref	= "poster95"
+}
+
+;;;;;;;;;;;;;; Hejda 96 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Hejda:poster96,
+  author        = "Petr Hejda",
+  title         = "How to Build and/or Optimize an Efficient User
+                   Interface",
+  key           = "hejda",
+  pages         = "75",
+  crossref =  "poster96",
+}
+
+@InProceedings{Hejda:ws96,
+  author	= "Hejda, P.",
+  title		= "Labyrinth Project",
+  key		= "hejda",
+  pages		= "287",
+  volume        = "II",
+  crossref	= "ws96"
+}
+
+@InProceedings{Hejda:wscg96,
+  author	= "Hejda, P. and \v{Z}\'ara, J.",
+  title		= "Channel - a Generalized Pipe",
+  key		= "hejda, zara",
+  pages		= "244-245",
+  volume	= "II",
+  crossref	= "wscg96"
+}
+
+;;;;;;;;;;;;;; Hejda 97 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@TechReport{Hejda:97,
+  author =       {Petr Hejda and Suleyman Sevinc},
+  title =        {{VISP - Visual and Interactive Simulation Package}},
+  institution =  {Basser Department of Computer Science,
+                  The University of Sydney, N.S.W. Australia},
+  year =         1997,
+  key =          {hejda,sevinc},
+  ISBN =         {??},
+  annote =       {Fill in the ISBN}
+}
+
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Holecek 95 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Holecek:poster95,
+  author	= "Hole\v{c}ek, A. and P\v{r}ikryl, J. ",
+  title		= {On Efficency of Parallel Raytracing},
+  crossref = "poster95",
+}
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Hollay 94 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Hollay:ws94,
+  author	= "P. Hollay and S. Hostomsk\'{y} and I. Jel\'{\i}nek and M.
+		  \v{S}norek ",
+  title		= "Multimedia generation and presentation system",
+  crossref	= "ws94",
+  key		= "hollay, jelinek, snorek",
+  pages		= "43--44"
+}
+
+;;;;;;;;;;;;;; Hollay 97 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Hollay97:ws97,
+  author	= {Hollay, P. and Jelínek, Ivan},
+  title		= {{Experimental Multimedia and Hypermedia System EMHS 2.0}},
+  booktitle	= {{Workshop 97}},
+  volume	= {I},
+  address	= {Prague},
+  publisher	= {CTU},
+  year		= {1997},
+  pages		= {297--298}
+}
+
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Hudec 93 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@Book{Hudec:skr93a,
+  author	= {B. Hudec},
+  title		= {Programming techniques},
+  publisher	= "Czech Technical University Publishing House, Prague",
+  year		= 1993,
+  key		= {hudec},
+  note		= "In Czech."
+}
+
+@Book{Hudec:skr93b,
+  author	= {B. Hudec},
+  title		= {Foundations of Computer Graphics},
+  publisher	= "Czech Technical University Publishing House",
+  year		= 1993,
+  pages		= "222",
+  note		= "In Czech."
+}
+
+;;;;;;;;;;;;;; Hudec 94 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@Book{Hudec:skr94,
+  author	= {B. Hudec},
+  title		= {Graphics Systems {PHIGS} and GKS},
+  publisher	= "Czech Technical University Publishing House",
+  year		= 1994,
+  pages		= "166",
+  note		= "In Czech."
+}
+
+@InProceedings{Hudec:wscg94,
+  author	= "B. Hudec",
+  title		= "Graphics Systems {PHIGS} and {PHIGS+}",
+  crossref	= "wscg94",
+  key		= "hudec",
+  pages		= "125--142"
+}
+
+
+;;;;;;;;;;;;;; Hudec 97 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@Book{Hudec:skr97,
+  author	= {B. Hudec},
+  title		= {{Základy poèítaèové grafiky}},
+  edition	= {1},
+  address	= {Praha},
+  publisher	= {ÈVUT},
+  year		= {1997},
+  pages		= {222},
+  figures	= {153},
+  isbn		= {80-01-00932-7},
+  note		= {(in Czech)}
+}
+		  
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Jelinek 93 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@Book{Jelinek:skr93,
+  author =       {Ivan Jel\'{\i}nek},
+  title =        {Automatizace in\v{z}e\'yrsk\'ych prac\'{\i}},
+  publisher =    {Vydavatelstv\'{\i} ÈVUT, Praha},
+  year =         1993
+}
+
+
+;;;;;;;;;;;;;; Jelinek 94 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Jelinek:fei94,
+  author	= "Jel\'{\i}nek, I.",
+  title		= "Formalization of design process in {CAD}",
+  key		= "jelinek",
+  pages		= "220--225",
+  booktitle	= "Proceedings of {FEI'25} Conference on Electronic computers
+		  and Informatics",
+  year		= "1994",
+  address	= "Ko\v{s}ice, Slovakia",
+  month		= sep
+}
+
+@InProceedings{Jelinek:mosis94,
+  author	= "Jel\'{\i}nek, I.",
+  title		= "Logical formalization of design process in {CAD} system",
+  key		= "jelinek",
+  pages		= "166--170",
+  note		= "In Czech",
+  booktitle	= "Modelling and simulation of systems - {MOSIS'94}",
+  year		= "1994",
+  address	= "Zabreh na Morave",
+  month		= may
+}
+
+@Book{Jelinek:skr94,
+  author	= "Jel\'{\i}nek, I.",
+  title		= "{CAD} systems construction",
+  key		= "jelinek",
+  publisher	= "CTU Publishing House",
+  year		= 1994,
+  address	= "Prague",
+  note		= "In Czech"
+}
+
+@Article{Jelinek:sn11a94,
+  author	= "Jel\'{\i}nek, I.",
+  title		= "We begin with Multimedia",
+  key		= "jelinek",
+  journal	= "Softwarov\'{e} noviny",
+  year		= 1994,
+  volume	= "V",
+  number	= 11,
+  pages		= "21--26",
+  note		= "In Czech"
+}
+
+
+@Article{Jelinek:sn11b94,
+  author	= "Jel\'{\i}nek, I.",
+  title		= "Authors Systems",
+  key		= "jelinek*",
+  journal	= "Softwarov\'{e} noviny",
+  year		= 1994,
+  volume	= "V",
+  number	= 11,
+  pages		= 40,
+  note		= "In Czech"
+}
+
+@InProceedings{Jelinek:ws94a,
+  author	= "I. Jel\'{\i}nek and J. Piln\'{y} and V. \v{S}afanda and P.
+		  Slav\'{\i}k",
+  title		= "{ESA-W--{E}ducational system for {AutoCAD} on sun
+		  workstation }",
+  crossref	= "ws94",
+  key		= "jelinek, slavik",
+  pages		= "41--42"
+}
+
+@InProceedings{Jelinek:ws94b,
+  author	= "Jel\'{\i}nek, I.",
+  title		= "Logical formalization of design process in {CAD} system",
+  crossref	= "ws94",
+  key		= "jelinek",
+  pages		= "47--48"
+}
+
+@InProceedings{Jelinek:ws94c,
+  author	= "Jel\'{\i}nek, I. and Slav\'{\i}k, P. and \v{S}norek, M.",
+  title		= "Multimedia in university education",
+  crossref	= "ws94",
+  key		= "jelinek, slavik, snorek",
+  pages		= "49--50"
+}
+
+;;;;;;;;;;;;;; Jelinek 95 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@Misc{Jelinek:cgforum95,
+  author	= {Jel\'{\i}nek, I.},
+  title		= {We begin with multimedia - Tutorial},
+  howpublished	= {Computer Graphics \& Computer Forum Exhibition Tutorial},
+  year		= 1995,
+  note		= {In Czech.}
+}
+
+@Article{Jelinek:chip95,
+  author	= {I. Jel\'{\i}nek and M. Louck\'{y}},
+  title		= {Highway to information (D\'{a}lnice k informac\'{\i}m)},
+  journal	= {CHIP},
+  year		= 1995,
+  month		= jan,
+  number	= 1,
+  pages		= {32--35}
+}
+
+@InProceedings{Jelinek:iced95,
+  author	= {Jel\'{\i}nek, I.},
+  title		= {Formal methods in design process},
+  booktitle	= {Proceedings of the 10th International Conference on
+		  Engineering Design, ICED'95},
+  editor	= { Hubka, V.},
+  volume	= 2,
+  series	= {Edition HEURISTA},
+  year		= 1995,
+  address	= {Prague},
+  pages		= {517--522},
+  url           = "/Publications/jelinek_iced_95.html"		  
+}
+
+@Book{Jelinek:skr95,
+  author	= "Jel\'{\i}nek, I.",
+  title		= "The construction of {CAD} system",
+  key		= "jelinek",
+  publisher	= "CTU Publishing House",
+  year		= 1995,
+  pages		= "125",
+  address	= "Prague",
+  note		= "In Czech"
+}
+
+@InProceedings{Jelinek:ws95a,
+  author	= "Jel\'{\i}nek, I.",
+  title		= "Research on formalization of design process",
+  crossref	= "ws95",
+  key		= "jelinek",
+  pages		= "257--258"
+}
+
+@InProceedings{Jelinek:ws95b,
+  author	= { I. Jel\'{\i}nek, P. Hollay and S. Hostomsk\'{y} and P.
+		  Slav\'{\i}k and M. \v{S}norek},
+  title		= {{EMHS~2} - Experimental Multimedia System },
+  crossref	= {ws95},
+  key		= {jelinek, snorek},
+  pages		= {259--260}
+}
+
+;;;;;;;;;;;;;; Jelinek 96 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@Article{Jelinek:acta96,
+  author	= {I. Jel\'{\i}nek},
+  title		= {Theoretical aspects of the design process},
+  journal	= {Acta Polytechnica, CTU Prague},
+  year		= 1995,
+  volume	= 35,
+  number	= 5,
+  pages		= {55--64}
+}
+
+@InProceedings{Jelinek:ithurs96,
+  author =       {I. Jel\'{\i}nek},
+  title =        {Formalization of Design Process},
+  booktitle =    {International Conference on Intelligent
+                  Technologies in Human-Related Sciences
+                  },
+  editor =       {E. L. Gonzales},
+  volume =       1,
+  year =         1996,
+  organization = {AMSE},
+  publisher =    {Universidad de Le\'{o}n},
+  month =        jul,
+  pages =        {127--135}
+}
+
+@Book{Jelinek:skr96,
+  author	= "Jel\'{\i}nek, I.",
+  title		= "{CAD} systems construction",
+  key		= "jelinek",
+  publisher	= "CTU Publishing House",
+  year		= 1996,
+  address	= "Prague",
+  note		= "Second Edition, In Czech"
+}
+
+@InProceedings{Jelinek:ws96a,
+  author	= "J. B\'{\i}la and I. Jel\'{\i}nek",
+  title		= "Virtual Reality in the Design Process",
+  crossref	= "ws96",
+  key		= "jelinek",
+  pages		= "249--250"
+}
+
+@InProceedings{Jelinek:ws96b,
+  author	= { P. Hollay and S. Hostomsk\'{y} and I. Jel\'{\i}nek and M.
+		  \v{S}norek},
+  title		= {Experimental Multimedia and Hypermedia System {EMHS~1.0}},
+  crossref	= {ws96},
+  key		= {jelinek, snorek},
+  pages		= {243--244}
+}
+
+;;;;;;;;;;;;;; Jelinek 97 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@Book{Jelinek97a,
+  author	= {Jelínek, Ivan},
+  title		= {{Formalization of the Design Process in CAD Systems}},
+  edition	= {1},
+  address	= {Prague},
+  publisher	= {CTU},
+  year		= {1997},
+  pages		= {103},
+  figures	= {8}
+}
+
+@TechReport{Jelinek97b,
+  author	= {Jelínek, Ivan and Rylek, Tomá¹},
+  title		= {{Annual Report 1996}},
+  type		= {Annual Report},
+  number	= {DC-97-01},
+  institution   = {CTU Prague},
+  OPTIaddress	= {Prague},
+  publisher	= {CTU, Faculty of Electrical Engineering, Department of
+		  Computers},
+  year		= {1997},
+  pages		= {85}
+}
+
+@Article{Jelinek:cw97a,
+  author	= {Jelínek, Ivan},
+  title		= {{C4=CAD+CAM+CAE+CIM}},
+  journal	= {Computerworld},
+  volume	= {VIII},
+  number	= {17},
+  year		= {1997},
+  pages		= {30--32},
+  issn		= {1210-9924},
+  note		= {(in Czech)}
+}
+
+@Article{Jelinek:cw97b,
+  author	= {Jelínek, Ivan},
+  title		= {{CAD systémy a práce s nimi}},
+  journal	= {Computerworld},
+  volume	= {VIII},
+  number	= {4},
+  year		= {1997},
+  pages		= {13--14},
+  issn		= {1210-9924},
+  note		= {(in Czech)}
+}
+
+@Article{Jelinek:ln97a,
+  author	= {Jelínek, Ivan},
+  title		= {{PlíŸivá destrukce vysokého ¹kolství}},
+  journal	= {Lidové noviny},
+  volume	= {10},
+  number	= {140},
+  year		= {1997},
+  pages		= {9},
+  issn		= {0862-5921},
+  note		= {(in Czech)}
+}
+
+@Article{Jelinek:ln97b,
+  author	= {Jelínek, Ivan},
+  title		= {{Co vlastnì ohroŸuje prestiŸ uèitelù}},
+  journal	= {Lidové noviny},
+  volume	= {10},
+  number	= {22},
+  year		= {1997},
+  pages		= {9},
+  issn		= {0862-5921},
+  note		= {(in Czech)}
+}
+
+;;;;;;;;;;;;;; Kopal 98 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Kopal98:poster98,
+  author = {Kopal, T. and Havran, V. and Bittner, J. and \v{Z}\'{a}ra, J.},
+  title  = {Directionality in Ray Tracing},
+  pages = {IC 24},
+  crossref = {poster98},  
+}
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Limpouch 93-96  ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@Book{Limpouch:book93,
+  author	= "A. Limpouch",
+  title		= "{X} {W}indow {S}ystem - application programming",
+  key		= "limpouch",
+  publisher	= "Grada",
+  year		= "1993",
+  address	= "Prague",
+  note		= "In Czech"
+}
+
+@InProceedings{Limpouch:design95,
+  author	= "A. Limpouch",
+  title		= "Grammar-based Formal Specification for the Object-Oriented
+		  User Interface Development",
+  key		= "limpouch",
+  editor	= "F. Paterno",
+  pages		= "369--382",
+  booktitle	= "Design, Specification and Verification of Interactive
+		  Systems. Proceedings of the Eurographics Workshop on
+		  Interactive Systems (Bocca di Magra, 1994)",
+  year		= "1995",
+  publisher	= "Springer-Verlag, Berlin"
+}
+
+@InProceedings{Limpouch:ica95,
+  author	= "A. Limpouch",
+  title		= "{GIS} for the Next Century",
+  key		= "limpouch",
+  pages		= "20--32",
+  booktitle	= "Proceedings of 17th International Cartographic Conference",
+  year		= "1995",
+  publisher	= "Institut Cartografic de Catalunya, Barcelona"
+}
+
+@InProceedings{Limpouch:sofs94,
+  author	= "A. Limpouch",
+  title		= "Architecture for Interactive Systems with Highly Graphical
+		  User Interfaces",
+  key		= "limpouch",
+  pages		= "63--68",
+  year		= "1994",
+  booktitle	= "Proceedings of SOFSEM'94",
+  publisher	= "Masaryk University, Brno",
+  address	= "Milovy",
+  month		= nov,
+  note		= "Contributed talk"
+}
+
+@InProceedings{Limpouch:sofs95,
+  author	= "K. Charv\'{a}t and A. Limpouch",
+  title		= "Quo Vadis {GIS}: {F}rom {GIS} and {GIMS} to Open {GIS}",
+  key		= "limpouch",
+  pages		= "334--349",
+  booktitle	= "Proceedings of SOFSEM'95",
+  year		= "1995",
+  publisher	= "Springer-Verlag, Berlin",
+  month		= nov,
+  note		= "Invited paper"
+}
+
+@InProceedings{Limpouch:sscg94,
+  author	= "A. Limpouch",
+  title		= "Graphical User Interfaces",
+  crossref	= "sscg94",
+  key		= "limpouch",
+  pages		= "17--39",
+  note		= "Invited paper"
+}
+
+@Article{Limpouch:swn95,
+  author	= "A. Limpouch",
+  title		= "Geographic Information Systems",
+  key		= "limpouch",
+  journal	= "Softwarov\'{e} noviny",
+  year		= 1995,
+  volume	= "VI",
+  number	= 4,
+  pages		= "36--46",
+  note		= "In Czech"
+}
+
+@InProceedings{Limpouch:transition94,
+  author	= "K. Charv\'{a}t and A. Limpouch",
+  title		= "{TopoL GIS} system",
+  key		= "limpouch",
+  volume	= "II",
+  pages		= "51--63",
+  booktitle	= "Proceedings of the conference Europe in Transition: The
+		  Context of GIS",
+  year		= "1994",
+  publisher	= "Masaryk University, Brno",
+  address	= "Brno",
+  month		= aug
+}
+		  
+@InProceedings{Limpouch:wscg94,
+  author	= "A. Limpouch",
+  title		= "{X} {W}indow System",
+  crossref	= "wscg94",
+  key		= "limpouch",
+  pages		= "197--206"
+}
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Manda 96 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Manda:wscg96,
+  author	= "Manda, V. and Slav\'{\i}k, P.",
+  title		= "A New Method for Formal Description of 3D Scenes",
+  key		= "Slavik*",
+  pages		= "199--203",
+  booktitle	= "Proceedings of Winter School for Computer Graphics",
+  year		= 1996,
+  publisher	= "West Bohemian University, Plzen",
+  volume	= "I",
+  month		= feb
+}
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Marak 97 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Marak97,
+  author	= {Marák, Ivo},
+  title		= {{On Synthetic Terrain Erosion Modelling: A Survey}},
+  booktitle	= {{CESCG '97}},
+  address	= {Wien},
+  publisher	= {Technische Universität},
+  year		= {1997},
+  pages		= {63--71}
+}
+
+@InProceedings{Marak:ws97,
+  author	= {Marák, Ivo and Bene¹, Bedøich and Slavík, Pavel},
+  title		= {{Terrain Erosion Model Based on Rewriting Matricies}},
+  booktitle	= {{Workshop 97}},
+  volume	= {I},
+  address	= {Prague},
+  publisher	= {CTU},
+  year		= {1997},
+  pages		= {299--300}
+}
+
+@InProceedings{Marak:wscg97,
+  author = 	 {I. Mar\'{a}k and B. Bene\v{s} and P. Slav\'{\i}k},
+  title = 	 {Terrain Erosion Model Based on Rewriting of Matrices},
+  crossref =	 {wscg97},
+  volume =	 {II},
+  pages =	 {341--350}
+}
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Menzal 94 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Menzel94,
+  author	= "K. Menzel and O. Schmidt and F. Stangenberg and Chr.
+		  Hornung and B. Lange and A. Hole\v{c}ek and
+		  J. P\v{r}ikryl and J. \v{Z}\'ara",
+  title		= "Distributed Rendering Techniques using Virtual Walls",
+  key		= "rt, holecek, prikryl, zara",
+  pages		= "10",
+  booktitle	= "Proceedings of First European PVM Users Group Meeting",
+  year		= 1994,
+  address	= "Roma, Italy",
+  month		= oct
+}
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Miksicek 97 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Miksicek97,
+  author	= {Mik¹íèek, Luká¹},
+  title		= {{3D Sound - an overview}},
+  booktitle	= {{CESCG '97}},
+  address	= {Wien},
+  publisher	= {Technische Universität},
+  year		= {1997},
+  pages		= {155--162}
+}
+
+@InProceedings{Miksicek:ws97,
+  author	= {Mik¹íèek, Luká¹},
+  title		= {{Raster Image Output for Blind Users}},
+  booktitle	= {{Workshop 97}},
+  volume	= {I},
+  address	= {Prague},
+  publisher	= {CTU},
+  year		= {1997},
+  pages		= {323--324}
+}
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Mrazek 95 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Mrazek:sscg95,
+  author	= "P. Mr\'azek and P. Felkel and L. S\'ykora",
+  title		= "Model-Based Segmentation of Medical Images",
+  key		= "virtmed, virtual reality, medicine",
+  pages		= "DM.22--DM.31",
+  crossref      = "sscg95",
+  postscript	= "/Publications/mrazek_sscg_95.ps.gz"
+}
+
+;;;;;;;;;;;;;; Mrazek 96 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Mrazek96,
+  author        = "P. Mr\'azek",
+  title         = "Genetic Algorithms and Image Search",
+  crossref      = "wscg96",		  
+  pages         = "278--284"
+}
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Prikryl 96 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Prikryl:usp:1996,
+  author = 	 {Jan P\v{r}ikryl},
+  title = 	 {{\'{U}}vod do syst\'{e}mu {PVM}},
+  booktitle = 	 {Programy a algoritmy numerick\'{e} matematiky 8},
+  year = 	 {1996},
+  publisher =	 {Matematick\'{y} \'{u}stav {AV} {\v{C}R}},
+  organization = {Matematick\'{y} \'{u}stav {AV} {\v{C}R}},
+  address =	 {{\v{Z}}itn\'{a} 25, CZ-11567 Praha 1},
+  month =	 {June},
+  note = 	 {In Czech},
+  pages =	 {162--167}
+}
+
+;;;;;;;;;;;;;; Prikryl 97 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Prikryl:wscg97,
+  author = 	 {J. P\v{r}ikryl},
+  title = 	 {On Mesh Preprocessing for Radiosity},
+  crossref =	 {wscg97},
+  key =		 {radiosity, mesh, discontinuity meshing},
+  volume =	 {IV},
+  pages =	 {687--690}
+}
+
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Simek 96 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Simek:wscg96,
+  author	= "\v{S}imek, P. and Slav\'{\i}k, P.",
+  title		= "Constraint Satisfaction Problem Solved by Minimal Change
+		  method",
+  key		= "slavik",
+  pages		= "311--321",
+  crossref	= "wscg96",
+  year		= 1996,
+  volume	= "II"
+}
+
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Slavik 92 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Slavik:ws92,
+  author	= "Slav\'{\i}k, P. and P. Bene\v{s}, B.",
+  title		= "Generative description of objects and randomness",
+  crossref	= "ws92",
+  key		= "slavik, benes",
+  pages		= "??"
+}
+
+;;;;;;;;;;;;;; Slavik 93 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@Book{Slavik:grada93,
+  author	= "P. Slav\'{\i}k and M. \v{S}norek",
+  title		= "PC Video Adapter Programming",
+  year		= "1993",
+  publisher	= "Grada",
+  note		= "In Czech."
+}
+
+@InProceedings{Slavik:geom93,
+  author	= "P. Slav\'{\i}k",
+  title		= "Data Formats for Image Processing",
+  key		= "slavik",
+  pages		= "28--33",
+  booktitle	= "Proceeding of the 13th workshop on Geometry and Computer
+		  Graphics",
+  year		= 1993,
+  publisher	= "West Bohemian University, Plzen",
+  address	= "Rostock",
+  month		= sep
+}
+
+@TechReport{Slavik:uid93,
+  author	= "P. Slav\'{\i}k and A. Limpouch",
+  title		= "User Interface Design Based on the Theory of Formal
+		  Languages",
+  institution	= "Department of Computers, Czech Technical University",
+  key		= "slavik",
+  year		= "1993",
+  type		= "Research Report",
+  number	= "DC--93--03",
+  address	= "Prague, Czech Republic"
+}
+
+;;;;;;;;;;;;;; Slavik 94 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Slavik:cmuid94,
+  author	= "P. Slav\'{\i}k",
+  title		= "Grammars and rewriting systems as models for {GUI}",
+  key		= "slavik",
+  editor	= "C. Stary",
+  pages		= "1--11",
+  booktitle	= "First Interdisciplinary Workshop on Cognitive Modelling \&
+		  User Interface Development",
+  year		= 1994,
+  address	= "Vienna",
+  month		= dec
+}
+
+@Article{Slavik:sn12a94,
+  author	= "P. Slav\'{\i}k",
+  title		= "Compression of Graphical Information and Multimedia
+		  Systems",
+  key		= "slavik",
+  journal	= "Softwarov\'{e} noviny",
+  year		= 1994,
+  volume	= "V",
+  number	= 12,
+  pages		= "19--24",
+  note		= "In Czech"
+}
+
+@Article{Slavik:sn12b94,
+  author	= "P. Slav\'{\i}k",
+  title		= "Multimedia and Virtual Reality",
+  key		= "slavik",
+  journal	= "Softwarov\'{e} noviny",
+  year		= 1994,
+  volume	= "V",
+  number	= 12,
+  pages		= "26--27",
+  note		= "In Czech"
+}
+
+@InProceedings{Slavik:hci94,
+  author	= "P. Slav\'{\i}k and R. Herr",
+  title		= "Interaction in 3{D} Space and 3{D} window manager",
+  key		= "slavik, herr",
+  editor	= "D. England",
+  pages		= 2,
+  booktitle	= "{HCI '94} Ancillary Proceedings",
+  year		= 1994,
+  publisher	= "The University of Glasgow",
+  month		= aug
+}
+
+@InProceedings{Slavik:ica94,
+  author	= "P. Slav\'{\i}k",
+  title		= "Accelerating Interaction in 3{D} Space by Means of
+		  Constrains",
+  key		= "slavik",
+  pages		= "1--12",
+  booktitle	= "ICA '94. Integratioon of {CAD}-techniques in theory and
+		  Practice",
+  year		= 1994,
+  publisher	= "ZGDV e.V., Rostock",
+  address	= "Rostock",
+  month		= sep
+}
+
+
+;;;;;;;;;;;;;; Slavik 95 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InCollection{Slavik95,
+  author	= {P. Slav\'{\i}k},
+  title		= "{CAD} Systems: trends and developments",
+  booktitle	= "Information Management in Computer Integrated
+		  Manufacturing",
+  key		= {slavik},
+  publisher	= {Springer-Verlag},
+  year		= 1995,
+  editor	= "H. Adelsberger and J. La\v{z}ansk\'{y} and V.
+		  Ma\v{r}\'{i}k",
+  volume	= 973,
+  series	= {Lecture Notes in Computer Science},
+  pages		= {478--492}
+}
+
+@InProceedings{Slavik:wscg95,
+  author	= "Slav\'{\i}k, P. and P\v{r}ikryl, J.",
+  title		= "Dithering as a method for image data compression",
+  crossref	= "wscg95",
+  postscript    = {/Publications/slavik_wscg_95.ps.gz},		  
+  volume	= "II",
+  pages		= "283--288"
+}
+
+;;;;;;;;;;;;;; Slavik 96 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@Manual{Slavik:96,
+  title =        {WISE/E: Advanced User Manual},
+  author =       {Pavel Slav{\'\i}k and Martin Brachtl and
+                  Petr Hejda and Luk\'{a}\v{s} Mik\v{s}{\'\i}\v{c}ek
+                  and Ji\v{r}{\'\i} \v{Z}{\'a}ra and Vilu, J.},
+  organization = {Frauenhofer Institut, Rostock},
+  year =         1996,
+  annote =       {WISE/E}
+}
+
+@Article{Slavik:cg96,
+  author	= {P. Slav\'{\i}k},
+  title		= {Computer Graphics Education in the {C}zech {R}epublic},
+  journal	= {Computer Graphics},
+  year		= 1996,
+  number	= 1,
+  pages		= {22--24}
+}
+
+@InProceedings{Slavik:egvisc96,
+  author = 	 {P. Slav\'{\i}k and F. Hrdli\v{c}ka and T. Pavlis and
+		  P. Vl\v{c}ek},
+  title = 	 {Visualization of the dispersion of airborne
+                  effluents},
+  crossref =     {egvisc96},
+  pages =	 {153--169}
+}
+
+@Article{Slavik:sgiw96,
+  author	= {P. Slav\'{\i}k},
+  title		= {Report about {SIGGRAPH~'95}},
+  journal	= {Silicon World},
+  year		= 1996,
+  pages		= {57--59}
+}
+
+@Book{Slavik:skr196,
+  author	= "P. Slav\'{\i}k",
+  title		= "Methods for Graphical Information Processing. (Metody
+		  zpracov\'{a}n\'{\i} grafick\'{e} informace)",
+  year		= "1996",
+  publisher	= "CTU Prague",
+  note		= "In Czech."
+}
+
+@Book{Slavik:skr296,
+  author	= {P. Slav\'{\i}k},
+  title		= {Machine Oriented languages},
+  publisher	= {CTU Prague},
+  year		= 1996,
+  pages		= 191
+}
+
+@Article{Slavik:sn196,
+  author	= "Slav\'{\i}k, P.",
+  title		= "Applications of Scientific Visualization",
+  key		= "Slavik*",
+  journal	= "Softwarov\'{e} noviny",
+  year		= 1996,
+  volume	= "V",
+  number	= 2,
+  pages		= "23--24",
+  note		= "(In Czech)"
+}
+
+@Article{Slavik:sn296,
+  author	= "Slav\'{\i}k, P.",
+  title		= "Scientific Visualization",
+  key		= "Slavik*",
+  journal	= "Softwarov\'{e} noviny",
+  year		= 1996,
+  volume	= "V",
+  number	= 2,
+  pages		= "18--22",
+  note		= "(In Czech)"
+}
+
+;;;;;;;;;;;;;; Slavik 97 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@Article{Slavik97a,
+  author	= {Slavík, Pavel},
+  title		= {{Grammars and Rewriting Systems as Models for Graphical
+		  User Interfaces}},
+  journal	= {Cognitive Systems},
+  volume	= {4},
+  number	= {4-3},
+  year		= {1997},
+  pages		= {381--399},
+  issn		= {0256-663X}
+}
+
+@Article{Slavik97b,
+  author	= {Slavík, Pavel},
+  title		= {{Vizualizace dat mezinárodnì}},
+  journal       = {Computer Design},
+  volume        = {I},
+  number	= {4},
+  year		= {1997},
+  pages		= {76--79},
+  issn		= {1211-1082},
+  note		= {(in Czech)}
+}
+
+@Article{Slavik97c,
+  author	= {Slavík, Pavel and Hudec, Bohuslav},
+  title		= {{Vybíráme a testujeme CAD/CAM systémy}},
+  journal       = {Computer Design},
+  volume        = {I},
+  number	= {5},
+  year		= {1997},
+  pages		= {112--117},
+  issn		= {1211-1082},
+  note		= {(in Czech)}
+}
+
+@Article{Slavik97d,
+  author	= {Slavík, Pavel},
+  title		= {{Tvoøíme prototypy rychle a levnì}},
+  journal	= {Computer Design},
+  number	= {5},
+  volume        = {I}, 
+  year		= {1997},
+  pages		= {78--81},
+  issn		= {1211-1082},
+  note		= {(in Czech)}
+}
+
+@Unpublished{Slavik97e,
+  author	= {Slavík, Pavel},
+  title		= {{Lossy 3D Compression Methods}},
+  note		= {Invited Lecture},
+  address	= {Dagstuhl},
+  organisation	= {Universitaet Kaiserslautern},
+  date		= {12.06.97},
+  year		= {1997}
+}
+
+@Unpublished{Slavik97f,
+  author	= {Slavík, Pavel},
+  title		= {{HCI Education at CTU Prague}},
+  note		= {Invited Lecture},
+  address	= {Dresden},
+  organisation	= {TU Dresden},
+  date		= {05.03.97},
+  year		= {1997}
+}
+
+@InProceedings{Slavik97g,
+  author	= {Slavík, Pavel},
+  title		= {{Internet Applications at Department of Computer Science
+		  and Engineering}},
+  booktitle	= {{Computer Networking and Services of Distributed
+		  Systems}},
+  address	= {Aachen},
+  publisher	= {RWTH Aachen},
+  year		= {1997},
+  pages		= {107--119}
+}
+
+@InProceedings{Slavik97h,
+  author	= {Slavík, Pavel},
+  title		= {{HCI in the Czech Republic}},
+  booktitle	= {{CHI 97 Extended Abstracts}},
+  volume	= {1},
+  address	= {New York},
+  publisher	= {ACM},
+  year		= {1997},
+  pages		= {47--48}
+}
+
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Snorek 94 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@Article{Snorek:bajt94,
+  author	= "M. \v{S}norek",
+  title		= "{PC} motherboard evolution",
+  key		= "snorek",
+  journal	= "Bajt",
+  year		= 1994,
+  pages		= "151--156",
+  month		= jun,
+  note		= "In Czech"
+}
+
+@InProceedings{Snorek:ca94,
+  author	= "M. \v{S}norek",
+  title		= "{Hardware for Multimedia}",
+  year		= 1994,
+  pages		= "1--40",
+  note		= "In Czech",
+  booktitle	= "Computer Academy, AVAMP",
+  organization	= "Prague"
+}
+
+@Article{Snorek:sn1194,
+  author	= "M. \v{S}norek",
+  title		= "{Hardware for Multimedia}",
+  journal	= "Softwarov\'{e} noviny",
+  year		= 1994,
+  volume	= "V",
+  number	= 11,
+  pages		= "28--38",
+  note		= "In Czech"
+}
+
+@Article{Snorek:sn694,
+  author	= "M. \v{S}norek",
+  title		= "{RISC and PowerPC}",
+  journal	= "Softwarov\'{e} noviny",
+  year		= 1994,
+  volume	= "V",
+  number	= 6,
+  pages		= "20--27",
+  note		= "In Czech"
+}
+
+@InProceedings{Snorek:ws94,
+  author	= "\v{S}norek, M.",
+  title		= "Computer Graphics hardware",
+  crossref	= "ws94",
+  key		= "Snorek*",
+  pages		= "35--39"
+}
+
+;;;;;;;;;;;;;; Snorek 95 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@Book{Snorek:skr95,
+  author	= "\v{S}norek, M.",
+  title		= "Technical Equipment for Computer Graphics",
+  year		= "1995",
+  publisher	= "CTU publishing house",
+  pages         = "194",   
+  note		= "In Czech."
+}
+
+;;;;;;;;;;;;;; Snorek 96 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Snorek 97 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@Unpublished{Snorek97,
+  author	= {©norek, Miroslav},
+  title		= {{A "Bad" Student Prediction}},
+  note		= {Invited Lecture},
+  address	= {Dresden},
+  organisation	= {FTW Dresden},
+  date		= {13.11.97},
+  year		= {1997}
+}
+
+@Unpublished{Snorek97b,
+  author	= {©norek, Miroslav},
+  title		= {{Generalized Fingerprint}},
+  note		= {Invited Lecture},
+  address	= {Berlin},
+  organisation	= {PTB Berlin},
+  date		= {26.06.97},
+  year		= {1997}
+}
+
+@InProceedings{Snorek97c,
+  author	= {©norek, Miroslav},
+  title		= {{Generalized Fingerprint}},
+  booktitle	= {{Workshop 97}},
+  volume	= {I},
+  address	= {Prague},
+  publisher	= {CTU},
+  year		= {1997},
+  pages		= {305--306}
+}
+
+@Book{Snorek97d,
+  author	= {©norek, Miroslav},
+  title		= {{Periferní zaøízení}},
+  edition	= {1},
+  address	= {Praha},
+  publisher	= {ÈVUT},
+  year		= {1997},
+  pages		= {162},
+  figures	= {160},
+  isbn		= {80-01-01645-5},
+  note		= {(in Czech)}
+}
+
+
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Soch 95 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Soch:sscg95,
+  author	= "\v{S}och, M. and Bene\v{s}, B.",
+  title		= "Simulation of Plant Developement using Strands Model,",
+  key		= "Benes",
+  pages		= "AP.30-AP.35",
+  crossref      = "sscg95",
+  postscript    = "/Publications/soch_sscg_95.ps.gz"
+}
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Sochor 96 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@Book{Sochor:skr96,
+  author	= "Sochor, J. and \v{Z}\'ara, J. and Bene\v{s}, B.",
+  title		= "Algoritmy po\v{c}\'{\i}ta\v{c}ov\'e grafiky",
+  year		= "1996",
+  publisher	= "CVUT publishing house",
+  month         = jan,
+  pages		= 194,
+  note		= "In Czech."
+}
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Steuer 97 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Steuer97,
+  author	= {Steuer, Michal and Rothkrantz, L. and ©norek, Miroslav},
+  title		= {{Improvement of Training of the Neocognitron Neural
+		  Network}},
+  booktitle	= {{Workshop 97}},
+  volume	= {I},
+  address	= {Prague},
+  publisher	= {CTU},
+  year		= {1997},
+  pages		= {329--330}
+}
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Trefny 97 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Trefny97a,
+  author	= {Trefný, Marek and Bittner, J.},
+  title		= {{Global Visibility}},
+  booktitle	= {{Workshop 97}},
+  volume	= {I},
+  address	= {Prague},
+  publisher	= {CTU},
+  year		= {1997},
+  pages		= {325--326}
+}
+
+@InProceedings{Trefny97b,
+  author = 	 {M. Trefn\'{y} and J. Bittner},
+  title = 	 {Global Visibility},
+  crossref =	 {wscg97},
+  key =		 {global visibility, VRML, conservative visibility, spatial
+		  subdivision, visibility computations},
+  volume =	 {IV},
+  pages =	 {691--694}
+}
+
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Vecerka 94 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Vecerka:ssb94,
+  author	= "Ve\v{c}erka, D. and Vitou\v{s}ek, R.",
+  title		= "Medical Volume Visualization",
+  key		= "virtmed, vecerka, vitousek",
+  booktitle	= "Student Seminar on Computer Graphics `94",
+  year		= 1994,
+  organization	= "VUT Brno, CTU Prague, TU Vienna",
+  publisher	= "VUT Brno",
+  address	= "Brno, Czech Republic",
+  month		= nov
+}
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Zara 93 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@Book{Zara:book93,
+  author	= "\v{Z}\'ara, J. and Limpouch, A. and Bene\v{s}, B. and
+		  Werner, T.",
+  title		= "Po\v{c}\'{\i}ta\v{c}ov\'a grafika - principy a algoritmy",
+  year		= "1993",
+  publisher	= "Grada",
+  note		= "In Czech."
+}
+
+;;;;;;;;;;;;;; Zara 94 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@InProceedings{Zara:sscg94,
+  author	= "J. \v{Z}\'{a}ra and A. Hole\v{c}ek and J. P\v{r}ikryl",
+  title		= "When the Parallel Ray--Tracer Starts to be Efficient?",
+  crossref	= "sscg94",
+  key		= "rt, zara",
+  pages		= "108--116"
+}
+
+@InProceedings{Zara:ws94,
+  author	= "J. \v{Z}\'{a}ra and A. Hole\v{c}ek and J. P\v{r}ikryl",
+  title		= "Distributed Ray Tracing under {PVM}.",
+  crossref	= "ws94",
+  key		= "rt, zara",
+  pages		= "93--94"
+}
+
+@InProceedings{Zara:wscg94,
+  author	= "J. \v{Z}\'{a}ra and A. Hole\v{c}ek and J. P\v{r}ikryl",
+  title		= "Parallelisation of the Ray--Tracing Algorithm.",
+  crossref	= "wscg94",
+  key		= "rt, zara",
+  pages		= "113--117"
+}
+
+;;;;;;;;;;;;;; Zara 95 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@Article{Zara:sgiw95,
+  author	= " \v{Z}\'ara, J. and Bene\v{s}, B. and Pavlis, T.",
+  title		= {Interaktivn\'{\i} vizualizace dat - Explorer},
+  journal	= "Silicon World",
+  year		= "1995",
+  volume	= "II",
+  number	= "10",
+  pages		= "38-41",
+  note		= "In Czech"
+}
+
+@InProceedings{Zara:sscg95,
+  author = 	 {J. \v{Z}\'{a}ra},
+  title = 	 {Speeding Up Ray Tracing - {SW} and {HW} Approaches},
+  crossref =	 {sscg95},
+  key	=        "rt, zara",
+  pages =	 {IP.29--IP.44},
+  postscript =   "/Publications/zara_sscg_95.ps.gz"		  
+}
+
+@InProceedings{Zara:ws95,
+  author	= "J. \v{Z}\'{a}ra and A. Hole\v{c}ek and J. P\v{r}ikryl",
+  title		= "Loadbalancing for distributed raytracer",
+  crossref	= "ws95",
+  key		= "rt, zara",
+  pages		= "167--168"
+}
+
+@InProceedings{Zara:wscg95,
+  author	= "J. \v{Z}\'{a}ra and A. Hole\v{c}ek and J. P\v{r}ikryl and
+		  J. Buri\'{a}nek and K. Menzel",
+  title		= "Load balancing for parallel raytracer on Virtual Walls",
+  crossref	= "wscg95",
+  key		= "rt, zara",
+  volume	= {II},
+  pages		= "439--447"
+}
+
+
+;;;;;;;;;;;;;; Zara 96 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; Zara 97 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@Article{Zara97,
+  author	= {®ára, Jiøí},
+  title		= {{Jazyk VRML pro modelování virtuální reality}},
+  journal	= {Magazín ÈSN},
+  volume	= {7},
+  number	= {1},
+  year		= {1997},
+  pages		= {5--8},
+  issn		= {0862-7932},
+  note		= {(in Czech)}
+}
+
+@InProceedings{Zara:rufis97,
+  author	= {®ára, Jiøí and Zrzavý, Jakub},
+  title		= {{Multimedia Information System in 3D Space (MISS)}},
+  booktitle	= {{RUFIS '97. Proceedings for International Part of the
+		  Conference}},
+  address	= {Prague},
+  publisher	= {CTU},
+  year		= {1997},
+  pages		= {213--218},
+  isbn		= {80-01-01710-9}
+}
+
+@Article{Zara:sn97a,
+  author	= {®ára, Jiøí},
+  title		= {{VRML - jazyk pro virtuální realitu}},
+  journal	= {Softwarové noviny},
+  volume	= {VIII},
+  number	= 1,
+  year		= 1997,
+  pages		= {62--69},
+  issn		= {1210-8472},
+  note		= {(in Czech)}
+}
+		  
+@Article{Zara:sn97b,
+  author	= {®ára, Jiøí and Dachs, Libor and Buriánek, Jan},
+  title		= {{Vystaèíme s osmi bity?}},
+  journal	= {Softwarové noviny},
+  volume	= {VIII},
+  number	= 11,
+  year		= 1997,
+  pages		= {88--94},
+  issn		= {1210-8472},
+  note		= {(in Czech)}
+}
+
+@InProceedings{Zara:sofsem97,
+  author = 	 {J. ®ára},
+  title = 	 {An Introduction to Virtual Reality Modeling Language},
+  booktitle = 	 {Sofsem'97: Theory and Practice of Informatics},
+  editor =	 {F. Plá¹il and K. G. Jeffery},
+  series =	 {Lecture Notes in Computer Science},
+  number =       1338,
+  year =	 1997,
+  publisher =    {Springer},
+  address =	 {Milovy, Czech Republic},
+  month =	 nov,
+  pages =        {331--348},
+  postscript =   {/Publications/zara_sofsem_97.ps.gz}
+}
+
+@PhDThesis{Zara:theses97,
+  author	= {®ára, J.},
+  title		= {{On the Parallelization and Other Speeding Up Techniques
+		  for the Ray Tracing Algorithm}},
+  type		= {Associate Professor Theses},
+  address	= {Prague},
+  year		= {1997},
+  pages		= {62},
+  school	= {CTU, Faculty of Electrical Engineering}
+}
+
+
+
+@Book{Zara:book98,
+  author = 	 {Jiøí ®ára, Bedøich Bene¹, Petr Felkel},
+  title = 	 {Moderní poèítaèová grafika},
+  publisher = 	 {Computer Press, Brno},
+  year = 	 1998,
+  html =	 {http://sgi.felk.cvut.cz/Contact}
+}
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+;;;;;;;;;;;;;; crossref 94 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+@TechReport{collrep94,
+  author	= "P. Tvrd\'{\i}k",
+  title		= "Research Activities of Department of Computers",
+  institution	= "Department of Computers, Czech Technical University",
+  year		= 1993,
+  type		= "Collaborative Report",
+  number	= "DC--93--02",
+  address	= "Prague, Czechoslovakia",
+  month		= may
+}
+
+@Proceedings{egvisc96,
+  title = 	 {Proceedings of 7th Eurographics Workshop on
+                  Visualization in
+                  Scientific Computing },
+  booktitle = 	 {Proceedings of 7th Eurographics Workshop on
+		  Visualization in Scientific Computing},
+  year = 	 1996,
+  editor =	 {P. Slavík and J.v. Wijk and P. Felkel
+                  and J. Vorlíèek},
+  publisher =	 {Czech Technical University, Department of
+                  Computer Science \& Engineering
+                  and Czech ACM Chapter, Prague},
+  month =	 apr # {~23--25,},
+  note =	 {198 pages},
+  procenta =     {30 30 20 20}
+}
+
+@Proceedings{poster95,
+  title		= "Poster '95",
+  booktitle	= "Poster '95",
+  year		= "1995",
+  editor	= "J. T\v{u}ma",
+  publisher	= "Czech Technical University Publishing House"
+}
+
+@Proceedings{poster96,
+  title		= "Poster '96",
+  booktitle	= "Poster '96",
+  year		= 1996,
+  month = may,
+  editor	= "J. T\v{u}ma",
+  publisher	= "Czech Technical University Publishing House"
+}
+
+@Proceedings{poster97,
+  title		= "Poster '97",
+  booktitle	= "Poster '97 -- 1st International Student Conference 
+                   on Electrical Engineering",
+  month = may,
+  year		= 1997,
+  editor	= "J. T\v{u}ma",
+  publisher	= "Czech Technical University Publishing House"
+}
+
+@Proceedings{poster98,
+  title		= "Poster '98",
+  booktitle	= "Poster '98 -- 2nd International Student Conference 
+                   on Electrical Engineering",
+  month = may,
+  year		= 1998,
+  editor	= "J. T\v{u}ma",
+  publisher	= "Czech Technical University Publishing House, Prague"
+} 
+
+@Proceedings{sccg97,
+  title = 	 {Proceedings of Spring Conference on Computer Graphics},
+  booktitle = 	 {Proceedings of Spring Conference on Computer Graphics},
+  year = 	 1997,
+  editor =	 {T. Plachetka and A. Ferko},
+  address =	 {Budmerice, Slovakia},
+  month =	 jun # { 5--8},
+}
+
+@Proceedings{sccg97pos,
+  title = 	 {Proceedings of Spring Conference on Computer Graphics,
+                  Company Presentations , Posters},
+  booktitle = 	 {Proceedings of Spring Conference on Computer Graphics,
+                  Company Presentations , Posters},
+  year = 	 1997,
+  editor =	 {T. Plachetka and A. Ferko},
+  address =	 {Budmerice, Slovakia},
+  month =	 jun # { 5--8},
+}
+
+@Proceedings{sscg94,
+  title		= "Proceedings of 10th Spring School on Computer Graphics",
+  booktitle	= "Proceedings of 10th Spring School on Computer Graphics",
+  year		= 1994,
+  editor	= "E. Ru\v{z}ick\'{y}",
+  address	= "Bratislava, Slovakia",
+  month		= jun
+}
+
+@Proceedings{sscg95,
+  title		= "Proceedings of 11th Spring School on Computer Graphics",
+  booktitle	= "Proceedings of 11th Spring School on Computer Graphics",
+  year		= 1995,
+  editor	= "T. Plachetka",
+  address	= "Bratislava, Slovakia",
+  month		= may
+}
+
+@Proceedings{ws92,
+  title		= "CTU Workshop '92",
+  booktitle	= "CTU Workshop '92",
+  year		= "1992",
+  editor	= "A. Strejc",
+  volume	= "Part I.",
+  publisher	= "Czech Technical University, Prague, Czech Republic",
+  month		= jan
+}
+
+@Proceedings{ws93,
+  title		= "CTU Workshop '93",
+  booktitle	= "CTU Workshop '93",
+  year		= "1993",
+  editor	= "A. Strejc",
+  volume	= "A",
+  publisher	= "Czech Technical University, Prague, Czech Republic",
+  month		= jan
+}
+
+@Proceedings{ws94,
+  title		= "CTU Seminar '94",
+  booktitle	= "CTU Seminar '94",
+  year		= "1994",
+  editor	= "A. Strejc",
+  volume	= "B",
+  publisher	= "Czech Technical University, Prague, Czech Republic",
+  month		= jan
+}
+
+@Proceedings{ws95,
+  title		= "CTU Workshop '95",
+  booktitle	= "CTU Workshop '95",
+  year		= "1995",
+  editor	= "A. Strejc",
+  volume	= "1",
+  publisher	= "Czech Technical University, Prague, Czech Republic",
+  month		= jan
+}
+
+@Proceedings{ws96,
+  title		= "Workshop '96",
+  booktitle	= "Workshop '96",
+  year		= "1996",
+  editor	= "A. Strejc",
+  volume	= "I",
+  publisher	= "Czech Technical University Publishing House, Brno/Prague, Czech Republic",
+  month		= jan
+}
+
+@Proceedings{	  ws98,
+  title		= "Workshop '98",
+  booktitle	= "Workshop '98",
+  year		= "1998",
+  editor	= "A. Strejc",
+  volume	= "I",
+  publisher	= "Czech Technical University Publishing House, Prague,
+		  Czech Republic",
+  month		= feb # { 3.--5.}
+}
+
+@Proceedings{wscg94,
+  title		= "Proceedings of Winter School of Computer Graphics and CAD
+		  Systems",
+  booktitle	= "Proceedings of Winter School of Computer Graphics and CAD
+		  Systems",
+  year		= "1994",
+  editor	= "V\'{a}clav Skala",
+  publisher	= "University of West Bohemia, Plze\v{n}, Czech Republic",
+  month		= jan
+}
+
+@Proceedings{wscg95,
+  title		= "Proceedings of The Third International Conference in
+		  Central Europe on Computer Graphics and Visualisation '95",
+  booktitle	= "Proceedings of The Third International Conference in
+		  Central Europe on Computer Graphics and Visualisation '95",
+  year		= "1995",
+  editor	= "V\'{a}clav Skala",
+  publisher	= "University of West Bohemia, Plze\v{n}, Czech Republic",
+  month		= feb
+}
+
+@Proceedings{wscg96,
+  title		= "Proceedings of The Fourth International Conference in
+		  Central Europe on Computer Graphics and Visualisation '96",
+  booktitle	= "Proceedings of The Fourth International Conference in
+		  Central Europe on Computer Graphics and Visualisation '96",
+  year		= "1996",
+  editor	= "V\'{a}clav Skala",
+  publisher	= "University of West Bohemia, Plze\v{n}, Czech Republic",
+  month		= feb
+}
+
+@Proceedings{wscg97,
+  title = 	 {Proceedings of The Fifth Internatinal Conference in Central
+		  Europe on Computer Graphics and Visualization '97},
+  booktitle = 	 {Proceedings of The Fifth Internatinal Conference in Central
+		  Europe on Computer Graphics and Visualization '97},
+  year = 	 {1997},
+  editor =	 {Nadia Magenant Thalman and V\'{a}clav Skala},
+  address =	 {Depatment of Computer Science, University of West
+		  Bohemia,
+		  Univerzitn\'{\i} 22, BOX 314, CZ-30614 Plze\v{n}},
+  month =	 feb
+}
+
+%%%%%%%%%%%%%%%%% konference 1998 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
+@Proceedings{sccg98,
+  title = 	 {Spring Conference on Computer Graphics},
+  year = 	 1998,
+  editor =	 {Lázló Szirmay-Kalos},
+  address =	 {Budmerice, Slovakia},
+  month =	 apr # { 23--25},
+  html =	 {http://center.fmph.uniba.sk/~sccg/index.html},
+  where =	 {Grlab},
+  isbn =         {ISBN 80-223-0837-4}
+}
+
+
Index: trunk/VUT/doc/SciReport/Bib/others.bib
===================================================================
--- trunk/VUT/doc/SciReport/Bib/others.bib	(revision 243)
+++ trunk/VUT/doc/SciReport/Bib/others.bib	(revision 243)
@@ -0,0 +1,36 @@
+@InProceedings{Drettakis:1996:AVM,
+  author =       "George Drettakis and Fran{\c{c}}ois Sillion",
+  title =        "Accurate Visibility and Meshing Calculations for
+                 Hierarchical Radiosity",
+  booktitle =    "Eurographics Rendering Workshop 1996",
+  editor =       "Xavier Pueyo and Peter Schr{\"{o}}der",
+  year =         "1996",
+  organization = "Eurographics",
+  publisher =    "Springer Wein",
+  address =      "New York City, NY",
+  month =        jun,
+  pages =        "269--278",
+  note =         "ISBN 3-211-82883-4",
+  annote =       "Precise quality control for hierarchical lighting
+                 simulations is still a hard problem, due in part to the
+                 difficulty of analysing the source of error and to the
+                 close interactions between different components of the
+                 algorithm. In this paper we attempt to address this
+                 issue by examining two of the most central components
+                 of these algorithms: visibility computation and the
+                 mesh. We first present an investigation tool in the
+                 form of a new hierarchical algorithm: this algorithmic
+                 extension encapsulates exact visibility information
+                 with respect to the light source in the form of the
+                 backprojection data structure, and allows the use of
+                 discontinuity meshes in the solution hierarchy. This
+                 tool permits us to study separately the effects of
+                 visibility and meshing error on image quality,
+                 computational expense as well as solution convergence.
+                 Initial experimental results are presented by comparing
+                 standard quadtree-based hierarchical radiosity with
+                 point-sampling visibility to the approaches
+                 incorporating backprojections, discontinuity meshes or
+                 both.",
+}
+
Index: trunk/VUT/doc/SciReport/Bib/renmame.bib
===================================================================
--- trunk/VUT/doc/SciReport/Bib/renmame.bib	(revision 243)
+++ trunk/VUT/doc/SciReport/Bib/renmame.bib	(revision 243)
@@ -0,0 +1,2388 @@
+
+@InProceedings{Niepel:1995:SCD,
+  author =       "L. Niepel and J. Martinka and A. Ferko and P. Elias",
+  title =        "On Scene Complexity Definition for Rendering",
+  booktitle =    "Winter School of Computer Graphics 1995",
+  year =         "1995",
+  month =        feb,
+  note =         "held at University of West Bohemia, Plzen, Czech
+                 Republic, 14-18 February 1995",
+  who  = "Havran Vlastimil: REN-0001",
+}
+
+@TechReport{Snyder96,
+  author = "J. M. Snyder",
+  title = "Area Light Sources for Real-Time Graphics",
+  pages = 30,
+  institution = "Microsoft Research",
+  year = 1996,
+  month = mar,
+  number = "MSR-TR-96-11",
+  who  = "Havran Vlastimil: REN-0002",
+}
+
+@InProceedings{Keller:1997:IR,
+  author =       "Alexander Keller",
+  title =        "Instant Radiosity",
+  booktitle =    "SIGGRAPH 97 Conference Proceedings",
+  editor =       "Turner Whitted",
+  series =       "Annual Conference Series",
+  year =         "1997",
+  organization = "ACM SIGGRAPH",
+  publisher =    "Addison Wesley",
+  month =        aug,
+  pages =        "49--56",
+  note =         "ISBN 0-89791-896-7",
+  keywords =     "Radiance equation, radiosity, shading, Monte Carlo
+                 integration, quasi-Monte Carlo integration,
+                 quasi-random walk, jittered low discrepancy sampling,
+                 hardware, accumulation buffer, realtime rendering
+                 algorithms, photorealism",
+  annote =       "We present a fundamental procedure for instant
+                 rendering from the radiance equation. Operating
+                 directly on the textured scene description, the very
+                 efficient and simple algorithm produces photorealistic
+                 images without any finite element kernel or solution
+                 discretization of the underlying integral equation.
+                 Rendering rates of a few seconds are obtained by
+                 exploiting graphics hardware, the deterministic
+                 technique of the quasi-random walk for the solution of
+                 the global illumination problem, and the new method of
+                 jittered low discrepancy sampling.",
+  who  = "Havran Vlastimil: REN-0003",
+}
+
+@Article{Tiede:1990:IMA,
+  author =       "Ulf Tiede and Karl Heinz Hoehne and Michael Bomans and
+                 Andreas Pommert and Martin Riemer and Gunnar Wiebecke",
+  title =        "Investigation of Medical {3D}-Rendering Algorithms",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "10",
+  number =       "2",
+  pages =        "41--53",
+  month =        mar,
+  year =         "1990",
+  coden =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Univ Hospital Eppendorf, Inst of Math \& Comput Sci in
+                 Med, Hamburg, West Ger",
+  classification = "461; 723",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "Biomedical Engineering; Computer Graphics --- Medical
+                 Applications; Computer Programming --- Algorithms;
+                 Computerized Tomography; Gradient Shading; Magnetic
+                 Resonance --- Imaging Techniques; Shading Algorithms;
+                 Surface Rendering; surface rendering",
+  who  = "Havran Vlastimil: REN-0004",
+}
+
+@Article{George:1990:RRD,
+  author =       "David W. George and Fran{\c{c}}ois X. Sillion and
+                 Donald P. Greenberg",
+  title =        "Radiosity Redistribution for Dynamic Environments",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "10",
+  number =       "4",
+  pages =        "26--34",
+  month =        jul,
+  year =         "1990",
+  coden =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Cornell Univ, Ithaca, NY, USA",
+  annote =       "They present a modification to the progressive
+                 radiosity to allow faster radiosity computation for
+                 animation sequences where objects can be added, moved,
+                 removed or their surface changed properties. When an
+                 object is added, radiosity is shot onto these new
+                 patches. A shadow volume is determined and a negative
+                 radiosity is shot to the patches in shadow. When an
+                 object is moved, it is removed from the scene and added
+                 to the new position, the radiosity being recomputed at
+                 each step. The radiosity recomputed is based on two
+                 strategies: redistribute first or interleave
+                 redistribution and propagation. Some heuristics are
+                 presented to choose the most important patches. This
+                 solution is good when just a few objects are involved
+                 but as the complexity of the scenes and mostly moving
+                 objects increases, the algorithm lost of its
+                 interest.",
+  classification = "723",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "Computer Graphics; Computer Software --- Applications;
+                 Interactive; radiosity, animation, interaction, shadow,
+                 negative radiosity; Shading; Shadowing",
+  who  = "Havran Vlastimil: REN-0005",
+}
+
+@TechReport{EVL-1997-43,
+  author =       "M. Stamminger and Ph. Slusallek and H.-P. Seidel",
+  title =        "Bounded Clustering -- Finding Good Bounds on Clustered
+                 Light Transport",
+  number =       "2",
+  institution =  "Universit{\"a}t Erlangen-N{\"u}rnberg",
+  year =         "1997",
+  note =         "submitted for publication",
+  abstract =     "Clustering is a very efficient technique for applying
+                 finite element methods to the computation of global
+                 illumination of complex scenes. Both computation time
+                 and memory consumption can be reduced dramatically by
+                 grouping the primitives of the input scene into a
+                 hierarchy of clusters and allowing for light exchange
+                 between all levels of this hierarchy. One problem with
+                 clustering methods, however, has been to determine good
+                 bounds on the exchange of light between nodes in the
+                 hierarchy. In this paper, we propose a set of methods
+                 applicable to both clusters and surface patches that
+                 allows for computing conservative but tight error
+                 bounds on the light transport between clusters and
+                 surface patches. Their intrinsic properties can be
+                 exploited by splitting the computation of bounds into a
+                 set of related methods, applicable to any object. The
+                 resulting algorithm abstracts from the nature of the
+                 interacting objects -- light transport between
+                 clusters, planar patches and even curved surfaces can
+                 be efficiently approximated and bound by a single set
+                 of methods.",
+  evlib-url =    "http://infovis.zib.de:8000/Dienst/UI/2.0/Describe/evl.surfacerendering%2FEVL-1997-43",
+  evlib-revision = "1st",
+  who  = "Havran Vlastimil: REN-0006",
+}
+
+@InProceedings{EVL-1997-38,
+  author =       "M. Stamminger and W. Nitsch and Ph. Slusallek",
+  title =        "Isotropic Clustering for Hierarchical Radiosity --
+                 Implementation and Experiences",
+  booktitle =    "Proc. Fifth International Conference in Central Europe
+                 on Computer Graphics and Visualization '97",
+  year =         "1997",
+  abstract =     "Although Hierarchical Radiosity was a big step forward
+                 for finite element computations in the context of
+                 global illumination, the algorithm can hardly cope with
+                 scenes of more than medium complexity. The reason is
+                 that Hierarchical Radiosity requires an initial linking
+                 step, comparing all pairs of initial objects in the
+                 scene. These initial objects are then hierarchically
+                 subdivided in order to accurately represent the light
+                 transport between them. Isotropic Clustering, as
+                 introduced by Sillion, in addition creates a hierarchy
+                 above the input objects. Thus, it allows for the
+                 interaction of complete clusters of objects and avoids
+                 the costly initial linking step. In this paper, we
+                 describe our implementation of the isotropic clustering
+                 algorithm and discuss some of the problems that we
+                 encountered. The complexity of the algorithm is
+                 examined and clustering strategies are compared.",
+  postscript-url = "ftp://faui90.informatik.uni-erlangen.de/pub/Publications/1997/Publ.1997.3.ps.gz",
+  evlib-url =    "http://infovis.zib.de:8000/Dienst/UI/2.0/Describe/evl.surfacerendering%2FEVL-1997-38",
+  evlib-revision = "1st",
+  who  = "Havran Vlastimil: REN-0007",
+}
+
+@InProceedings{Shirley95-GIDE,
+  author =       "Peter Shirley and Bretton Wade and Philip M. Hubbard
+                 and David Zareski and Bruce Walter and Donald P.
+                 Greenberg",
+  year =         "1995",
+  title =        "Global {Illumination} via {Density} {Estimation}",
+  booktitle =    "Rendering Techniques '95 (Proceedings of the Sixth
+                 Eurographics Workshop on Rendering)",
+  pages =        "219--230",
+  publisher =    "Springer-Verlag",
+  address =      "New York, NY",
+  who = "Havran Vlastimil: REN-0008",
+}
+
+@InProceedings{Arvo:1990:PTI,
+  author =       "James Arvo and David Kirk",
+  editor =       "Forest Baskett",
+  title =        "Particle Transport and Image Synthesis",
+  booktitle =      "Computer Graphics (Proceedings of SIGGRAPH'90)",
+  pages =        "63--66",
+  month =        aug,
+  year =         "1990",
+  annote =       "The rendering equation is similar to the linear
+                 Boltzmann equation which has been widely studied in
+                 physics and nuclear engineering. Consequently, many of
+                 the powerful techniques which have been developed in
+                 these fields can be applied to problems in image
+                 synthesis. In this paper we adapt several statistical
+                 techniques commonly used in neutron transport to
+                 stachastic ray tracing and, more generally, to Monte
+                 Carlo solution of the rendering equation. First, we
+                 describe a technique known as {\em Russian roulette}
+                 which can be used to terminate the recursive tracing of
+                 rays without introducing statistical bias. We also
+                 examine the practice of creating ray trees in classical
+                 ray tracing in the light of a well-known technique in
+                 particle transport known as {\em splitting}. We show
+                 that neither ray trees nor paths as described in
+                 [Kaj86] constitute an optimal sampling plan in
+                 themselves and that a hybrid may be more efficient.",
+  conference =   "held in Dallas, Texas; 6--10 August 1990",
+  keywords =     "Boltzmann equation, Monte Carlo, particle transport,
+                 radiosity, ray tracing, rendering equation",
+  who  = "Havran Vlastimil: REN-0009",
+}
+
+@InProceedings{Interrante:1997:ISS,
+  author =       "Victoria L. Interrante",
+  title =        "Illustrating Surface Shape in Volume Data via
+                 Principal Direction-Driven 3{D} Line Integral
+                 Convolution",
+  booktitle =    "SIGGRAPH 97 Conference Proceedings",
+  editor =       "Turner Whitted",
+  series =       "Annual Conference Series",
+  year =         "1997",
+  organization = "ACM SIGGRAPH",
+  publisher =    "Addison Wesley",
+  month =        aug,
+  pages =        "109--116",
+  note =         "ISBN 0-89791-896-7",
+  keywords =     "visualization, transparent surfaces, shape
+                 representation, principal directions, stroke textures,
+                 line integral convolution, solid texture, isosurfaces,
+                 volume rendering",
+  annote =       "This paper describes how the set of principal
+                 directions and principal curvatures can be understood
+                 to define a natural {"}flow{"} over the surface of an
+                 object and, as such, can be used to guide the placement
+                 of the lines of a stroke texture that seeks to
+                 represent 3D shape in a perceptually intuitive way. The
+                 driving application for this work is the visualization
+                 of layered isovalue surfaces in volume data, where the
+                 particular identity of an individual surface is not
+                 generally known a priori and observers will typically
+                 wish to view a variety of different level surfaces from
+                 the same distribution, superimposed over underlying
+                 opaque structures. This paper describes how, by
+                 advecting an evenly distributed set of tiny opaque
+                 particles, and the empty space between them, via 3D
+                 line integral convolution through the vector field
+                 defined by the principal directions and principal
+                 curvatures of the level surfaces passing through each
+                 gridpoint of a 3D volume, it is possible to generate a
+                 single scan-converted solid stroke texture that can be
+                 used to illustrate the essential shape information of
+                 any level surface in the data. By redefining the length
+                 of the filter kernel according to the magnitude of the
+                 maximum principal curvature of the level surface at
+                 each point around which the convolution is applied, one
+                 can generate longer strokes over more the highly curved
+                 areas, where the directional information is both most
+                 stable and most relevant, and at the same time downplay
+                 the visual impact of the directional information
+                 indicated by the stroke texture in the flatter regions.
+                 In a voxel-based approach such as this one, stroke
+                 narrowness will be constrained by the resolution of the
+                 volume within which the texture is represented.
+                 However, by adaptively indexing into multiple
+                 pre-computed texture volumes, obtained by advecting
+                 particles of increasing sizes, one may selectively
+                 widen the strokes at any point by a variable amount,
+                 determined at the time of rendering, to reflect shading
+                 information or any other function defined over the
+                 volume data.",
+  who  = "Havran Vlastimil: REN-0010",
+}
+
+@InProceedings{salesin90a,
+  author =       "David Salesin and Jorge Stolfi",
+  title =        "Rendering {CSG} Models with a {ZZ}-Buffer",
+  pages =        "67--76",
+  booktitle =    "Computer Graphics (SIGGRAPH '90 Proceedings)",
+  volume =       "24",
+  number =       "4",
+  year =         "1990",
+  month =        aug,
+  editor =       "Forest Baskett",
+  conference =   "held in Dallas, Texas; 6-10 August 1990",
+  keywords =     "ray tracing, antialiasing, constructive solid
+                 geometry, transparent surfaces, display buffers,
+                 visible-surface algorithms, rendering algorithms",
+  annote =       "The ZZ-buffer is a simple acceleration scheme for ray
+                 tracing that can be applied to a wide variety of
+                 scenes, including those with small features, textured
+                 and transparent surfaces, shadows and penubrae, and
+                 depth-of-field effects. In this paper, we describe how
+                 the ZZ-buffer algorithm can be adapted to the rendering
+                 of scenes defined by constructive solid geometry.",
+  who  = "Havran Vlastimil: REN-0011",
+}
+
+@InProceedings{oikarinen97a,
+  author =       "Jarkko OIKARINEN and Lasse JYRKINEN",
+  title =        "Maximum Intensity Projection by 3-Dimensional Seed Filling
+                  in View Lattice",
+  pages =        "173--183",
+  booktitle =      "Proceedings of {\em Compugraphics'97}",
+  keywords = "volume visualization, three-dimensional (3D) Imaging, Ray Casting,
+              Volume Rendering, Medical Application",
+  year =         "1997",
+  month = dec,
+  who  = "Havran Vlastimil: REN-0012",
+}
+
+@Article{Brotman:1984:GSS,
+  author =       "Lynne Shapiro Brotman and Norman I. Badler",
+  title =        "Generating Soft Shadows with a Depth Buffer
+                 Algorithm",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "4",
+  number =       "10",
+  pages =        "5--12",
+  month =        oct,
+  year =         "1984",
+  coden =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Wed Jan 29 06:09:24 1997",
+  acknowledgement = ack-nhfb,
+  classification = "723",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "computer graphics; computer programming;
+                 computer-synthesized shadows; depth buffer algorithm;
+                 penumbra; shadow, I37 soft shadow, I37 shadow penumbra;
+                 soft shadows; visible surface rendering",
+  who  = "Havran Vlastimil: REN-0013",
+}
+
+@InProceedings{Fang:1996:DVR,
+  title =        "Deformable Volume Rendering by {3D} Texture Mapping
+                 and Octree Encoding",
+  author =       "Shiaofen Fang and Rajagopalan Srinivasan and Su Huang
+                 and Ragu Raghavan",
+  booktitle =    "IEEE Visualization '96",
+  organization = "IEEE",
+  year =         "1996",
+  month =        oct,
+  note =         "ISBN 0-89791-864-9",
+  who  = "Havran Vlastimil: REN-0014",
+}
+
+@InProceedings{Reitan97a,
+  author =       "Paula J. Reitan",
+  title =        "3D Visualization of Truecolor Image Histograms",
+  pages =        "320--328",
+  booktitle =      "Proceedings of {\em Compugraphics'97}",
+  keywords = "3D tree drawing, 3D data structures, truecolor image histograms",
+  year =         "1997",
+  month = dec,
+  who  = "Havran Vlastimil: REN-0015",
+}
+
+@InProceedings{EVL-1997-127,
+  author =       "Bruce Walter and G{\"{u}}n Alppay and Eric P. F.
+                 Lafortune and Sebastian Fernandez and Donald P.
+                 Greenberg",
+  editor =       "Turner Whitted",
+  title =        "Fitting Virtual Lights For Non-Diffuse Walkthroughs",
+  booktitle =    "SIGGRAPH 97 Conference Proceedings",
+  series =       "Annual Conference Series",
+  pages =        "45--48",
+  publisher =    "Addison Wesley",
+  month =        aug,
+  year =         "1997",
+  keywords =     "interactive walkthroughs, non-diffuse appearance,
+                 global illumination, Phong shading",
+  language =     "en",
+  abstract =     "This paper describes a technique for using a simple
+                 shading method, such as the Phong lighting model, to
+                 approximate the appearance calculated by a more
+                 accurate method. The results are then suitable for
+                 rapid display using existing graphics hardware and
+                 portable via standard graphics API's. Interactive
+                 walkthroughs of view-independent nondiffuse global
+                 illumination solutions are explored as the motivating
+                 application.",
+  note =         "ISBN 0-89791-896-7",
+  evlib-url =    "http://visinfo.zib.de:80/Dienst/UI/2.0/Describe/evl.computergraphics%2FEVL-1997-127",
+  evlib-revision = "1st",
+  organization = "ACM SIGGRAPH",
+ who  = "Havran Vlastimil: REN-0016",
+}
+
+@Article{Verbeck:1984:CLD,
+  author =       "Channing P. Verbeck and Donald P. Greenberg",
+  title =        "A Comprehensive Light-Source Description for Computer
+                 Graphics",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "4",
+  number =       "7",
+  pages =        "66--75",
+  month =        jul,
+  year =         "1984",
+  coden =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
+  acknowledgement = ack-nhfb,
+  classification = "723; 741",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "computer generated images; computer graphics ---
+                 Imaging Techniques; light sources; light, I34 Ray
+                 Tracing, I37 Light-Source Description; ray-tracing
+                 system",
+ who  = "Havran Vlastimil: REN-0017",
+}
+
+@InProceedings{Lafortune95-FTRVM,
+  author =       "Eric P. Lafortune and Yves D. Willems",
+  editor =       "P. M. Hanrahan and W. Purgathofer",
+  year =         "1995",
+  title =        "A 5{D} {Tree} to {Reduce} the {Variance} of {Monte}
+                 {Carlo} {Ray} {Tracing}",
+  booktitle =    "Rendering Techniques '95 (Proceedings of the Sixth
+                 Eurographics Workshop on Rendering)",
+  pages =        "11--20",
+  publisher =    "Springer-Verlag",
+  address =      "New York, NY",
+  keywords =     "Monte Carlo, ray tracing, illumination caching",
+  comments =     "ISBN 3-211-82733-1",
+  who  = "Havran Vlastimil: REN-0018",
+}
+
+@InProceedings{Tobler:1997:HSA,
+  author =       "Robert F. Tobler and Alexander Wilkie and Martin Feda
+                 and Werner Purgathofer",
+  title =        "A Hierarchical Subdivision Algorithm for Stochastic
+                 Radiosity Methods",
+  booktitle =    "Eurographics Rendering Workshop 1997",
+  editor =       "Julie Dorsey and Philipp Slusallek",
+  year =         "1997",
+  organization = "Eurographics",
+  publisher =    "Springer Wein",
+  address =      "New York City, NY",
+  month =        jun,
+  pages =        "193--204",
+  note =         "ISBN 3-211-83001-4",
+  keywords =     "radiosity, stochastic, Monte Carlo, hierarchical,
+                 Galerkin",
+  annote =       "The algorithm proposed in this paper uses a stochastic
+                 approach to incrementally calculate the illumination
+                 function over a surface. By tracking the illumination
+                 function at different levels of meshing resolution, it
+                 is possible to get a measure for the quality of the
+                 current representation, and to adoptively subdivide in
+                 places with inadequate accuracy. With this technique a
+                 hierarchical mesh that is based on the stochastic
+                 evaluation of global illumination is generated.",
+  who  = "Havran Vlastimil: REN-0019",
+}
+
+@TechReport{EVL-1995-11,
+  author =       "E. Gr{\"o}ller and W. Purgathofer",
+  title =        "Coherence in Computer Graphics",
+  type =         "Research paper",
+  institution =  "Institute for Computer Graphics, Technical University
+                 Vienna",
+  year =         "1995",
+  abstract =     "Coherence denotes similarities between items or
+                 entities. It describes the extent to which these items
+                 or entities are locally constant. An introduction to
+                 coherence and a survey of various types of coherence,
+                 that are used in computer graphics, are given.
+                 Techniques and data structures for exploiting coherence
+                 in computer graphics are described. Incremental
+                 techniques, bounding volume schemes, subdivision
+                 techniques and several geometric data structures are
+                 discussed in more detail. Applications of coherence
+                 principles to computer graphics are treated and a
+                 survey of previous research is done.",
+  postscript-url = "ftp://ftp.cg.tuwien.ac.at/pub/TR/95/TR-186-2-95-04Paper.ps.gz",
+  evlib-url =    "http://infovis.zib.de:8000/Dienst/UI/2.0/Describe/evl.computergraphics%2FEVL-1995-11",
+  evlib-revision = "1st",
+  who  = "Havran Vlastimil: REN-0020",
+}
+
+
+@InProceedings{Veach94-BELT,
+  author =       "Eric Veach and Leonidas Guibas",
+  month =        jun,
+  year =         "1994",
+  title =        "Bidirectional {Estimators} for {Light} {Transport}",
+  booktitle =    "Fifth Eurographics Workshop on Rendering",
+  pages =        "147--162",
+  address =      "Darmstadt, Germany",
+  keywords =     "Monte Carlo, sampling noise, variance reduction, light
+                 transport, importance transport",
+  who  = "Havran Vlastimil: REN-0021",
+}
+
+@TechReport{EVL-1997-19,
+  author =       "Dieter Schmalstieg",
+  title =        "A Survey of Advanced Interactive 3-{D} Graphics
+                 Techniques",
+  type =         "Research paper",
+  institution =  "Institute of Computer Graphics, Vienna University of
+                 Technology",
+  year =         "1997",
+  abstract =     "Interactive 3-D Graphics are a new emerging field
+                 enabled by powerful and cost-effective computer
+                 systems. The goal is to present a three-dimensional
+                 image of a scene stored in a computer to give a human
+                 user the impression that he or she is looking at a
+                 virtual world. In producing such an illusion, we would
+                 like to always be able to produce images that match or
+                 exceed the limits of human visual perception in all
+                 aspects. Unfortunately, limitations in the performance
+                 of the image generators we employ for this task defeat
+                 this goal. The ever-increasing demands of applications
+                 make it unlikely that this situation will ever change
+                 significantly. Working solutions require us to trade
+                 off image fidelity for graphical complexity and
+                 performance of the application. In doing so, it is
+                 vital to understand those human factors that dominate
+                 the perception of interactive 3-D computer graphics.",
+  postscript-url = "ftp://ftp.cg.tuwien.ac.at/pub/TR/97/TR-186-2-97-05Paper.ps.gz",
+  evlib-url =    "http://infovis.zib.de:8000/Dienst/UI/2.0/Describe/evl.computergraphics%2FEVL-1997-19",
+  evlib-revision = "1st",
+  evlib-postscript-md5 = "7f854b51437fbc452dd968e6dfc5d18b",
+  who  = "Havran Vlastimil: REN-0022",
+}
+
+@Article{Woo:1990:SSA,
+  author =       "Andrew Woo and Pierre Poulin and Alain Fournier",
+  title =        "A Survey of Shadow Algorithms",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "10",
+  number =       "6",
+  pages =        "13--32",
+  month =        nov,
+  year =         "1990",
+  coden =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Alias Research, Toronto, Ont, Canada",
+  annote =       "Essential to realistic and visually appealing images,
+                 shadows are difficult to compute in most display
+                 environments. This survey characterizes the various
+                 types of shadows. It also describes most existing
+                 shadow algorithms and discusses their complexities,
+                 advantages, and shortcomings. We examine hard shadows,
+                 soft shadows, shadows of transparent objects, and
+                 shadows for complex modeling primitives. For each type,
+                 we examine shadow algorithms within various rendering
+                 techniques. \\ This survey attempts to provide readers
+                 with enough background and insight on the various
+                 methods to allow them to choose the algorithm best
+                 suited to their needs. We also hope that our analysis
+                 will help identify the areas that need more research
+                 and point to possible solutions.",
+  classification = "723; 741",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "Bidirectional Ray Tracing; Computer Graphics; Hard
+                 Shadow Generation; Image Processing; Image Rendering;
+                 Shadow Algorithms; Shadow Volumes; Soft Shadow
+                 Generation; survey",
+  who  = "Havran Vlastimil: REN-0023",
+}
+
+@InProceedings{Greenberg:1997:FRI,
+  author =       "Donald P. Greenberg and Kenneth E. Torrance and Peter
+                 Shirley and James Arvo and James A. Ferwerda and
+                 Sumanta Pattanaik and Eric P. F. Lafortune and Bruce
+                 Walter and Sing-Choong Foo and Ben Trumbore",
+  title =        "A Framework for Realistic Image Synthesis",
+  booktitle =    "SIGGRAPH 97 Conference Proceedings",
+  editor =       "Turner Whitted",
+  series =       "Annual Conference Series",
+  year =         "1997",
+  organization = "ACM SIGGRAPH",
+  publisher =    "Addison Wesley",
+  month =        aug,
+  pages =        "477--494",
+  note =         "ISBN 0-89791-896-7",
+  keywords =     "Realistic Image Synthesis, Light Reflection,
+                 Perception",
+  annote =       "Our goal is to develop physically based lighting
+                 models and perceptually based rendering procedures for
+                 computer graphics that will produce synthetic images
+                 that are visually and measurably indistinguishable from
+                 real-world images. Fidelity of the physical simulation
+                 is of primary concern. Our research framework is
+                 subdivided into three sub-sections: the local light
+                 reflection model, the energy transport simulation, and
+                 the visual display algorithms. The first two
+                 subsections are physically based, and the last is
+                 perceptually based. We emphasize the comparisons
+                 between simulations and actual measurements, the
+                 difficulties encountered, and the need to utilize the
+                 vast amount of psychophysical research already
+                 conducted. Future research directions are enumerated.
+                 We hope that results of this research will help
+                 establish a more fundamental, scientific approach for
+                 future rendering algorithms. This presentation
+                 describes a chronology of past research in global
+                 illumination and how parts of our new system are
+                 currently being developed.",
+  who  = "Havran Vlastimil: REN-0024",
+}
+
+
+@InProceedings{Stewart:1997:HVT,
+  author =       "A. James Stewart",
+  title =        "Hierarchical Visibility in Terrains",
+  booktitle =    "Proceedings of Eurographics Rendering Workshop '97",
+  year =         "1997",
+  pages =        "217--228",
+  annote =       "This paper describes a hierarchical visibility
+                 technique that significantly accelerates terrain
+                 rendering. With this technique, large parts of the
+                 terrain that are hidden from the viewpoint are culled,
+                 thus avoiding the expense of uselessly sending them
+                 down the graphics pipeline (only to find in the
+                 z-buffer step that they are hidden). The hierarchical
+                 visibility technique has been implemented in a
+                 multiresolution terrain rendering algorithm and
+                 experimental results show very large speedups in some
+                 situations.",
+  who  = "Havran Vlastimil: REN-0025",
+}
+
+@Article{Sillion:1997:EIM,
+  author =       "Francois Sillion and George Drettakis and Benoit
+                 Bodelet",
+  title =        "Efficient Impostor Manipulation for Real-Time
+                 Visualization of Urban Scenery",
+  journal =      "Com{\-}pu{\-}ter Graphics Forum",
+  volume =       "16",
+  number =       "3",
+  pages =        "C207--C218",
+  month =        sep # " 4--8",
+  year =         "1997",
+  coden =        "CGFODY",
+  ISSN =         "0167-7055",
+  bibdate =      "Tue Mar 17 15:44:38 MST 1998",
+  acknowledgement = ack-nhfb,
+  affiliation =  "INRIA",
+  affiliationaddress = "Grenoble, Fr",
+  classification = "722.4; 723; 723.2; 723.3; 723.5",
+  journalabr =   "Comput Graphics Forum",
+  keywords =     "Algorithms; Computer simulation; Database systems;
+                 Image segmentation; Interactive computer systems;
+                 Interactive visualization systems; Real time systems;
+                 Three dimensional computer graphics; Urban scenes;
+                 Virtual reality; Visualization",
+  who  = "Havran Vlastimil: REN-0026",
+}
+
+@InProceedings{Schaufler:1997:NRP,
+  author =       "Gernot Schaufler",
+  title =        "Nailboards: {A} Rendering Primitive for Image Caching
+                 in Dynamic Scenes",
+  booktitle =    "Eurographics Rendering Workshop 1997",
+  editor =       "Julie Dorsey and Philipp Slusallek",
+  year =         "1997",
+  organization = "Eurographics",
+  publisher =    "Springer Wein",
+  address =      "New York City, NY",
+  month =        jun,
+  pages =        "151--162",
+  note =         "ISBN 3-211-83001-4",
+  annote =       "This paper proposes a simple augmentation to texture
+                 mapping hardware which produces the correct depth
+                 buffer content and hence correct visibility when
+                 replacing complex objects by partially transparent
+                 textured polygons. Rendering such polygons exploits
+                 frame-to-frame coherence in image sequences of dynamic
+                 scenes. Correct depth values are obtained by keeping a
+                 small depth delta for every texel which represents the
+                 texel's deviation from the textured polygon. The
+                 polygon's depth values are modified at every pixel to
+                 match the depicted object's geometry.",
+  who  = "Havran Vlastimil: REN-0027",
+}
+
+@InProceedings{Bishop:1994:FRD,
+  author =       "Gary Bishop and Henry Fuchs and Leonard Mc{M}illan and
+                 Ellen J. {Scher Zagier}",
+  editor =       "Andrew Glassner",
+  booktitle =    "Proceedings of SIGGRAPH '94 (Orlando, Florida, July
+                 24--29, 1994)",
+  title =        "Frameless Rendering: Double Buffering Considered
+                 Harmful",
+  organization = "ACM SIGGRAPH",
+  publisher =    "ACM Press",
+  pages =        "175--176",
+  month =        jul,
+  year =         "1994",
+  note =         "ISBN 0-89791-667-0",
+  series =       "Computer Graphics Proceedings, Annual Conference
+                 Series",
+  who  = "Havran Vlastimil: REN-0028",
+}
+
+@InProceedings{kajiya86a,
+  author =       "J. T. Kajiya",
+  title =        "The Rendering Equation",
+  pages =        "143--150",
+  booktitle =      "Computer Graphics (SIGGRAPH '86 Proceedings)",
+  year =         "1986",
+  month =        aug,
+  conference =   "held in Dallas, Texas, August 18--22, 1986",
+  keywords =     "I37 rendering, I37 ray tracing, I37 radiosity,
+                 shading, diffuse reflection, radiosity",
+  annote =       "We present an integral equation which generalizes a
+                 variety of known rendering algorithms. In the course of
+                 discussing a Monte Carlo solution a new form of
+                 variance reduction is presented, called hierarchical
+                 sampling, and a number of elaborations are given that
+                 show that it may be an efficient new technique for a
+                 wide variety of Monte Carlo procedures. The resulting
+                 rendering algorithm extends the range of optical
+                 phenomena which can be effectively simulated.",
+  who  = "Havran Vlastimil: REN-0029",
+}
+
+@inproceedings{CDRLSS-gi96,
+  title     = "Fast rendering of complex environments using a spatial hierarchy",
+  author    = "Bradford Chamberlain and Tony DeRose and Dani Lischinski and
+               David Salesin and John Snyder",
+  booktitle = "Graphics Interface",
+  year      = "1996",
+  month     = "May",
+  pages     = "132--141",
+  who  = "Havran Vlastimil: REN-0030",
+}
+
+@InProceedings{sillion89a,
+  author =       "Francois Sillion and Claude Puech",
+  title =        "A General Two-Pass Method Integrating Specular and
+                 Diffuse Reflection",
+  pages =        "335--344",
+  booktitle =      "Computer Graphics (SIGGRAPH '89 Proceedings)",
+  volume =       "23",
+  number =       "3",
+  year =         "1989",
+  month =        jul,
+  editor =       "Jeffrey Lane",
+  conference =   "held in Boston, Massachusetts; 31 July -- 4 August
+                 1989",
+  keywords =     "radiosity, interreflection, two-pass method, extended
+                 form factors, z-buffer, progressive refinement, global
+                 illumination, ray tracing",
+  annote =       "We analyze some recent approaches to the global
+                 illumination problem by introducing the corresponding
+                 {\em reflection operators}, and we demonstrate the
+                 advantages of a two-pass method. A generalization of
+                 this system introduced by Wallace {\em et al}.\ at
+                 Siggraph '87 to integrate diffuse as well as specular
+                 reflection is presented. It is based on the calculation
+                 of {\em extended form-factors}, which allows arbitrary
+                 geometries to be used in the scene description, as well
+                 as refraction effects. We also present a new sampling
+                 method for the calculation of form-factors, which is an
+                 alternative to the {\em hemi-cube} technique introduced
+                 by Cohen and Greenberg for radiosity calculations. This
+                 method is particularly well suited to the extended
+                 form-factors calculation. The problem of interactive
+                 display of the picture being created is also addressed
+                 by using hardware-assisted projections and image
+                 composition to recreate a complete specular view of the
+                 scene.",
+  who  = "Havran Vlastimil: REN-0031",
+}
+
+@Article{Gibson:1996:EHR,
+  author =       "S. Gibson and R. J. Hubbold",
+  title =        "Efficient Hierarchical Refinement and Clustering for
+                 Radiosity in Complex Environments",
+  journal =      "Computer Graphics Forum",
+  year =         "1996",
+  volume =       "15",
+  number =       "5",
+  pages =        "297--310",
+  note =         "ISSN 0167-7055",
+  keywords =     "radiosity, hierarchical radiosity, error bounds,
+                 clustering",
+  annote =       "Generating accurate radiosity solutions of very
+                 complex environments is a time-consuming problem. We
+                 present a rapid hierarchical algorithm that enables
+                 such solutions to be computed quickly and efficiently.
+                 Firstly, a new technique for bouncing the error in the
+                 transfer of radiosity between surfaces is discussed,
+                 incorporating bounds on form factors, visibility,
+                 irradiance, and reflectance over textured surfaces.
+                 This technique is then applied to the problem of
+                 bounding radiosity transfer between clusters of
+                 surfaces, leading to a fast, practical clustering
+                 algorithm that builds on the previous work of Sillion.
+                 Volumes are used to represent clusters of small
+                 surfaces, but unlike previous algorithms, the
+                 orientations of surfaces inside each cluster are
+                 accounted for in both the error bound and radiosity
+                 transfer. This enables an accurate solution to be
+                 generated very efficiently, and results are presented
+                 demonstrating the performance of the algorithm on a
+                 variety of complex models, one containing almost a
+                 quarter of a million initial surfaces.",
+  who  = "Havran Vlastimil: REN-0032",
+}
+
+@InProceedings{Smits:1994:CAR,
+  author =       "Brian Smits and James Arvo and Donald Greenberg",
+  editor =       "Andrew Glassner",
+  booktitle =    "Proceedings of SIGGRAPH '94 (Orlando, Florida, July
+                 24--29, 1994)",
+  title =        "A Clustering Algorithm for Radiosity in Complex
+                 Environments",
+  organization = "ACM SIGGRAPH",
+  publisher =    "ACM Press",
+  pages =        "435--442",
+  month =        jul,
+  year =         "1994",
+  note =         "ISBN 0-89791-667-0",
+  series =       "Computer Graphics Proceedings, Annual Conference
+                 Series",
+  who  = "Havran Vlastimil: REN-0033",
+}
+
+@InProceedings{Jensen95-EFSPM,
+  author =       "Henrik Wann Jensen and Niels J. Christensen",
+  editor =       "Harold P. Santo",
+  month =        dec # " 12,",
+  year =         "1995",
+  title =        "Efficiently {Rendering} {Shadows} {Using} the {Photon}
+                 {Map}",
+  booktitle =    "Edugraphics + Compugraphics Proceedings",
+  pages =        "285--291",
+  publisher =    "GRASP- Graphic Science Promotions \& Publications",
+  address =      "P.O. Box 4076, Massama, 2745 Queluz, Portugal",
+  comments =     "ISBN 972-8342-00-4",
+  who  = "Havran Vlastimil: REN-0034",
+}
+
+@InProceedings{Huerta97,
+  author =       "Joaquin Huerta and  Miguel Chover and Jose Ribelles
+                  and Ricardo Quiros",
+  editor =       "Harold P. Santo",
+  month =        dec # " 15,",
+  year =         "1997",
+  title =        "Constructing and Rendering of Multiresolution Binary Space
+                  Partitioning Trees",
+  booktitle =    "Edugraphics + Compugraphics Proceedings",
+  pages =        "212--221",
+  publisher =    "GRASP- Graphic Science Promotions \& Publications",
+  address =      "P.O. Box 4076, Massama, 2745 Queluz, Portugal",
+  who  = "Havran Vlastimil: REN-0035",
+}
+
+@InProceedings{Teller:1994:POL,
+  author =       "Seth Teller and Celeste Fowler and Thomas Funkhouser
+                 and Pat Hanrahan",
+  editor =       "Andrew Glassner",
+  booktitle =    "Proceedings of SIGGRAPH '94 (Orlando, Florida, July
+                 24--29, 1994)",
+  title =        "Partitioning and Ordering Large Radiosity
+                 Computations",
+  organization = "ACM SIGGRAPH",
+  publisher =    "ACM Press",
+  pages =        "443--450",
+  month =        jul,
+  year =         "1994",
+  note =         "ISBN 0-89791-667-0",
+  series =       "Computer Graphics Proceedings, Annual Conference
+                 Series",
+  who  = "Havran Vlastimil: REN-0036",
+}
+
+@InProceedings{EVL-1997-128,
+  author =       "Eric Veach and Leonidas J. Guibas",
+  editor =       "Turner Whitted",
+  title =        "Metropolis Light Transport",
+  booktitle =    "SIGGRAPH 97 Conference Proceedings",
+  series =       "Annual Conference Series",
+  pages =        "65--76",
+  publisher =    "Addison Wesley",
+  month =        aug,
+  year =         "1997",
+  keywords =     "global illumination, lighting simulation, radiative
+                 heat transfer, physically-based rendering, Monte Carlo
+                 integration, variance reduction, Metropolis-Hastings
+                 algorithm, Markov Chain Monte Carlo (MCMC) methods",
+  language =     "en",
+  abstract =     "We present a new Monte Carlo method for solving the
+                 light transport problem, inspired by the Metropolis
+                 sampling method in computational physics. To render an
+                 image, we generate a sequence of light transport paths
+                 by randomly mutating a single current path (e.g. adding
+                 a new vertex to the path). Each mutation is accepted or
+                 rejected with a carefully chosen probability, to ensure
+                 that paths are sampled according to the contribution
+                 they make to the ideal image. We then estimate this
+                 image by sampling many paths, and recording their
+                 locations on the image plane. Our algorithm is
+                 unbiased, handles general geometric and scattering
+                 models, uses little storage, and can be orders of
+                 magnitude more efficient than previous unbiased
+                 approaches. It performs especially well on problems
+                 that are usually considered difficult, e.g. those
+                 involving bright indirect light, small geometric holes,
+                 or glossy surfaces. Furthermore, it is competitive with
+                 previous unbiased algorithms even for relatively simple
+                 scenes. The key advantage of the Metropolis approach is
+                 that the path space is explored locally, by favoring
+                 mutations that make small changes to the current path.
+                 This has several consequences. First, the average cost
+                 per sample is small (typically only one or two rays).
+                 Second, once an important path is found, the nearby
+                 paths are explored as well, thus amortizing the expense
+                 of finding such paths over many samples. Third, the
+                 mutation set is easily extended. By constructing
+                 mutations that preserve certain properties of the path
+                 (e.g. which light source is used) while changing
+                 others, we can exploit various kinds of coherence in
+                 the scene. It is often possible to handle difficult
+                 lighting problems efficiently by designing a
+                 specialized mutation in this way.",
+  note =         "ISBN 0-89791-896-7",
+  evlib-url =    "http://visinfo.zib.de:80/Dienst/UI/2.0/Describe/evl.computergraphics%2FEVL-1997-128",
+  evlib-revision = "1st",
+  organization = "ACM SIGGRAPH",
+  who  = "Havran Vlastimil: REN-0037",
+}
+
+@InProceedings{Jensen:1996:GIU,
+  author =       "Henrik Wann Jensen",
+  title =        "Global Illumination using Photon Maps",
+  booktitle =    "Eurographics Rendering Workshop 1996",
+  editor =       "Xavier Pueyo and Peter Schr{\"{o}}der",
+  year =         "1996",
+  organization = "Eurographics",
+  publisher =    "Springer Wein",
+  address =      "New York City, NY",
+  month =        jun,
+  pages =        "21--30",
+  note =         "ISBN 3-211-82883-4",
+  keywords =     "Global Illumination, Photon Maps, Filtering, Monte
+                 Carlo Ray Tracing",
+  annote =       "This paper presents a two pass global illumination
+                 method based on the concept of photon maps. It
+                 represents a significant improvement of a previously
+                 described approach both with respect to speed, accuracy
+                 and versatility. In the first pass two photon maps are
+                 created by emitting packets of energy (photons) from
+                 the light sources and storing these as they hit
+                 surfaces within the scene. We use one high resolution
+                 caustics photon map to render caustics that are
+                 visualized directly and one low resolution photon map
+                 that is used during the rendering step. The scene is
+                 rendered using a distribution ray tracing algorithm
+                 optimized by using the information in the photon maps.
+                 Shadow photons are used to render shadows more
+                 efficiently and the directional information in the
+                 photon map is used to generate more optimal sampling
+                 directions and to limit the recursion in the
+                 distribution ray tracer by providing an estimate of the
+                 radiance on all surfaces with the exception of specular
+                 and highly glossy surfaces. Noise and blur at
+                 discontinuities in the radiance estimate is reduced by
+                 using a cone filter. The results presented demonstrate
+                 global illumination in scenes containing procedural
+                 objects and surfaces with diffuse and glossy reflection
+                 models. The implementation is also compared with the
+                 Radiance program.",
+  who  = "Havran Vlastimil: REN-0038",
+}
+
+@InProceedings{Jansen94a,
+   author = "E. Reinhard and Lucas U. Tijssen and Frederik W. Jansen",
+   title = "Environment Mapping for Efficient Sampling of the Diffuse Interreflection",
+   year = 1994,
+   booktitle =  "Proc. of 5th Eurographics Workshop on Rendering 1994",
+   pages = "401--404",
+   who = "Havran Vlastimil: REN-0039",
+}
+
+@inproceedings{McCoolHarwood-gi97,
+  title     = "Probability trees",
+  author    = "Michael D. McCool and Peter K. Harwood",
+  booktitle = "Graphics Interface '97",
+  year      = "1997",
+  month     = "May",
+  pages     = "37--46",
+  who  = "Havran Vlastimil: REN-0040",
+}
+
+@inproceedings{MFC-gi97,
+  title     = "Multiresolution rendering of complex botanical scenes",
+  author    = "Dana Marshall and Donald S. Fussell and A.T. Campbell,~III",
+  booktitle = "Graphics Interface '97",
+  year      = "1997",
+  month     = "May",
+  pages     = "97--104",
+  who  = "Havran Vlastimil: REN-0041",
+}
+
+@Misc{Fortune,
+  author = "Steven Fortune",
+  title = "A Beam-Tracing Algorithm for Prediction of Indoor Radio Propagation",
+  year = "19??",
+  month = "??",
+  pages = "10",
+  who  = "Havran Vlastimil: REN-0042",
+}
+
+@PhdThesis{Arvo95-AMSLT,
+  author =       "James Arvo",
+  month =        dec,
+  year =         "1995",
+  title =        "Analytic {Methods} for {Simulated} {Light}
+                 {Transport}",
+  institution =  "Yale University",
+  type =         "Ph.{D}. thesis",
+  who  = "Havran Vlastimil: REN-0043",
+}
+
+
+@Article{Wilhelms:1991:CPA,
+  author =       "Jane Wilhelms and Allen Van Gelder",
+  editor =       "Thomas W. Sederberg",
+  title =        "A coherent projection approach for direct volume
+                 rendering",
+  journal =      "Computer Graphics",
+  volume =       "25",
+  number =       "4",
+  pages =        "275--284",
+  month =        jul,
+  year =         "1991",
+  coden =        "CGRADI, CPGPBZ",
+  ISSN =         "0097-8930",
+  conference =   "held in Las Vegas, Nevada; 28 July -- 2 August 1991",
+  who  = "Havran Vlastimil: REN-0044",
+}
+
+@Article{Levoy:1990:VRA,
+  author =       "Marc Levoy",
+  title =        "Volume Rendering by Adaptive Refinement",
+  journal =      "The Visual Computer",
+  pages =        "2--7",
+  volume =       "6",
+  number =       "1",
+  month =        feb,
+  year =         "1990",
+  keywords =     "volume rendering, voxel, adaptive refinement, adaptive
+                 sampling, ray tracing",
+  annote =       "{\em Volume rendering} is a technique for visualizing
+                 sampled scalar functions of three spatial dimensions by
+                 computing 2D projections of a colored semi-transparent
+                 gel. This paper presents a volume-rendering algorithm,
+                 in which imge quality is adaptively refined over time.
+                 An initial image is generated by casting a small number
+                 of rays into the data, less than one ray per pixel, and
+                 interpolating between the resulting colors. Subsequent
+                 images are generated by alternately casting more rays
+                 and interpolating. The usefulness of these rays is
+                 maximized by distributing them according to measures of
+                 loal image complexity. Examples from two applications
+                 are given: molecular graphics and medical imaging.",
+  who  = "Havran Vlastimil: REN-0045",
+}
+
+@Article{Hsu:1995:SDA,
+  author =       "Siu-Chi Hsu and Tien-Tsin Wong",
+  title =        "Simulating Dust Accumulation",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "15",
+  number =       "1",
+  pages =        "18--22",
+  month =        jan,
+  year =         "1995",
+  coden =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Chinese Univ. of Hong Kong, Shatin, Hong Kong",
+  classification = "451.1; 723.5; 921.6; 931.2",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "Approximation theory; Computer graphics; Computer
+                 simulation; Dust; Dust accumulation; Image analysis;
+                 Interpolation; Mathematical models; Natural sciences
+                 computing; Ray tracing; Rendering; Scraping effects;
+                 Surface exposure; Surface properties; Surfaces;
+                 Textures",
+  who  = "Havran Vlastimil: REN-0046",
+}
+
+
+@Article{Rushmeier:1995:VRP,
+  author =       "Holly Rushmeier and Anthony Hamins and Mun Young
+                 Choi",
+  title =        "Volume rendering of pool fire data",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "15",
+  number =       "4",
+  pages =        "62--67",
+  month =        jul,
+  year =         "1995",
+  coden =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Natl Inst of Standards and Technology",
+  affiliationaddress = "Gaithersburg, MD, USA",
+  classification = "723.5; 914.2; 921.2; 921.6",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "Calculations; Computer graphics; Fires; Imaging
+                 techniques; Integration; Line integration; Mathematical
+                 models; Pool fires; Radiation effects; Ray casting; Two
+                 dimensional; Visualization; Volume rendering",
+  who  = "Havran Vlastimil: REN-0047",		 
+}
+
+
+@Article{Woo:1996:IRR,
+  author =       "Andrew Woo and Andrew Pearce and Marc Ouellette",
+  title =        "It's really not a rendering bug, you see.",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "16",
+  number =       "5",
+  pages =        "21--25",
+  month =        sep,
+  year =         "1996",
+  coden =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Alias-Wavefront, Toronto, Ont., Canada",
+  classification = "721.1; 723.1; 723.5; 741.1; 921.4; 921.6",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "Algorithms; Approximation theory; Color computer
+                 graphics; Computational geometry; Computational
+                 methods; Computer graphics; Convergence of numerical
+                 methods; Digital arithmetic; Errors; Gouraud shading;
+                 Image artifacts; Interpolation; Light reflection;
+                 Lighting; Liner interpolation; Mirror reflection;
+                 Mirrors; Numerical instability; Phong shading; Planar
+                 equation; Polygons; Program debugging; Ray plane
+                 intersection equation; Ray tracing; Rendering
+                 artifacts; Shadowing; Texture mapping; Three
+                 dimensional computer graphics; Visibility",
+  who  = "Havran Vlastimil: REN-0048",
+}
+
+@InProceedings{Nechvile:1996:FFE,
+  author =       "K. Nechvile and J. Sochor",
+  title =        "Form-factor Evaluation with Regional {BSP} Trees",
+  booktitle =    "Winter School of Computer Graphics 1996", 
+  year =         "1996",
+  month =        feb,
+  note =         "held at University of West Bohemia, Plzen, Czech
+                 Republic, 12-16 February 1996",
+  who  = "Havran Vlastimil: REN-0049",
+}
+
+@InProceedings{Campbell:1990:AMG,
+  author =       "A. T. {Campbell, III} and Donald S. Fussell",
+  title =        "Adaptive Mesh Generation for Global Diffuse
+                 Illumination",
+  year =         "1990",
+  month =        aug,
+  volume =       "24",
+  booktitle =    "Computer Graphics (SIGGRAPH '90 Proceedings)",
+  pages =        "155--164",
+  keywords =     "BSP tree",
+  who  = "Havran Vlastimil: REN-0050",
+}
+
+@Article{Noordmans:1997:FVR,
+  author =       "H. J. Noordmans and A. W. M. Smeulders and H. T. M.
+                 {van der Voort}",
+  title =        "Fast volume render techniques for interactive
+                 analysis",
+  journal =      "The Visual Computer",
+  year =         "1997",
+  volume =       "13",
+  number =       "8",
+  pages =        "345--358",
+  publisher =    "Springer-Verlag",
+  note =         "ISSN 0178-2789",
+  keywords =     "volume rendering, interaction, successive adaptive
+                 refinement, confocal microscopy",
+  annote =       "Without graphics hardware, interactive volume
+                 rendering is almost impossible with the current
+                 generation of computers and software. We describe the
+                 implementation of a volume renderer for interactive
+                 analysis of confocal images. We propose several
+                 techniques to accelerate the rendering of grey-value
+                 volumes. We propose to illuminate the volume
+                 selectively with ray templates to get a proper shadow
+                 cue in the shortest feasible time. In the viewing
+                 phase, rendering is distinctively accelerated for four
+                 user interactions: (1) a total change by successive
+                 adaptive refinement, (2) an unknown change in the view
+                 with this refinement strategy combined with suspended
+                 interpolation, (3) a known change in the view by
+                 recalculating only that part and (4) a view translation
+                 by recalculating the uncovered part.",
+  who  = "Havran Vlastimil: REN-0051",
+}
+
+@Article{lischinski92a,
+      author =       "Dani Lischinski and Filippo Tampieri and Donald P.
+                     Greenberg",
+      title =        "Discontinuity meshing for accurate radiosity",
+      journal =      "IEEE Computer Graphics and Applications",
+      pages =        "25--39",
+      volume =       "12",
+      number =       "6",
+      month =        nov,
+      year =         "1992",
+      keywords =     "shadow, illumination, bsp, adaptive subdivision",
+      annote =       "This object-space algorithm accurately produces the
+                     radiance across a surface. Used in
+                     progressive-refinement radiosity system, it greatly
+                     improves the photorealism of diffuse global
+                     illumination solutions.",
+  who  = "Havran Vlastimil: REN-0052",
+}
+
+
+@Article{tvcg-1995-19,
+  author =       "Francois X. Sillion",
+  email =        "francois.sillion@imag.fr",
+  title =        "{A Unified Hierarchical Algorithm for Global
+                 Illumination with Scattering Volumes and Object
+                 Clusters}",
+  journal =      "IEEE Transactions on Visualization and Computer
+                 Graphics",
+  volume =       "1",
+  number =       "3",
+  month =        sep,
+  year =         "1995",
+  pages =        "240--254",
+  abstract =     "This paper presents a new radiosity algorithm that
+                 allows the simultaneous computation of energy exchanges
+                 between surface elements, scattering volume
+                 distributions, and groups of surfaces, or object
+                 clusters. The new technique is based on a hierarchical
+                 formulation of the zonal method, and efficiently
+                 integrates volumes and surfaces. In particular no
+                 initial linking stage is needed, even for inhomogeneous
+                 volumes, thanks to the construction of a global spatial
+                 hierarchy. An analogy between object clusters and
+                 scattering volumes results in a powerful clustering
+                 radiosity algorithm, with no initial linking between
+                 surfaces and fast computation of average visibility
+                 information through a cluster. We show that the
+                 accurate distribution of the energy emitted or received
+                 at the cluster level can produce even better results
+                 than isotropic clustering at a marginal cost. The
+                 resulting algorithm is fast and, more importantly,
+                 truly progressive as it allows the quick calculation of
+                 approximate solutions with a smooth convergence towards
+                 very accurate simulations.",
+  keywords =     "Radiosity, hierarchical techniques, clustering,
+                 visibility, volume scattering, lighting simulation,
+                 realistic image synthesis",
+  tvcg-abstract-url = "http://www.computer.org/tvcg/tg1995/v0240abs.htm",
+  who  = "Havran Vlastimil: REN-0053",
+}
+
+@Article{tvcg-1997-25,
+  author =       "Paul Lalonde and Alain Fournier",
+  title =        "{A Wavelet Representation of Reflectance Functions}",
+  journal =      "IEEE Transactions on Visualization and Computer
+                 Graphics",
+  volume =       "3",
+  number =       "4",
+  month =        oct,
+  year =         "1997",
+  pages =        "329--336",
+  abstract =     "Analytical models of light reflection are in common
+                 use in computer graphics. However, models based on
+                 measured reflectance data promise increased realism by
+                 making it possible to simulate many more types of
+                 surfaces to a greater level of accuracy than with
+                 analytical models. They also require less expert
+                 knowledge about the illumination models and their
+                 parameters. There are a number of hurdles to using
+                 measured reflectance functions, however. The data sets
+                 are very large. A reflectance distribution function
+                 sampled at five degrees angular resolution, arguably
+                 sparse enough to miss highlights and other high
+                 frequency effects, can easily require over a million
+                 samples, which in turn amount to over four megabytes of
+                 data. These data then also require some form of
+                 interpolation and filtering to be used effectively. In
+                 this paper, we examine issues of representation of
+                 measured reflectance distribution functions. In
+                 particular, we examine a wavelet basis representation
+                 of reflectance functions, and the algorithms required
+                 for efficient point-wise reconstruction of the BRDF. We
+                 show that the nonstandard wavelet decomposition leads
+                 to considerably more efficient algorithms than the
+                 standard wavelet decomposition. We also show that
+                 thresholding allows considerable improvement in running
+                 times, without unduly sacrificing image quality.",
+  keywords =     "reflectance models, bidirectional reflectance,
+                 distribution functions, local shading, local
+                 illumination, wavelets, compression",
+  tvcg-abstract-url = "http://www.computer.org/tvcg/tg1997/v0329abs.htm",
+  tvcg-pdf-url = "http://pdf.computer.org/tg/books/tg1997/pdf/v0329.pdf",
+  who  = "Havran Vlastimil: REN-0054",
+}
+
+@InProceedings{Shade:1996:HIC,
+  author =       "Jonathan Shade and Dani Lischinski and David Salesin
+                 and Tony {DeRose} and John Snyder",
+  title =        "Hierarchical Image Caching for Accelerated
+                 Walkthroughs of Complex Environments",
+  pages =        "75--82",
+  booktitle =    "Computer Graphics (Proceedings of SIGGRAPH '96)",
+  year =         "1996",
+  publisher =    "ACM SIGGRAPH/Addison Wesley",
+  month =        aug,
+  abstract =     "We present a new method that utilizes path coherence
+                 to accelerate walkthroughs of geometrically complex
+                 static scenes. As a preprocessing step, our method
+                 constructs a BSP-tree that hierarchically partitions
+                 the geometric primitives in the scene. In the course of
+                 a walkthrough, images of nodes at various levels of the
+                 hierarchy are cached for reuse in subsequent frames. A
+                 cached image is reused by texture-mapping it onto a
+                 single quadrilateral that is drawn instead of the
+                 geometry contained in the corresponding node. Visual
+                 artifacts are kept under control by using an error
+                 metric that quantifies the discrepancy between the
+                 appearance of the geometry contained in a node and the
+                 cached image. The new method is shown to achieve
+                 speedups of an order of magnitude for walkthroughs of a
+                 complex outdoor scene, with little or no loss in
+                 rendering quality.",
+  who  = "Havran Vlastimil: REN-0055",
+}
+
+@Article{tvcg-1996-22,
+  author =       "Daniel Cohen-Or and Eran Rich and Uri Lerner and
+                 Victor Shenkar",
+  email =        "daniel@math.tau.ac.il and none and none and none",
+  title =        "{A Real-Time Photo-Realistic Visual Flythrough}",
+  journal =      "IEEE Transactions on Visualization and Computer
+                 Graphics",
+  volume =       "2",
+  number =       "3",
+  month =        sep,
+  year =         "1996",
+  pages =        "255--264",
+  abstract =     "In this paper we present a comprehensive flythrough
+                 system which generates photo-realistic images in true
+                 real-time. The high performance is due to an innovative
+                 rendering algorithm based on a discrete ray casting
+                 approach, accelerated by ray coherence and
+                 multiresolution traversal. The terrain as well as the
+                 3D objects are represented by a textured mapped
+                 voxel-based model. The system is based on a pure
+                 software algorithm and is thus portable. It was first
+                 implemented on a workstation and then ported to a
+                 general-purpose parallel architecture to achieve
+                 real-time performance.",
+  keywords =     "Terrain visualization, parallel rendering, flight
+                 simulator, visual simulations, voxel-based modeling,
+                 ray casting",
+  tvcg-abstract-url = "http://www.computer.org/tvcg/tg1996/v0255abs.htm",
+  who  = "Havran Vlastimil: REN-0056",
+}
+
+@InProceedings{hanrahan90b,
+  author =       "Pat Hanrahan and Jim Lawson",
+  title =        "A Language for Shading and Lighting Calculations",
+  pages =        "289--298",
+  booktitle =      "Computer Graphics (SIGGRAPH '90 Proceedings)",
+  volume =       "24",
+  number =       "4",
+  year =         "1990",
+  month =        aug,
+  editor =       "Forest Baskett",
+  conference =   "held in Dallas, Texas; 6-10 August 1990",
+  keywords =     "shading language, little language, illumination,
+                 lighting, rendering",
+  who  = "Havran Vlastimil: REN-0057",
+}
+
+@InProceedings{Schroder:1993:FFB,
+  author =       "Peter Schr{\"{o}}der and Pat Hanrahan",
+  booktitle =    "Computer Graphics (Proceedings of SIGGRAPH '93)",
+  title =        "On the Form Factor Between Two Polygons",
+  pages =        "163--164",
+  year =         "1993",
+  keywords =     "Radiosity, Engineering, Closed form solution, form
+                 factor, polygons",
+  annote =       "Form factors are used in radiosity to describe the
+                 fraction of diffusely re ected light leaving one
+                 surface and arriving at another. They are a fundamental
+                 geometric property used for computation. Many special
+                 configurations admit closed form solutions. However,
+                 the important case of the form factor between two
+                 polygons in three space has had no known closed form
+                 solution. We give such a solution for the case of
+                 general (planar, convex or concave, possibly containing
+                 holes) polygons.",
+  who  = "Havran Vlastimil: REN-0058",		 
+}
+
+
+@Article{Kaufman:1993:VG,
+  author =       "Arie Kaufman and Daniel Cohen and Roni Yagel",
+  title =        "Volume Graphics",
+  journal =      "Computer",
+  volume =       "26",
+  number =       "7",
+  pages =        "51--64",
+  month =        jul,
+  year =         "1993",
+  coden =        "CPTRB4",
+  ISSN =         "0018-9162",
+  bibdate =      "Sat Feb 1 16:21:14 MST 1997",
+  abstract =     "Just as 2D raster graphics superseded vector graphics,
+                 volume graphics has the potential to supersede surface
+                 graphics for 3D geometric scene representation,
+                 manipulation, and rendering.",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Dept. of Comput. Sci., State Univ. of New York, Stony
+                 Brook, NY, USA",
+  classification = "723.2; C4260 (Computational geometry); C6130B
+                 (Graphics techniques)",
+  journalabr =   "Computer",
+  keywords =     "3D scene representation; Block operations;
+                 Constructive solid geometry modeling; Discreteness;
+                 Geometric objects; Hierarchical representation; Imaging
+                 techniques; Interactive computer graphics; Internal
+                 structures; Irregular voxel sizes; Memory size;
+                 Processing time; Sampled data sets; Simulated data
+                 sets; Three dimensional computer graphics; Viewpoint
+                 independence; Volume buffer; Volume data sets; Volume
+                 graphics; Volume visualization",
+  thesaurus =    "Computational geometry; Data visualisation; Solid
+                 modelling",
+  who  = "Havran Vlastimil: REN-0059",
+}
+
+@TechReport{Heckbert97shadow,
+  author =       "Paul S. Heckbert and Michael Herf",
+  title =        "Simulating Soft Shadows with Graphics Hardware",
+  institution =  "CS Dept., Carnegie Mellon U.",
+  month =        jan,
+  year =         "1997",
+  note =         "CMU-CS-97-104, http://www.cs.cmu.edu/~ph",
+  keywords =     "penumbra, texture mapping, graphics workstation,
+                 interaction, real-time, SGI Reality Engine",
+ who  = "Havran Vlastimil: REN-0060",
+}
+
+@InProceedings{Novins:1990:EMV,
+  author =       "Kevin L. Novins and Francois X. Sillion and Donald P.
+                 Greenberg",
+  title =        "An Efficient Method for Volume Rendering using
+                 Perspective Projection",
+  pages =        "95--102",
+  booktitle =    "Computer Graphics (San Diego Workshop on Volume
+                 Visualization)",
+  volume =       "24",
+  number =       "5",
+  year =         "1990",
+  month =        nov,
+  conference =   "held in San Diego, California; 10-11 December 1990",
+  keywords =     "volume visualization, volume rendering, scientific
+                 visualization, ray tracing, perspective projection,
+                 depth of field",
+  annote =       "Use of the perspective projection adds important
+                 perceptual cues for image comprehension. However, it
+                 has not been widely used in volume rendering because of
+                 the lack of efficient computational algorithms and
+                 concern over the nonuniform sampling rate imposed by
+                 perspective ray divergence. This paper introduces two
+                 new techniques to help make perspective projection more
+                 feasible in rendering volume data. First, a method is
+                 presented for efficient slice-by-slice processing of
+                 volume data, allowing high resolution data sets by
+                 eliminating typical memory constraints. Second, an
+                 adaptive ``ray splitting'' approach is described which
+                 ensures that the entire volume is sampled within
+                 user-specified limits. Additionally, we present results
+                 using distributed ray tracing to achieve depth of field
+                 effects.",
+ who  = "Havran Vlastimil: REN-0061",
+}
+
+@InProceedings{shirley94cn,
+  author = "P. Shirley",
+  title = "Hybrid Radiosity/Monte Carlo Methods",
+  pages =        "??-??",
+  booktitle =    "SIGGRAPH'94 (Advanced Radiosity Course Notes)",
+  volume =       "28",
+  year =         "1994",
+  month =        jul,
+  who  = "Havran Vlastimil: REN-0062",  
+}
+
+@InProceedings{Kok:1994:SSD,
+      author =       "Arjan J. F. Kok and Frederik Jansen",
+      booktitle =    "Photorealistic Rendering in Computer Graphics
+		     (Proceedings of the Second Eurographics Workshop on
+		     Rendering)",
+      title =        "Source Selection for the Direct Lighting Computation
+		     in Global Illumination",
+      publisher =    "Springer-Verlag",
+      address =      "New York",
+      pages =        "75--82",
+      year =         "1994",
+      keywords =     "adaptive subdivision, ray tracing",
+      bibsource =    "sig-11-1994",
+      who  	= "Havran Vlastimil: REN-0063",
+}
+
+@InProceedings{Wiley97,
+  author= "Wiley C and Campbell A and Szygenda S and Fussel D and Hudson F",
+  title = "Multiresolution BSP Trees",
+  booktitle = "Graphics Interface 97",
+  year  = "1997",
+  pages = "??-??",
+  note  = "University of Texas",
+  who  	= "Havran Vlastimil: REN-0064",
+}
+
+@InProceedings{shirley94pg,
+  author = "P. Shirley",
+  title = "Practitioners' Assessment of Light Reflection Models",
+  pages =        "??-??",
+  booktitle =    "Pacific Graphics'97",
+  volume =       "??",
+  year =         "1997",
+  month =        oct,
+  who  = "Havran Vlastimil: REN-0065",  
+}
+
+@inproceedings{sbert:cgi:98,
+  author = "M. Sbert",
+  title = "Random Walk Radiosity with generalized absorption probabilities",
+  booktitle = "Proceedings of Computer Graphics International '98 (CGI'98)",
+  year = "1998",
+  month = jun,
+  pages = "658--665",
+  address = "Hannover, Germany",
+  publisher = "IEEE, NY",
+  who = "Havran Vlastimil: REN-0066",
+}
+
+@inproceedings{neumann:cgi:98,
+  author = "L. Neumann",
+  title = "Automatic Exposure in Computer Graphics Based on the Minimum
+           Information Loss Principle",
+  booktitle = "Proceedings of Computer Graphics International '98 (CGI'98)",
+  year = "1998",
+  month = jun,
+  pages = "666-677",
+  address = "Hannover, Germany",
+  publisher = "IEEE, NY",
+  who = "Havran Vlastimil: REN-0067",
+}
+
+@inproceedings{SS98,
+        author = "Cyril Soler and Fran\c{c}ois Sillion",
+        title = "Fast Calculation of Soft Shadow Textures Using Convolution", 
+        booktitle = "Computer Graphics (Proceedings of SIGGRAPH~'98)",
+        year = 1998,
+        organization = "ACM SIGGRAPH",
+        month = jul,
+  who = "Havran Vlastimil: REN-0068",
+}
+%        pages = "??-??",
+
+@inproceedings{prikryl:eg:1998,
+  author = "J. Prikryl and W. Purgathofer",
+  title = "State of the Art in Perceptually Driven Radiosity",
+  booktitle = "STAR in {\em Eurographics~'98}",
+  pages = "??-??",
+  organization = "Eurographics Association",
+  year =         "1998",
+  month =        sep,
+  note =         "held in Lisbon, Protugal, 02-04 September 1998",
+  who = "Havran Vlastimil: REN-0069",
+}
+
+@InProceedings{Garrett:1996:RTI,
+  title =        "Real-Time Incremental Visualization of Dynamic
+                 Ultrasound Volumes Using Parallel {BSP} Trees",
+  author =       "William F. Garrett and Henry Fuchs and Mary C. Whitton
+                 and Andrei State",
+  booktitle =    "IEEE Visualization '96",
+  organization = "IEEE",
+  year =         "1996",
+  month =        oct,
+  note =         "ISBN 0-89791-864-9",
+  who = "Havran Vlastimil: REN-0070",
+}
+
+@InProceedings{Mueller:1996:FPV,
+  title =        "Fast Perspective Volume Rendering with Splatting by
+                 Utilizing a Ray-Driven Approach",
+  author =       "Klaus Mueller and Roni Yagel",
+  booktitle =    "IEEE Visualization '96",
+  organization = "IEEE",
+  year =         "1996",
+  month =        oct,
+  note =         "ISBN 0-89791-864-9",
+  who = "Havran Vlastimil: REN-0071",
+}
+
+@InProceedings{Levoy:1996:LFR,
+  author =       "Marc Levoy and Pat Hanrahan",
+  title =        "Light Field Rendering",
+  editor =       "Holly Rushmeier",
+  series =       "Annual Conference Series",
+  pages =        "31--42",
+  booktitle =    "SIGGRAPH 96 Conference Proceedings",
+  year =         "1996",
+  organization = "ACM SIGGRAPH",
+  publisher =    "Addison Wesley",
+  month =        aug,
+  note =         "held in New Orleans, Louisiana, 04-09 August 1996",
+  abstract =     "A number of techniques have been proposed for flying
+                 through scenes by redisplaying previously rendered or
+                 digitized views. Techniques have also been proposed for
+                 interpolating between views by warping input images,
+                 using depth information or correspondences between
+                 multiple images. In this paper, we describe a simple
+                 and robust method for generating new views from
+                 arbitrary camera positions without depth information or
+                 feature matching, simply by combining and resampling
+                 the available images. The key to this technique lies in
+                 interpreting the input images as 2D slices of a 4D
+                 function - the light field. This function completely
+                 characterizes the flow of light through unobstructed
+                 space in a static scene with fixed illumination. We
+                 describe a sampled representation for light fields that
+                 allows for both efficient creation and display of
+                 inward and outward looking views. We have created light
+                 fields from large arrays of both rendered and digitized
+                 images. The latter are acquired using a video camera
+                 mounted on a computer-controlled gantry. Once a light
+                 field has been created, new views may be constructed in
+                 real time by extracting slices in appropriate
+                 directions. Since the success of the method depends on
+                 having a high sample rate, we describe a compression
+                 system that is able to compress the light fields we
+                 have generated by more than a factor of 100:1 with very
+                 little loss of fidelity. We also address the issues of
+                 antialiasing during creation, and resampling during
+                 slice extraction.",
+  who = "Havran Vlastimil: REN-0072",
+}
+
+@InProceedings{Wilhelms:1996:HPD,
+  title =        "Hierarchical and Parallelizable Direct Volume
+                 Rendering for Irregular and Multiple Grids",
+  author =       "Jane P. Wilhelms and Allen {Van Gelder} and Paul
+                  Tarantino and Jonathan Gibbs",
+  booktitle =    "IEEE Visualization '96",
+  organization = "IEEE",
+  year =         "1996",
+  month =        oct,
+  note =         "ISBN 0-89791-864-9",
+  who = "Havran Vlastimil: REN-0073",
+}
+
+@InProceedings{Paquette:1998:HVD,
+  author =       "Eric Paquette and Pierre Poulin and George Drettakis",
+  title =        "A Light Hierarchy for Fast Rendering of Scenes with 
+                  Many Lights",
+  editor =       "TBD...",
+  pages =        "TBD...",
+  booktitle =    "Computer Graphics Forum (EuroGraphics '98 Conference 
+                  Proceedings",
+  year =         "1998",
+  organization = "EuroGraphics",
+  month =        sep,
+  note =         "held in Lisbon, Protugal, 02-04 September 1998",
+  who = "Havran Vlastimil: REN-0074",
+}
+
+@Article{tvcg-1997-12,
+  author =       "Claudio T. Silva and Joseph S. B. Mitchell",
+  email =        "csilva@ams.sunysb.edu and jsbm@ams.sunysb.edu",
+  title =        "The Lazy Sweep Ray Casting Algorithm for Rendering
+                 Irregular Grids",
+  journal =      "IEEE Transaction on Visualization and Computer
+                 Graphics",
+  volume =       "3",
+  number =       "2",
+  month =        apr,
+  year =         "1997",
+  pages =        "142--157",
+  abstract =     "Lazy Sweep Ray Casting is a fast algorithm for
+                 rendering general irregular grids. It is based on the
+                 sweep-plane paradigm, and it is able to accelerate ray
+                 casting for rendering irregular grids, including
+                 disconnected and nonconvex (even with holes)
+                 unstructured irregular grids with a rendering cost that
+                 decreases as the ``disconnectedness'' decreases. The
+                 algorithm is carefully tailored to exploit spatial
+                 coherence even if the image resolution differs
+                 substantially from the object space resolution. Lazy
+                 Sweep Ray Casting has several desirable properties,
+                 including its generality, (depth-sorting) accuracy, low
+                 memory consumption, speed, simplicity of
+                 implementation, and portability (e.g., no hardware
+                 dependencies). We establish the practicality of our
+                 method through experimental results based on our
+                 implementation, which is shown to be substantially
+                 faster (by up to two orders of magnitude) than other
+                 algorithms implemented in software. We also provide
+                 theoretical results, both lower and upper bounds, on
+                 the complexity of ray casting of irregular grids.",
+  keywords =     "volumetric data, irregular grids, volume rendering,
+                 sweep algorithms, ray tracing, computational geometry,
+                 scientific visualization",
+  tvcg-abstract-url = "http://www.computer.org/pubs/tvcg/1997/v0142abs.htm",
+  who = "Havran Vlastimil: REN-0075",
+}
+
+@InProceedings{EVL-1997-33,
+  author =       "W. Heidrich and Ph. Slusallek and H.-P. Seidel",
+  editor =       "V. Klassen M. Mantei",
+  title =        "An Image-Based Model for Realistic Lens Systems in
+                 Interactive Computer Graphics",
+  booktitle =    "Proceedings of Graphics Interface '97",
+  year =         "1997",
+  note =         "accepted for publication",
+  abstract =     "Many applications, such as realistic rendering,
+                 virtual and augmented reality, and virtual studios,
+                 require an accurate simulation of real lens and camera
+                 systems at interactive rates, including depth of field
+                 and geometric aberrations, in particular distortions.
+                 Unfortunately, camera models used in Computer Graphics
+                 are either too simple to describe these effects or too
+                 expensive to simulate for interactive use. In this
+                 paper, we introduce an image-based lens model that is
+                 powerful enough to simulate sophisticated properties of
+                 real lens systems, yet fast enough for interactive
+                 graphics. By exploiting coherence, common graphics
+                 hardware can be used to yield high frame rates.",
+  keywords =     "Lens Systems, Image-Based Rendering, Hardware
+                 Acceleration, Interactive Computer Graphics",
+  postscript-url = "ftp://faui90.informatik.uni-erlangen.de/pub/Publications/1997/Publ.1997.4.ps.gz",
+  evlib-url =    "http://infovis.zib.de:8000/Dienst/UI/2.0/Describe/evl.computergraphics%2FEVL-1997-33",
+  evlib-revision = "1st",
+  who = "Havran Vlastimil: REN-0076",
+}
+
+@InProceedings{schilling91a,
+  author =       "Andreas Schilling",
+  title =        "A new simple and efficient antialiasing with subpixel
+                 masks",
+  pages =        "133--141",
+  booktitle =      "Computer Graphics (SIGGRAPH '91 Proceedings)",
+  volume =       "25",
+  number =       "4",
+  year =         "1991",
+  month =        jul,
+  editor =       "Thomas W. Sederberg",
+  conference =   "held in Las Vegas, Nevada; 28 July - 2 August 1991",
+  keywords =     "antialiasing, exact area subpixel algorithm",
+  who = "Havran Vlastimil: REN-0077",  
+}
+
+
+@InProceedings{Ward:1994:RLS,
+  author =       "Gregory J. Ward",
+  editor =       "Andrew Glassner",
+  booktitle =    "Proceedings of SIGGRAPH '94 (Orlando, Florida, July
+                 24--29, 1994)",
+  title =        "The {RADIANCE} Lighting Simulation and Rendering
+                 System",
+  organization = "ACM SIGGRAPH",
+  publisher =    "ACM Press",
+  pages =        "459--472",
+  month =        jul,
+  year =         "1994",
+  note =         "ISBN 0-89791-667-0",
+  series =       "Computer Graphics Proceedings, Annual Conference
+                 Series",
+  who = "Havran Vlastimil: REN-0078",
+}
+
+
+
+@InProceedings{Chui96-LVARC,
+  author =       "Ken Chui and Kurt Zimmerman and Peter Shirley",
+  year =         "1996",
+  title =        "The {Light} {Volume}: {An} {Aid} to {Rendering}
+                 {Complex} {Environments}",
+  booktitle =    "Rendering Techniques '96 (Proceedings of the Seventh
+                 Eurographics Workshop on Rendering)",
+  pages =        "1--10",
+  publisher =    "Springer-Verlag/Wien",
+  address =      "New York, NY",
+  comments =     "ISBN 3-211-82883-4",
+  who = "Havran Vlastimil: REN-0080",
+}
+
+@Article{Shirley:1992:TCM,
+  author =       "Peter Shirley",
+  title =        "Time complexity of {Monte Carlo} radiosity",
+  journal =      "Computers and Graphics",
+  volume =       "16",
+  number =       "1",
+  pages =        "117--120",
+  year =         "1992",
+  coden =        "COGRD2",
+  ISSN =         "0097-8493",
+  bibdate =      "Wed Feb 5 07:22:58 MST 1997",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Indiana Univ",
+  affiliationaddress = "Bloomington, IN, USA",
+  classification = "723; 922",
+  journalabr =   "Comput Graphics (Pergamon)",
+  keywords =     "Computer Metatheory--Computational Complexity;
+                 Mathematical Statistics; Monte Carlo Methods; Time
+                 Complexity",
+  who = "Havran Vlastimil: REN-0081",
+}
+
+
+
+@Article{Nishita85,
+  author =       "Tomoyuki Nishita and Eihachiro Nakamae",
+  title =        "Continuous Tone Representation of 3-{D} Objects Taking
+                 Account of Shadows and Interreflection",
+  journal =      "Computer Graphics (SIGGRAPH '85 Proceedings)",
+  volume =       "19",
+  number =       "3",
+  month =        jul,
+  year =         "1985",
+  pages =        "23--30",
+  keywords =     "shading, penumbra, radiosity",
+  who = "Havran Vlastimil: REN-0082",
+}
+
+
+@Article{Christensen:1997:CGG,
+  author =       "Per H. Christensen and Dani Lischinski and Eric J.
+                 Stollnitz and David H. Salesin",
+  title =        "Clustering for Glossy Global Illumination",
+  journal =      "ACM Transactions on Graphics",
+  year =         "1997",
+  volume =       "16",
+  number =       "1",
+  month =        jan,
+  pages =        "3--33",
+  note =         "ISSN 0730-0301",
+  keywords =     "clustering, error bounds, global illumination, glossy
+                 reflectors, hierarchy, importance, radiance,
+                 rendering",
+  annote =       "We present a new clustering algorithm for global
+                 illumination in complex environments. The new algorithm
+                 extends previous work on clustering for radiosity to
+                 allow for nondiffuse (glossy) reflectors. We represent
+                 clusters as points with directional distributions of
+                 outgoing and incoming radiance and importance, and we
+                 derive an error bound for transfers between these
+                 clusters. The algorithm groups input surfaces into a
+                 hierarchy of clusters, and then permits clusters to
+                 interact only if the error bound is below an acceptable
+                 tolerance. We show that the algorithm is asymptotically
+                 more efficient than previous clustering algorithms even
+                 when restricted to ideally diffuse environments.
+                 Finally, we demonstrate the performance of our method
+                 on two complex glossy environments.",
+    who = "Havran Vlastimil: REN-0083",
+}
+
+@InCollection{Zimmerman95twopass,
+  author =       "Kurt Zimmerman and Peter Shirley",
+  title =        "A Two-Pass Realistic Image Synthesis Method for
+                 Complex Scenes",
+  booktitle =    "Rendering Techniques '95 (Proceedings of the Sixth
+                 Eurographics Workshop on Rendering)",
+  publisher =    "Springer-Verlag",
+  address =      "NY",
+  pages =        "284--295",
+  year =         "1995",
+  note =         "Also ftp://ftp.cs.indiana.edu/pub/techreports/TR434.ps.Z",
+  keywords =     "shadow",
+  who = "Havran Vlastimil: REN-0084",
+}
+
+@Article{Asensio:1992:HRC,
+  author =       "Frederic Asensio",
+  title =        "A Hierarchical Ray-Casting Algorithm for Radiosity
+                 Shadows",
+  year =         "1992",
+  month =        may,
+  journal =      "Third Eurographics Workshop on Rendering",
+  pages =        "179--188",
+  address =      "Bristol, UK",
+  keywords =     "radiosity",
+  who = "Havran Vlastimil: REN-0085",
+}
+
+
+@InProceedings{Gu:1997:PGT,
+  author =       "Xianfeng Gu and Steven J. Gortier and Michael F.
+                 Cohen",
+  title =        "Polyhedral Geometry and the Two-Plane
+                 Parameterization",
+  booktitle =    "Eurographics Rendering Workshop 1997",
+  editor =       "Julie Dorsey and Philipp Slusallek",
+  year =         "1997",
+  organization = "Eurographics",
+  publisher =    "Springer Wein",
+  address =      "New York City, NY",
+  month =        jun,
+  pages =        "1--12",
+  note =         "ISBN 3-211-83001-4",
+  annote =       "Recently the light-field and lumigraph systems have
+                 been proposed as general methods of representing the
+                 visual information present in a scene. These methods
+                 represent this information as a 4D function of light
+                 over the domain of directed lines. These systems use
+                 the intersection points of the lines on two planes to
+                 parameterize the lines in space. This paper explores
+                 the structure of the two-plane parameterization in
+                 detail. In particular we analyze the association
+                 between the geometry of the scene and subsets of the 4D
+                 data. The answers to these questions are essential to
+                 understanding the relationship between a lumigraph, and
+                 the geometry that it attempts to represent. This
+                 knowledge is potentially important for a variety of
+                 applications such as extracting shape from lumigraph
+                 data, and lumigraph compression.",
+  who = "Havran Vlastimil: REN-0086",
+}
+
+@Article{Schaufler:1996:TDI,
+  author =       "Germot Schaufler and Wolfgang Sturzlinger",
+  title =        "A Three-Dimensional Image Cache for Virtual Reality",
+  journal =      "Com{\-}pu{\-}ter Graphics Forum",
+  volume =       "15",
+  number =       "3",
+  pages =        "C227--C235, C471--C472",
+  month =        sep,
+  year =         "1996",
+  coden =        "CGFODY",
+  ISSN =         "0167-7055",
+  bibdate =      "Tue Mar 17 15:44:38 MST 1998",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Johannes Kepler Universit{\"a}t Linz",
+  affiliationaddress = "Linz, Austria",
+  affiliationaddress = "Austria",
+  classification = "722.1; 722.4; 723.1; 723.2; 723.5; 921.5; C6120
+                 (File organisation); C6130B (Graphics techniques)",
+  conference =   "Proceedings of the 1996 17th Annual Conference and
+                 Exhibition of the European Association for Computer
+                 Graphics, EUROGRAPHICS'96",
+  conflocation = "Poitiers, France; 26-30 Aug. 1996",
+  conftitle =    "European Association for Computer Graphics 17th Annual
+                 Conference and Exhibition. EUROGRAPHICS '96",
+  corpsource =   "Johannes Kepler Univ., Linz, Austria",
+  journalabr =   "Comput Graphics Forum",
+  keywords =     "Algorithms; Buffer storage; Computational geometry;
+                 Computer hardware; Computer software; Image processing;
+                 Object hierarchies; Optimization; Real time systems;
+                 Three dimensional computer graphics; Three dimensional
+                 image cache; Virtual reality",
+  keywords =     "Algorithms; Buffer storage; cache storage; coherence;
+                 complex virtual; Computational geometry; computer
+                 displays; Computer hardware; Computer software; detail;
+                 environment display; frame rate; hardware; hierarchical
+                 scene subdivision; Image processing; impostors; large
+                 virtual environment display; levels; Object
+                 hierarchies; optimisation; Optimization; Real time
+                 systems; real-time; real-time rendering; rendering;
+                 rendering (computer graphics); rendering load; smooth
+                 frame sequence; software accelerated; software
+                 optimization; systems; Three dimensional computer
+                 graphics; three dimensional image cache; Three
+                 dimensional image cache; three dimensional image cache;
+                 virtual reality; Virtual reality; virtual reality",
+  meetingaddress = "Poitiers, Fr",
+  meetingdate =  "Aug 26--30 1996",
+  meetingdate2 = "08/26--30/96",
+  sponsor =      "CNRS; ERCIM; BARCO; EDF; SUN; et al",
+  sponsororg =   "CNRS; BARCO; Electr. France; et al",
+  treatment =    "P Practical",
+  who = "Havran Vlastimil: REN-0087",
+}
+
+@Article{Sbert:1993:IGB,
+  author =       "M. Sbert",
+  title =        "An integral geometry based method for fast form-factor
+                 computation",
+  journal =      "Com{\-}pu{\-}ter Graphics Forum",
+  volume =       "12",
+  number =       "3",
+  pages =        "C409--C420",
+  month =        "????",
+  year =         "1993",
+  coden =        "CGFODY",
+  ISSN =         "0167-7055",
+  bibdate =      "Mon Apr 14 10:23:20 MDT 1997",
+  acknowledgement = ack-nhfb,
+  classification = "C1140G (Monte Carlo methods); C4260 (Computational
+                 geometry); C6130B (Graphics techniques)",
+  conflocation = "Barcelona, Spain; 6-10 Sept. 1993",
+  conftitle =    "European Association for Computer Graphics 14th Annual
+                 Conference and Exhibition. EUROGRAPHICS '93",
+  corpsource =   "Dept. d'Inf. i Matematica Aplicada, Univ. Politecnica
+                 de Catalunya, Barcelona, Spain",
+  keywords =     "complexity; Complexity; complexity; computational
+                 geometry; computer graphics; form-factor computation;
+                 Form-factor computation; integral geometry based
+                 method; Integral geometry based method; integration;
+                 local; Local integration; luminance; Luminance;
+                 methods; Monte Carlo; Monte Carlo techniques; ray
+                 tracing; rendering algorithms; Rendering algorithms",
+  thesaurus =    "Computational geometry; Computer graphics; Monte Carlo
+                 methods; Ray tracing",
+  treatment =    "P Practical; T Theoretical or Mathematical",
+  who = "Havran Vlastimil: REN-0088",
+}
+
+@TechReport{Shade:1996:   ,
+  author =       "Jonathan Shade and Dani Lischinski and David Salesin
+                 and Tony {DeRose} and John Snyder",
+  title =        "Hierarchical Image Caching for Accelerated
+                 Walkthroughs of Complex Environments",
+  institution = "University of Washington",
+  pages =        "1--22",
+  year =         "1996",
+  month =        jan,
+  who = "Havran Vlastimil: REN-0089",
+}
+
+@InProceedings{Sbert95-GMCPS,
+  author =       "Mateu Sbert and Frederic Perez and Xavier Pueyo",
+  editor =       "P. M. Hanrahan and W. Purgathofer",
+  year =         "1995",
+  title =        "Global {Monte} {Carlo}: {A} {Progressive} {Solution}",
+  booktitle =    "Rendering Techniques '95 (Proceedings of the Sixth
+                 Eurographics Workshop on Rendering)",
+  pages =        "231--239",
+  publisher =    "Springer-Verlag",
+  address =      "New York, NY",
+  comments =     "ISBN 3-211-82733-1",
+  who = "Havran Vlastimil: REN-0090",
+}
+
+@TechReport{Szirmay-Kalos98,
+  author =       "Laszlo Szirmay-Kalos and Werner Purgathofer",
+  title =        "Global Ray-bundle Tracing with Hardware Acceleration",
+  institution = " Technical University of Budapest",
+  number = "TR-186-2-98-18",
+  month =        jun,
+  year =         "1998",
+  keywords =     "rendering equation, global radiance, Monte-Carlo and
+                  quasi Monte Carlo integration, Importance Sampling,
+                  Metropolis Method, z-buffer",
+  who = "Havran Vlastimil: REN-0091",
+}
+
+@InProceedings{Braun:1995:ADS,
+  author =       "M. Braun and A. Formella",
+  title =        "Anigraph - {A} Data Structure for Computer Animation",
+  booktitle =    "Computer Animation '95",
+  year =         "1995",
+  month =        apr,
+  who = "Havran Vlastimil: REN-0092",
+}
+
+@InProceedings{EVL-1997-108,
+  author =       "Jarkko Oikarinen",
+  title =        "Using 3-Dimensional Seed Filling in View Space to
+                 Accelerate Volume Rendering",
+  booktitle =    "IEEE Visualization '97",
+  organization = "IEEE",
+  month =        oct,
+  year =         "1997",
+  language =     "en",
+  postscript-url = "http://rieska.oulu.fi/~jto/papers/ieeevis97.ps",
+  postscript-url-md5 = "f2b002cd5c384fffe63cac6826e09ed3",
+  evlib-url =    "http://visinfo.zib.de:80/Dienst/UI/2.0/Describe/evl.volumerendering%2FEVL-1997-108",
+  evlib-revision = "1st",
+  who = "Havran Vlastimil: REN-0093",
+}
+
+InProceedings{Bouatouch:1995:IWT,
+  author =       "Kadi Bouatouch and Sumant Pattanaik",
+  title =        "Interactive Walk-Through Using Particle Tracing",
+  booktitle =    "Computer Graphics International '95",
+  year =         "1995",
+  month =        jun,
+  who = "Havran Vlastimil: REN-0094",
+}
+
+@Article{Pattanaik:1993:PEI,
+  author =       "S. N. Pattanaik and S. P. Mudur",
+  title =        "The potential equation and importance in illumination
+                 computations",
+  journal =      "Com{\-}pu{\-}ter Graphics Forum",
+  volume =       "12",
+  number =       "2",
+  pages =        "131--136",
+  month =        jun,
+  year =         "1993",
+  coden =        "CGFODY",
+  ISSN =         "0167-7055",
+  bibdate =      "Mon Apr 14 10:23:20 MDT 1997",
+  acknowledgement = ack-nhfb,
+  classification = "A0230 (Function theory, analysis); A4210
+                 (Propagation and transmission in homogeneous media);
+                 C4180 (Integral equations); C6130B (Graphics
+                 techniques)",
+  corpsource =   "Graphics and CAD Div., Nat. Centre for Software
+                 Technol., Bombay, India",
+  keywords =     "adjoint; Adjoint linear equations; adjoint linear
+                 equations; Adjoint radiosity equation; brightness;
+                 computer graphics; discrete; Discrete formulations;
+                 equation; formulations; Global illumination; global
+                 illumination; illumination computations; Illumination
+                 computations; illumination computations;
+                 importance-driven radiosity algorithm;
+                 Importance-driven radiosity algorithm;
+                 importance-driven radiosity algorithm; integral
+                 equations; Integral equations; lighting; Linear
+                 operators; linear operators; luminance; Luminance
+                 equation; patch; Patch; potential equation; Potential
+                 equation; potential equation; radiosity equation;
+                 Surface potential; surface potential; transposes;
+                 Transposes; transposes",
+  thesaurus =    "Brightness; Computer graphics; Integral equations;
+                 Lighting; Surface potential",
+  treatment =    "T Theoretical or Mathematical",
+  who = "Havran Vlastimil: REN-0095",
+}
+
+@InProceedings{Fuchs:1983:NRT,
+  author =       "H. Fuchs and G. D. Abram and E. D. Grant",
+  title =        "Near real-time shaded display of rigid objects",
+  pages =        "65--72",
+  journal =      "Computer Graphics (SIGGRAPH '83 Proceedings)",
+  year =         "1983",
+  month =        jul,
+  conference =   "held in Detroit, Michigan; 25--29 July 1983",
+  keywords =     "I35 object data base, I37 shading, I37 visible surface
+                 algorithm",
+  who = "Havran Vlastimil: REN-0096",
+}
+
+@InProceedings{Atherton:1983:SHS,
+  author =       "Peter R. Atherton",
+  title =        "A Scanline Hidden Surface Removal Procedure for
+                 Constructive Solid Geometry",
+  pages =        "73--82",
+  booktitle =      "Computer Graphics (SIGGRAPH '83 Proceedings)",
+  volume =       "17",
+  number =       "3",
+  year =         "1983",
+  month =        jul,
+  conference =   "held in Detroit, Michigan; 25--29 July 1983",
+  keywords =     "CSG, I35 constructive solid geometry, I37 hidden
+                 surface removal",
+  who = "Havran Vlastimil: REN-0097",
+}
+
+@Article{tvcg-1996-25,
+  author =       "George Drettakis and Eugene L. Fiume",
+  email =        "George.Drettakis@imag.fr",
+  title =        "{Structured Penumbral Irradiance Computation}",
+  journal =      "IEEE Transactions on Visualization and Computer
+                 Graphics",
+  volume =       "2",
+  number =       "4",
+  month =        dec,
+  year =         "1996",
+  pages =        "299--312",
+  abstract =     "A definitive understanding of irradiance behavior in
+                 penumbral regions has been hard to come by, mainly due
+                 to the computational expense of determining the visible
+                 parts of an area light source. Consequently, sampling
+                 strategies have been mostly ad hoc, and evaluation of
+                 the resulting approximations has been difficult. In
+                 this paper, the structure of penumbral irradiance is
+                 investigated empirically and numerically. This study
+                 has been made feasible by the use of the discontinuity
+                 mesh and the backprojection, an efficient data
+                 structure representing visibility in regions of partial
+                 occlusion. Regions of penumbrae in which irradiance
+                 varies nonmonotonically are characterized empirically,
+                 and numerical tests are performed to determine the
+                 frequency of their occurrence. This study inspired the
+                 development of two algorithms for the construction of
+                 interpolating approximations to irradiance: One
+                 algorithm reduces the number of edges in the mesh
+                 defining the interpolant domain, and the other
+                 algorithm chooses among linear, quadratic, and mixed
+                 interpolants based on irradiance monotonicity. Results
+                 from numerical tests and images are presented that
+                 demonstrate good performance of the new algorithms for
+                 various realistic test configurations.",
+  keywords =     "Rendering, primary and global illumination, sampling,
+                 interpolation, structure, penumbra, experimental study,
+                 irradiance, radiosity, discontinuity meshing,
+                 backprojection, mesh simplification, interpolant degree
+                 reduction",
+  tvcg-abstract-url = "http://www.computer.org/tvcg/tg1996/v0299abs.htm",
+  who = "Havran Vlastimil: REN-0098",
+}
+
+@Article{tvcg-1996-24,
+  author =       "Jeffry Nimeroff and Julie Dorsey and Holly Rushmeier",
+  email =        "jnimerof@graphics.cis.upenn.edu and
+                 dorsey@graphics.lcs.mit.edu and holly@watson.ibm.com",
+  title =        "{Implementation and Analysis of an Image-Based Global
+                 Illumination Framework for Animated Environments}",
+  journal =      "IEEE Transactions on Visualization and Computer
+                 Graphics",
+  volume =       "2",
+  number =       "4",
+  month =        dec,
+  year =         "1996",
+  pages =        "283--298",
+  abstract =     "We describe a new framework for efficiently computing
+                 and storing global illumination effects for complex,
+                 animated environments. The new framework allows the
+                 rapid generation of sequences representing any
+                 arbitrary path in a ``view space'' within an
+                 environment in which both the viewer and objects move.
+                 The global illumination is stored as time sequences of
+                 range-images at base locations that span the view
+                 space. We present algorithms for determining locations
+                 for these base images, and the time steps required to
+                 adequately capture the effects of object motion. We
+                 also present algorithms for computing the global
+                 illumination in the base images that exploit spatial
+                 and temporal coherence by considering direct and
+                 indirect illumination separately. We discuss an initial
+                 implementation using the new framework. Results and
+                 analysis of our implementation demonstrate the
+                 effectiveness of the individual phases of the approach;
+                 we conclude with an application of the complete
+                 framework to a complex environment that includes object
+                 motion.",
+  keywords =     "Animation, global illumination, image-based rendering,
+                 radiosity, ray tracing, walk-throughs",
+  tvcg-abstract-url = "http://www.computer.org/tvcg/tg1996/v0283abs.htm",
+  who = "Havran Vlastimil: REN-0099",
+}
+
+@Article{Danskin:1992:FAV,
+  author =       "John Danskin and Pat Hanrahan",
+  title =        "Fast Algorithms for Volume Ray Tracing",
+  year =         "1992",
+  journal =      "1992 Workshop on Volume Visualization",
+  institution =  "ACM",
+  pages =        "91--98",
+  annote =       "We examine various simple algorithms that exploit
+                 homogeneity and accumulated opacity for tracing rays
+                 through shaded volumes. Most of these meth- ods have
+                 error criteria which allow them to trade quality for
+                 speed. The time vs. quality tradeoff for these adaptive
+                 methods is compared to fixed step multiresolution
+                 methods. These methods are also useful for general
+                 light transport in volumes.",
+  who = "Havran Vlastimil: REN-0100",
+}
+
+@InProceedings{Aupperle:1993:HIA,
+  author =       "L. Aupperle and Pat Hanrahan",
+  booktitle =    "Computer Graphics Proceedings, Annual Conference
+                 Series, 1993",
+  title =        "A Hierarchical Illumination Algorithm for Surfaces
+                 with Glossy Reflection",
+  pages =        "155--162",
+  year =         "1993",
+  keywords =     "adaptive meshing, global illumination, radiosity, ray
+                 tracing",
+  annote =       "We develop a radiance formulation for discrete three
+                 point transport, and a new measure and description of
+                 reflectance:area reflectance. This formulation and
+                 associated reflectance allow an estimate of error in
+                 the computation of radiance across triples of surface
+                 elements, and lead directly to a hierarchical
+                 refinement algorithm for global illumination. We have
+                 implemented and analyzed this algorithm over surfaces
+                 exhibiting glossy specular and diffuse reflection.
+                 Theoretical growth in light transport computation is
+                 shown to be O ( n + k 3 ) for sufficient refinement,
+                 where n is the number of elements at the finest level
+                 of subdivision over an environment consisting of k
+                 input polygonal patches Ñ this growth is exhibited in
+                 experimental trials. Naive application of three point
+                 transport would require computation over O ( n 3 )
+                 element-triple interactions.",
+  keywords =     "adaptive meshing, global illumination, radiosity, ray
+                 tracing",
+  who = "Havran Vlastimil: REN-0101",
+}
+
+@Article{Cohen-Or:1998:TDD,
+  author =       "Daniel Cohen-Or and Amira Solomovic and David Levin",
+  title =        "Three-dimensional distance field metamorphosis",
+  journal =      "ACM Transactions on Graphics",
+  volume =       "17",
+  number =       "2",
+  pages =        "116--141",
+  month =        apr,
+  year =         "1998",
+  coden =        "ATGRDF",
+  ISSN =         "0730-0301",
+  bibdate =      "Sat May 16 07:25:59 MDT 1998",
+  url =          "http://www.acm.org:80/pubs/citations/journals/tog/1998-17-2/p116-cohen-or/",
+  abstract =     "Given two or more objects of general topology,
+                 intermediate objects are constructed by a distance
+                 field metamorphosis. In the presented method the
+                 interpolation of the distance field is guided by a warp
+                 function controlled by a set of corresponding anchor
+                 points. Some rules for defining a smooth
+                 least-distorting warp function are given. To reduce the
+                 distortion of the intermediate shapes, the warp
+                 function is decomposed into a rigid rotational part and
+                 an elastic part. The distance field interpolation
+                 method is modified so that the interpolation is done in
+                 correlation with the warp function. The method provides
+                 the animator with a technique that can be used to
+                 create a set of models forming a smooth transition
+                 between pairs of a given sequence of keyframe models.
+                 The advantage of the new approach is that it is capable
+                 of morphing between objects having a different
+                 topological genus where no correspondence between the
+                 geometric primitives of the models needs to be
+                 established. The desired correspondence is defined by
+                 an animator in terms of a relatively small number of
+                 anchor points",
+  acknowledgement = ack-nhfb,
+  keywords =     "algorithms",
+  subject =      "{\bf I.3.7} Computing Methodologies, COMPUTER
+                 GRAPHICS, Three-Dimensional Graphics and Realism,
+                 Animation. {\bf I.3.5} Computing Methodologies,
+                 COMPUTER GRAPHICS, Computational Geometry and Object
+                 Modeling, Curve, surface, solid, and object
+                 representations. {\bf I.3.6} Computing Methodologies,
+                 COMPUTER GRAPHICS, Methodology and Techniques,
+                 Interaction techniques.",
+  who = "Havran Vlastimil: REN-0102",
+}
+
+
+@INPROCEEDINGS{IMMD9:39:1997,
+  author = {Ph. Slusallek},
+  title = {Photo-Realistic Rendering -- Recent Trends and Developments},
+  booktitle = {EUROGRAPHICS '97 State-of-the-Art-Report},
+  year = {1997},
+  organization = {Eurographics Association},
+  who = "Havran Vlastimil: REN-0103",
+}
+
+@TECHREPORT{IMMD9:TR5:1998,
+  author = {C. Teitzel AND M. Hopf AND R. Grosso AND T. Ertl},
+  title = {Volume Ray Casting on Sparse Grids},
+  number = {5},
+  year = {1998},
+  institution = {Universität Erlangen-Nürnberg},
+  who = "Havran Vlastimil: REN-0104",
+}
+
Index: trunk/VUT/doc/SciReport/Bib/rtmame.bib
===================================================================
--- trunk/VUT/doc/SciReport/Bib/rtmame.bib	(revision 243)
+++ trunk/VUT/doc/SciReport/Bib/rtmame.bib	(revision 243)
@@ -0,0 +1,3961 @@
+@TechReport{Bala98rep,
+  author = "K. Bala and J. Dorsey and S. Teller",
+  title = "Bounded-Error Interactive Ray Tracing",
+  pages = "1--17",
+  institution = "MIT",
+  year = 1998,
+  month = mar,
+  number = "MIT LCS TR-748",
+  who = "Havran Vlastimil: RT-0183",
+}
+
+@InProceedings{GGW-1998-cgf,
+  pages =        "C--29--C--54",
+  year =         "1998",
+  title =        "Adaptive Supersampling in Object Space Using Pyramidal Rays",
+  author =       "J. Genetti and D. Gordon and G. Williams",
+  url =          "http:// www.sdsc.edu/~genetti/Papers/CGF98/ASOS.html",
+  language =     "en",
+  booktitle =    "Computer Graphics Forum",
+  who = "Havran Vlastimil: RT-0182",
+}
+
+@InProceedings{EVL-1995-34,
+  pages =        "C--311--C--324",
+  year =         "1995",
+  title =        "Using Procedural {RenderMan} Shaders for Global
+                 Illumination",
+  author =       "Philipp Slusallek and Thomas Pflaum and Hans-Peter
+                 Seidel",
+  url =          "http://visinfo.zib.de/EVlib/Show?EVL-1995-34",
+  language =     "en",
+  abstract =     "Global illumination techniques like radiosity or
+                 Monte-Carlo ray-tracing are becoming standard features
+                 of rendering systems. However, there is currently no
+                 accepted interface format which supports an appropriate
+                 physically-based scene description. In this paper we
+                 present extensions to the well-known RenderMan
+                 interface, which allow for a physically based scene
+                 description and support advanced global illumination
+                 techniques. Special emphasis has been laid on the
+                 support for procedural descriptions of reflection and
+                 emission by RenderMan surface shaders. So far, they
+                 could not be used with most global illumination
+                 algorithms. The extensions have been implemented in a
+                 physically-based rendering system and are illustrated
+                 with examples.",
+  editor =       "F. Post and M. G{\"{o}}bel",
+  booktitle =    "Computer Graphics Forum (Proceedings EUROGRAPHICS
+                 '95)",
+  who = "Havran Vlastimil: RT-0181",		 
+}
+
+@Article{Nakamaru97,
+  author =       "Koji Nakamaru and Yoshio Ohno",
+  title =        "{Breadth-First Ray Tracing Utilizing Uniform Spatial
+                 Subdivision}",
+  journal =      "IEEE Transactions on Visualization and Computer
+                 Graphics",
+  volume =       "3",
+  number =       "4",
+  month =        oct,
+  year =         "1997",
+  pages =        "316--328",
+  abstract =     "Breadth-first ray tracing is based on the idea of
+                 exchanging the roles of rays and objects. For scenes
+                 with a large number of objects, it may be profitable to
+                 form a set of rays and compare each object in turn
+                 against this set. By doing so, thrashing, due to disk
+                 access, can be minimized. In this paper, we present
+                 ways to combine breadth-first methods with traditional
+                 efficient algorithms, along with new schemes to
+                 minimize accessing objects stored on disk. Experimental
+                 analysis, including comparisons with depth-first ray
+                 tracing, shows that large databases can be handled
+                 efficiently with this approach.",
+  keywords =     "breadth-first ray tracing, uniform spatial
+                 subdivision",
+  tvcg-abstract-url = "http://www.computer.org/tvcg/tg1997/v0316abs.htm",
+  tvcg-pdf-url = "http://pdf.computer.org/tg/books/tg1997/pdf/v0316.pdf",
+ who = "Havran Vlastimil: RT-0180",
+}
+
+@Article{Elber:1997:RT,
+  author =       "Gershon Elber and {Jung-Ju} Choi and {Myung-Soo} Kim",
+  title =        "Ruled Tracing",
+  journal =      "The Visual Computer",
+  year =         "1997",
+  volume =       "13",
+  number =       "2",
+  pages =        "78--94",
+  publisher =    "Springer-Verlag",
+  note =         "ISSN 0178-2789",
+  annote =       "The traditional ray-tracing technique based on a
+                 ray-surface intersection is reduced to a ruled or
+                 developable surface-surface intersection problem. That
+                 enables direct freeform surface rendering. By
+                 exploiting the spatial coherence gained in the
+                 ruled/developable surface-tracing approach presented,
+                 the emulation of shadows, specular reflections, and/or
+                 refractions in a freeform surface environment can all
+                 be implemented efficiently. The approach provides a
+                 direct freeform surface-rendering alternative to ray
+                 tracing. An implementation of a direct freeform surface
+                 renderer that emulates shadows as well as specular
+                 reflections is discussed. This renderer processes
+                 isoparametric curves as its basic building block,
+                 eliminating the need for polygonal approximation.",
+  keywords =     "Ray tracing, light wavefronts, direct freeform surface
+                 rendering, shadow computation, reflection/refraction",
+ who = "Havran Vlastimil: RT-0179",
+}
+
+@Article{Ip:1997:EPS,
+  author =       "Horace H. S. Ip and Ken C. K. Law and Gabriel K. P.
+                 Fung",
+  title =        "Epipolar plane space subdivision method in
+                 stereoscopic ray tracing",
+  journal =      "The Visual Computer",
+  year =         "1997",
+  volume =       "13",
+  number =       "6",
+  pages =        "247--264",
+  publisher =    "Springer-Verlag",
+  note =         "ISSN 0178-2789",
+  keywords =     "ray tracing, stereoscopic rendering, epipolar
+                 geometry",
+  annote =       "This paper presents a novel space subdivision scheme
+                 based on epipolar geometry. It is particularly suited
+                 to stereoscopic ray tracing in the backprojection
+                 method. The resulting rendering algorithm gives a
+                 substantial speed improvement over generating stereo
+                 pair images separately, and the generated stereo images
+                 are effectively identical to those generated
+                 separately. In this work, the generation of
+                 stereoscopic images is accelerated by two methods,
+                 namely stereoscopic backprojection and epipolar
+                 plane-space subdivision. The performance of our
+                 algorithm is evaluated and compared with the octree
+                 algorithm. Experimental results demonstrating the
+                 efficiency of the approach are presented.",
+ who = "Havran Vlastimil: RT-0178",
+}
+
+@Article{Choi92,
+  author =       "H. K. Choi and C. M. Kyung",
+  title =        "{PYSHA}: a shadow-testing acceleration scheme for ray
+                 tracing",
+  journal =      "Computer-aided design",
+  volume =       "24",
+  number =       "2",
+  month =        feb,
+  year =         "1992",
+  note =         "hybrid scheme of light buffer and grid subdivision
+                 with cost comparison on the fly",
+ who = "Havran Vlastimil: RT-0177",
+}
+
+@TechReport{Sherstyuk96:TCHR,
+  author =       "A. Sherstyuk",
+  title =        "Ray-tracing implicit surfaces: a generalized approach",
+  year =         "1996",
+  type =         "Technical Report",
+  number =       "1996/290",
+  institution =  "Monash University",
+  keywords =     "implicit surfaces, ray-tracing",
+  who = "Havran Vlastimil: RT-0176",
+}
+
+@InProceedings{Genetti:1993:RTA,
+  author =       "Jon Genetti and Dan Gordon",
+  title =        "Ray Tracing with Adaptive Supersampling in Object
+                 Space",
+  year =         "1993",
+  month =        may,
+  booktitle =    "Proceedings of Graphics Interface '93",
+  publisher =    "Canadian Information Processing Society",
+  pages =        "70--77",
+  address =      "Toronto, Ontario",
+  keywords =     "sampling, antialiasing, penumbrae",
+  who = "Havran Vlastimil: RT-0175",
+}
+
+@Article{Redner:1995:SBI,
+  author =       "Richard A. Redner and Mark E. Lee and Samuel P.
+                 Uselton",
+  title =        "Smooth {B}-Spline Illumination Maps for Bidirectional
+                 Ray Tracing",
+  journal =      "ACM Transactions on Graphics",
+  volume =       "14",
+  number =       "4", 
+  pages =        "337--362",
+  month =        oct,
+  year =         "1995",
+  coden =        "ATGRDF",
+  ISSN =         "0730-0301",
+  bibdate =      "Mon May 26 09:17:43 1997",
+  url =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/225296.html",
+  abstract =     "In this paper we introduce B-spline illumination maps 
+                 and their generalizations and extensions for use in
+                 realistic image generation algorithms. The B-spline
+                 lighting functions (i.e., illumination maps) are
+                 defined as weighted probability density functions. The
+                 lighting functions can be estimated from random data
+                 and may be used in bidirectional distributed ray
+                 tracing programs as well as radiosity oriented
+                 algorithms. The use of these lighting functions in a
+                 bidirectional ray tracing system that can handle
+                 dispersion as well as the focusing of light through
+                 lenses is presented.",
+  acknowledgement = ack-nhfb,
+  keywords =     "algorithms; theory",
+  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
+                 GRAPHICS, Three-Dimensional Graphics and Realism,
+                 Visible line/surface algorithms.",
+  note =         "Corrections to Figures 4--9 are available on the
+                 World-Wide Web at path=http://www.acm.org/tog/AandE.html=.",
+  who = "Havran Vlastimil: RT-0174",
+}
+
+@Article{Lee:1985:SOS,
+  author =       "Mark E. Lee and Richard A. Redner and Samuel P.
+                 Uselton",
+  editor =       "B. A. Barsky",
+  title =        "Statistically Optimized Sampling for Distributed Ray
+                 Tracing",
+  journal =      "Computer Graphics",
+  volume =       "19",
+  number =       "3",
+  pages =        "61--67",
+  month =        jul,
+  year =         "1985",
+  coden =        "CGRADI, CPGPBZ",
+  ISSN =         "0097-8930",
+  annote =       "Cook, Porter, and Carpenter coined the phrase
+                 ``distributed ray tracing'' to describe a technique for
+                 using each ray of a super-sampled ray tracing procedure
+                 as a sample in several dimensions to achieve effects
+                 such as penumbras and motion blur in addition to
+                 spatial antialiasing. The shade to be displayed at a
+                 pixel is a weighted integral of the image function. The
+                 purpose of using many rays per pixel is to estimate the
+                 value of this integral. In this work, a relationship
+                 between the number of sample rays and the quality of
+                 the estimate of this integral is derived. Furthermore,
+                 the number of rays required does not depend on the
+                 dimensionality of the space being sampled, but only on
+                 the variance of the multi-dimensional image function.
+                 The algorithm has been optimized through the use of
+                 statistical testing and stratified sampling.",
+  conference =   "held in San Francisco, CA; 22--26 July 1985",
+  keywords =     "I37 ray-tracing, distributed, I3m optimization, I37
+                 motion blur, stratified point sampling, ray tracing
+                 anti aliasing stochastic",
+  who = "Havran Vlastimil: RT-0173",
+}
+
+@Article{Mitchell:1992:RTI,
+  author =       "Don P. Mitchell",
+  title =        "Ray Tracing and Irregularities of Distribution",
+  year =         "1992",
+  month =        may,
+  journal =      "Third Eurographics Workshop on Rendering",
+  pages =        "61--69",
+  address =      "Bristol, UK",
+  keywords =     "monte carlo",
+  who = "Havran Vlastimil: RT-0172",
+}
+
+@inproceedings{Cook84,
+  author = "Robert L. Cook and Thomas Porter and Loren Carpenter",  
+  title = "Distributed Ray Tracing",
+  booktitle = "Computer Graphics (SIGGRAPH '84 Proceedings)",
+  month = jul,
+  year = "1984",
+  pages = "137-45",
+  keywords = "monte carlo, stochastic, penumbrae, depth of field, motion blur,
+             antialiasing",
+  comments = "also in Tutorial: Computer Graphics: Image Synthesis,
+              Computer Society Press, Washington, 1988, pp. 139-147",
+  who = "Havran Vlastimil: RT-0171",
+}
+
+@InProceedings{amanatides84a,
+  author =       "John Amanatides",
+  title =        "Ray Tracing with Cones",
+  pages =        "129--135",
+  booktitle =      "Computer Graphics (SIGGRAPH '84 Proceedings)",
+  volume =       "18",
+  number =       "3", 
+  year =         "1984",
+  month =        jul,   
+  conference =   "held in Minneapolis, Minnesota; 23--27 July 1984",
+  keywords =     "cone tracing, antialiasing, I35 Ray Tracing",
+  annote =       "ray tracing spheres and polygons with circular conical
+                 rays A technique for antialiasing in ray tracing is
+                 presented which utilizes cones instead of rays. Cones
+                 prevent problems generally associated with point
+                 sampling, and therefore allow for more natural images.
+                 The mathematics involved seem only ``pretty'' for
+                 spherical objects, so an acid test has yet to be
+                 performed. \\ A new approach to ray tracing is
+                 introduced. The definition of a ``ray'' is extended
+                 into a cone by including information on the spread
+                 angle and the virtual origin. The advantages of this
+                 approach, which tries to model light propagation with
+                 more fidelity, include a better method of antialiasing,
+                 a way of calculating fuzzy shadows and dull
+                 reflections, a method of calculating the correct level
+                 of detail in a procedural model and texture map, and
+                 finally, a procedure for faster intersection
+                 calculation.",
+  who = "Havran Vlastimil: RT-0170",
+}
+
+@InProceedings{shinya87a, 
+  author =       "Mikio Shinya and Tokiichiro Takahashi and Seiichiro
+                 Naito",
+  title =        "Principles and Applications of Pencil Tracing",
+  pages =        "45--54",   
+  booktitle =      "Computer Graphics (SIGGRAPH '87 Proceedings)",
+  volume =       "21",
+  number =       "4",
+  year =         "1987",
+  month =        jul,
+  editor =       "Maureen C. Stone",
+  conference =   "held in Anaheim, California; 27 -- 31 July 1987",     
+  keywords =     "ray tracing, paraxial theory",
+  annote =       "Pencil tracing, a new approach to ray tracing, is
+                 introduced for faster image synthesis with more
+                 physical fidelity. The paraxial approximation theory
+                 for efficiently tracing a pencil of rays is described
+                 and analysis of its errors is conducted to insure the
+                 accuracy required for pencil tracing. The paraxial
+                 approximation is formulated from a 4x4 matrix (a system
+                 matrix) that provides the basis for pencil tracing and
+                 a variety of ray tracing techniques, such as beam
+                 tracing, ray tracing with cones, ray-object
+                 intersection tolerance, and a lighting model for
+                 reflection and refraction. In the error analysis,
+                 functions that estimate approximation errors and
+                 determine a constraint on the spread angle of a pencil
+                 are given. \\ The theory results in the following fast
+                 ray tracing algorithms; ray tracing using a system
+                 matrix, ray interpolation, and extended `beam tracing'
+                 using a `generalized perspective transform.' Some
+                 experiments are described to show their advantages. A
+                 lighting model is also developed to calculate the
+                 illuminance for refracted and reflected light.",
+  who = "Havran Vlastimil: RT-0169",
+}
+
+@InProceedings{mitchell87a,
+  author =       "Don P. Mitchell",
+  title =        "Generating Antialiased Images at Low Sampling
+                 Densities",
+  pages =        "65--72", 
+  booktitle =      "Computer Graphics (SIGGRAPH '87 Proceedings)",
+  volume =       "21",
+  number =       "4",
+  year =         "1987",
+  month =        jul,
+  editor =       "Maureen C. Stone",
+  conference =   "held in Anaheim, California; 27 -- 31 July 1987",
+  keywords =     "adaptive sampling, antialiasing, filtering, noise
+                 perception, nonuniform sampling, ray tracing,
+                 reconstruction",
+  who = "Havran Vlastimil: RT-0168",
+}
+
+@Article{Heckbert:1984:BTP,
+  author =       "Paul S. Heckbert and Pat Hanrahan",
+  title =        "Beam Tracing Polygonal Objects",
+  journal =      "Computer Graphics (SIGGRAPH'84 Proceedings)",
+  volume =       "18",
+  number =       "3",
+  pages =        "119--127",
+  month =        jul,
+  year =         "1984",
+  coden =        "CGRADI, CPGPBZ",
+  ISSN =         "0097-8930",
+  annote =       "Weiler-Atherton algorithm applied to ray tracing.
+                 Heckbert and Hanrahan present an elegant image space
+                 algorithm for rendering objects composed of polygonal
+                 facets. It utilizes image coherence and generates a
+                 final picture consisting of polygons. \\ Ray tracing
+                 has produced some of the most realistic computer
+                 generated pictures to date. They contain surface
+                 texturing, local shading, shadows, reflections, and
+                 refractions. The major disadvantage of ray tracing
+                 results from its point-sampling approach. Because
+                 calculation proceeds {\em ab initio} at each pixel it
+                 is very CPU intensive and may contain noticeable
+                 aliasing artifacts. It is difficult to take advantage
+                 of spatial coherence because the shapes of reflections
+                 and refractions from curved surfaces are so complex. \\
+                 In this paper we describe an algorithm that utilizes
+                 the spatial coherence of polygonal environments by
+                 combining features of both image and object space
+                 hidden surface algorithms. Instead of tracing
+                 infinitesimally thin rays of light, we sweep areas
+                 through a scene to form ``beams.'' This technique works
+                 particularly well for polygonal models since for this
+                 case the reflections are linear transformation, and
+                 refractions are often approximately so. \\ The
+                 recursive beam tracer begins by sweeping the projection
+                 plane through the scene. Beam-surface intersections are
+                 computed using two-dimensional polygonal set operations
+                 and an occlusion algorithm similar to the
+                 Weiler-Atherton hidden surface algorithm. For each
+                 beam-polygon intersection the beam is fragmented and
+                 new beams created for the reflected and transmitted
+                 swath of light. These sub-beams are redirected with a
+                 4x4 matrix transformation and recursively traced. This
+                 beam tree is an object space representation of the
+                 entire picture.",
+  conference =   "held in Minneapolis, Minnesota; 23--27 July 1984",
+  keywords =     "polygon, ray tracing beam antialiasing,
+                 Weiler-Atherton polygon clipping",
+  who = "Havran Vlastimil: RT-0167",
+}
+
+InProceedings{snyder87a, 
+  author =       "John M. Snyder and Alan H. Barr",
+  title =        "Ray Tracing Complex Models Containing Surface
+                 Tessellations",
+  pages =        "119--128", 
+  booktitle =      "Computer Graphics (SIGGRAPH '87 Proceedings)",
+  volume =       "21",
+  number =       "4",
+  year =         "1987",
+  month =        jul,
+  editor =       "Maureen C. Stone",
+  conference =   "held in Anaheim, California; 27 -- 31 July 1987",   
+  keywords =     "parametric surface, triangle, list, 3d grid",
+  annote =       "An approach to ray tracing complex models containing
+                 mathematically defined surfaces is presented.
+                 Parametric and implicit surfaces, and boolean
+                 combinations of these, are first tessellated into
+                 triangles. The resulting triangles from many such
+                 surfaces are organized into a hierarchy of lists and 3D
+                 grids, allowing efficient calculation of ray/model
+                 intersections. \\ The technique has been used to ray
+                 trace models containing billions of triangles and
+                 surfaces never before traced. The organizing scheme
+                 developed is also independently useful for efficiently
+                 ray tracing any any complex model, whether or not it
+                 contains surfaces tessellations.",
+  who = "Havran Vlastimil: RT-0166",
+}
+
+@Article{Ke93,
+  author =       "Hao-Ren Ke and Ruei-Chuan Chang",
+  title =        "An Efficient Hierarchical Traversal Algorithm for Ray
+                 Tracing",
+  journal =      "Visual Computer",
+  volume =       "10",
+  number =       "2",
+  pages =        "79--87",
+  year =         "1993",
+  keywords =     "efficiency",
+  who = "Havran Vlastimil: RT-0165",
+}
+
+@Article{Ke:1995:RCV,
+  author =       "H. R. Ke and R. C. Chang",
+  title =        "Ray-cast volume rendering accelerated by incremental
+                 trilinear interpolation and cell templates",
+  journal =      "The Visual Computer",
+  year =         "1995",
+  volume =       "11",
+  number =       "6",
+  publisher =    "Springer-Verlag",
+  pages =        "297--308",
+  note =         "ISSN 0178-2789",
+  who = "Havran Vlastimil: RT-0164",
+}
+
+@Article{Ke:1993:SBP,
+  author =       "Hao-ren Ke and Ruei-Chuan Chang",
+  title =        "Sample buffer: {A} progressive refinement ray-casting
+                 algorithm for volume rendering",
+  journal =      "Computers and Graphics",
+  volume =       "17",
+  number =       "3",
+  pages =        "277--283",
+  month =        may # "--" # jun,
+  year =         "1993",
+  coden =        "COGRD2",
+  ISSN =         "0097-8493",
+  bibdate =      "Fri Feb 07 11:04:26 1997",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Natl Chiao Tung Univ",
+  affiliationaddress = "Hsinchu, Taiwan",
+  classification = "723.5; 741.2; 902.1; 921.6",
+  journalabr =   "Comput Graphics (Pergamon)",
+  keywords =     "Algorithms; Color; Image processing; Image quality;
+                 Interpolation; Opacity; Ray casting algorithm; Sample
+                 buffer; Three dimensional computer graphics; Transfer
+                 functions; Transparency; Visualization; Volume data
+                 rendering; Volume visualization",
+  who = "Havran Vlastimil: RT-0163",
+}
+
+@InProceedings{Sung:1991:DOT,
+  author =       "K. Sung",
+  title =        "A {DDA} Octree Traversal Algorithm for Ray Tracing",
+  pages =        "73--85",   
+  booktitle =    "Eurographics '91",
+  year =         "1991",
+  month =        sep,
+  editor =       "Werner Purgathofer",
+  publisher =    "North-Holland",
+  conference =   "European Computer Graphics Conference and Exhibition;
+                 held in Vienna, Austria; 2-6 September 1991",
+  keywords =     "ray tracing",
+  who = "Havran Vlastimil: RT-0162",
+}
+
+@InProceedings{Coquillart:1985:IRT,
+  author =       "S. Coquillart",
+  title =        "An Improvement of the Ray-Tracing Algorithm",
+  booktitle =      "Computer Graphics Forum (Eurographics '85
+                 Proceedings)",
+  volume =       "4",
+  number =       "3",
+  pages =        "77--88",
+  year =         "1985",
+  month =        sep,
+  publisher =    "North-Holland",
+  conference =   "European Computer Graphics Conference and Exhibition  
+                 in Bath, England; 28 -- 29 March 1985",
+  annote =       "This paper describes an improvement of the ray-tracing
+                 algorithm. The new method takes advantage of a data
+                 structure which allows us to consider only the closest
+                 objects to the path of the ray. This technique can be
+                 applied to primary and secondary rays. Using this
+                 method, the run-time depends more on the complexity of
+                 the generated picture than on the complexity of the
+                 scene.",
+  who = "Havran Vlastimil: RT-0161",
+}
+
+@InProceedings{Sousa:1990:IRT,
+  author =       "A. Augusto Sousa and Antonio M. C. Costa and Fernando
+                 N. Ferreira",
+  title =        "Interactive Ray-Tracing for Image Production with
+                 Increasing Realism",
+  pages =        "449--457",
+  booktitle =    "Eurographics '90",
+  year =         "1990",
+  month =        sep,
+  editor =       "C. E. Vandoni and D. A. Duce",
+  publisher =    "North-Holland",
+  conference =   "European Computer Graphics Conference and Exhibition;
+                 held in Montreux, Switzerland; 3 -- 7 September 1990",
+  keywords =     "rendering, interactive ray tracing, increasing
+                 realism, modular and paralle architectures,
+                 transputers, parallel processing",
+  who = "Havran Vlastimil: RT-0160",
+}
+
+@InProceedings{Speer92,
+  author =       "L. Richard Speer",
+  title =        "A New Subdivision Method for High-speed, Memory
+                 Efficient Ray Shooting",
+  booktitle =    "Third Eurographics Workshop on Rendering",
+  pages =        "45--60",
+  address =      "Bristol, UK",
+  month =        may,
+  year =         "1992",
+  who = "Havran Vlastimil: RT-0159",
+}
+
+@Article{Maillot:1992:PRT,
+  author =       "J-L. Maillot and L. Carraro and B. Peroche",
+  title =        "Progressive Ray Tracing",
+  year =         "1992",
+  month =        may,
+  journal =      "Third Eurographics Workshop on Rendering",
+  pages =        "9--20",
+  address =      "Bristol, UK",
+  who = "Havran Vlastimil: RT-0158",
+}
+
+@TechReport{Sherstyuk98:TCHR,
+  author =       "A. Sherstyuk",
+  title =        "Fast Ray Tracing of Implicit Surfaces",
+  year =         "1998",
+  type =         "Technical Report",
+  number =       "1998/04",
+  institution =  "Monash University",
+  keywords =     "implicit surfaces, ray-tracing",
+  who = "Havran Vlastimil: RT-0157",
+}
+
+@TechReport{Sherstyuk97:TCHR,
+  author =       "A. Sherstyuk",
+  title =        "Shells, crabs and seahorses: expanding the modeling power
+                  of implicit surfaces",
+  year =         "1997",
+  type =         "Technical Report",
+  number =       "1997/330",
+  institution =  "Monash University",
+  keywords =     "natural forms, convolution surfaces, geometric modelling,
+                  implicit surfaces",
+  who = "Havran Vlastimil: RT-0156",
+}
+
+@TechReport{McCormack97:TCHR,
+  author =       "J. McCormack and A. Sherstyuk",
+  title =        "Creating and Rendering Convolution Surfaces",
+  year =         "1997",
+  type =         "Technical Report",
+  number =       "1997/324",
+  institution =  "Monash University",
+  keywords =     "convolution surfaces, geometric modelling, implicit surfaces,
+                  ray-tracing",
+  who = "Havran Vlastimil: RT-0155",
+}
+
+@InProceedings{Heckbert87,
+  author =       "Paul S. Heckbert",
+  title =        "Ray Tracing {JELL}-{O} ({R}) Brand Gelatin",
+  booktitle =    "Computer Graphics (SIGGRAPH '87 Proceedings)",
+  pages =        "73--4",
+  month =        jul,
+  year =         "1987",
+  keywords =     "lattice algorithm, Jell-O (TM), gelatin",
+  note =         "revision appears in CACM, Vol. 31, \#2, Feb. 1988, p.
+                 130-134 Published as Computer Graphics (SIGGRAPH '87
+                 Proceedings), volume 21, number 4",
+  who = "Havran Vlastimil: RT-0154",
+}
+
+@Article{Slusallek:1994:IRP,
+  author =       "Ph. Slusallek and Th. Pflaum and H.-P. Seidel",
+  title =        "Implementing {RenderMan} --- Practice, Problems and
+                 Enhancements",
+  volume =       "13",
+  number =       "3",
+  pages =        "C/443--C/454",
+  month =        "????",
+  year =         "1994",
+  coden =        "CGFODY",
+  ISSN =         "0167-7055",
+  bibdate =      "Mon Apr 14 10:23:20 MDT 1997",
+  acknowledgement = ack-nhfb,
+  classification = "C6130B (Graphics techniques); C6150E (General
+                 utility programs); C6180 (User interfaces)",
+  conflocation = "Oslo, Norway; 12-16 Sept. 1994",
+  conftitle =    "15th Annual Conference and Exhibition.
+                 EUROGRAPHICS'94",
+  corpsource =   "Comput. Graphics Group, Erlangen Univ., Germany",
+  keywords =     "interfaces; rendering (computer graphics); Rendering
+                 systems; rendering systems; RenderMan; Shading
+                 Language; solid modelling; user",
+  thesaurus =    "Rendering [computer graphics]; Solid modelling; User
+                 interfaces",
+  treatment =    "A Application; P Practical",
+  url =          "http://visinfo.zib.de/EVlib/Show?EVL-1994-19",
+  language =     "en",
+  abstract =     "The RenderMan interface has been proposed as a general
+                 interface to rendering systems, yet only a few
+                 implementations of the interface exist. In this paper
+                 we describe the implementation of the RenderMan
+                 interface on a general rendering architecture that
+                 supports various rendering algorithms. Speci,cally we
+                 discuss the implementation of the RenderMan Shading
+                 Language and its integration into our rendering
+                 architecture. Special attention is focused on the
+                 problems that we have encountered and how they can be
+                 solved. Additionally, we suggest extensions and
+                 enhancements to the current interface de,nition, which
+                 would make RenderMan easier to implement and more
+                 ,exible to use.",
+  journal =      "Computer Graphics Forum (Proc. Eurographics '94)",
+  who = "Havran Vlastimil: RT-0153",
+}
+
+@InProceedings{Rushmeier93,
+  author =       "Holly E. Rushmeier and Charles Patterson and Aravindan
+                 Veerasamy",
+  title =        "Geometric Simplification for Indirect Illumination
+                 Calculations",
+  booktitle =    "Proc. Graphics Interface '93",
+  publisher =    "Canadian Inf. Proc. Soc.",
+  address =      "Toronto, Ontario",
+  month =        may,
+  year =         "1993",
+  pages =        "227--236",
+  keywords =     "Monte Carlo, progressive refinement, ray tracing,
+                 multiresolution modeling",
+  note = "http://www.cc.gatech.edu/gvu/people/Phd/Charles.Patterson",
+  annote =       "multiresolution model creation (clustering) not fully
+                 automated",
+  who = "Havran Vlastimil: RT-0152",
+}
+
+@InProceedings{Shirley:1991:RTF,
+  author =       "Peter Shirley and Kelvin Sung and William Brown",
+  title =        "A Ray Tracing Framework for Global Illumination
+                 Systems",
+  pages =        "117--128",
+  booktitle =    "Proceedings of Graphics Interface '91",
+  year =         "1991",
+  month =        jun,
+  conference =   "held in Calgary, Alberta; 3-7 June 1991",
+  keywords =     "ray tracing, radiosity, object-oriented design,
+                 software components, zonal method, visual realism",
+  who = "Havran Vlastimil: RT-0151",
+}
+
+@InProceedings{Marton:1996:SEM,
+  author =       "L. {Szirmay-Kalos} and G. Marton",
+  title =        "On the Complexity of Ray Shooting",
+  booktitle =    "Dagstuhl Seminar on Rendering, 1996",
+  year =         "1996",
+  who = "Havran Vlastimil: RT-0150",
+}
+
+@PhdThesis{bronsvoort90a,
+  author =       "Willem F. Bronsvoort",
+  title =        "Direct Display Algorithms for Solid Modelling",
+  month =        jun,
+  year =         "1990",
+  type =         "Ph.D. Thesis",
+  school =       "Delft University of Technology",
+  annote =       "Advisor: Denis J. McConalogue In this thesis
+                 algorithms are discussed for displaying geometric
+                 models of three-dimensional objects. An important use
+                 of such algorithms is in CAD/CAM-systems to give the
+                 designer insight in the shape of the design. \\ Of
+                 particular concern here are direct display algorithms
+                 for constructive solid geometry models and generalized
+                 cylinders. `Direct' in this context means that a solid
+                 object is displayed without the need to convert its
+                 model into a boundary representation providing the
+                 information about faces, edges and vertices required by
+                 the standard display algorithms. \\ For constructive
+                 solid geometry models, the starting point is a
+                 collection of primitive objects, such as cubes, spheres
+                 and cylinders, that can be combined into more complex
+                 objects with set operations. The two alternatives for
+                 displaying such models, namely conversion into a
+                 boundary representation followed by display with a
+                 standard algorithm, and direct display with an adapted
+                 algorithm, are weighed. An overview of direct display
+                 algorithms for constructive solid geometry models is
+                 also given. \\ Generalized cylinders are objects
+                 defined by an arbitrary two-dimensional contour, or
+                 cross-section, and an arbitrary three-dimensional
+                 trajectory along which to sweep the contour. With
+                 profiled generalized cylinders, the contour can be
+                 scaaed along the trajectory in two perpendicular
+                 directions according to two profile curves. An exact
+                 definition of such objects is given. Here also the
+                 alternative for display, namely conversion into a
+                 boundary representation followed by display with a
+                 standard algorithm, and direct display with a special
+                 algorithm, are compared. \\ Finally, some conclusions
+                 are drawn, and directions for further research on
+                 direct display algorithms for solid models are
+                 identified.",
+  who = "Havran Vlastimil: RT-0149",
+}
+
+@InProceedings{kajiya83a,
+  author =       "J. T. Kajiya",
+  title =        "New Techniques For Ray Tracing Procedurally Defined
+                 Objects",
+  pages =        "91--102",
+  booktitle =      "Computer Graphics (SIGGRAPH '83 Proceedings)",
+  volume =       "17",
+  number =       "3",
+  year =         "1983",
+  month =        jul,
+  conference =   "held in Detroit, Michigan; 25--29 July 1983",
+  keywords =     "I37 fractal surfaces, I37 prisms, I37 ray tracing, I37
+                 surfaces of revolution, ray tracing intersect,
+                 procedural models, fractals, revolution, prisms",
+  annote =       "Also appears in {\bf Tutorial: Computer Graphics:
+                 Image Synthesis}, Kenneth I. Joy, Charles W. Grant,
+                 Nelson L. Max, and Lansing Hatfield (eds.), Computer
+                 Society Press, Washington, 1988, p. 168-188. \\ We
+                 present new algorithms for efficient ray tracing of
+                 three procedurally defined objects: fractal surfaces,
+                 prisms, and surfaces of revolution. The fractal surface
+                 algorithm performs recursive subdivision adaptively.
+                 Subsurfaces which cannot intersect a given ray are
+                 culled from further consideration. The prism algorithm
+                 transforms the three-dimensional ray-surface
+                 intersection problem into a two-dimensional ray-curve
+                 intersection problem, which is solved by the method of
+                 strip trees. The surface-of-revolution algorithm
+                 transforms the three-dimensional ray-surface
+                 intersection problem into a two-dimensional curve-curve
+                 intersection problem, which again is solved by strip
+                 trees. \\ Kajiya presents good solid methods for ray
+                 tracing various models which are represented
+                 procedurally. Fractals are ray traced as they are
+                 built, which keeps unseen fractal surfaces from being
+                 evolved. Prisms are ray traced in a fairly simple
+                 fashion. A clever use of geometric transforms is used
+                 to ray trace surfaces of revolution. Makes good use of
+                 strip trees (see Ballard).",
+  who = "Havran Vlastimil: RT-0148",
+}
+
+@Article{Hanrahan:1983:RTA,
+  author =       "Pat Hanrahan",
+  title =        "Ray Tracing Algebraic Surfaces",
+  journal =      "Computer Graphics (SIGGRAPH '83 Proceedings)",
+  volume =       "17",
+  number =       "3",
+  pages =        "83--90",
+  month =        jul,
+  year =         "1983",
+  coden =        "CGRADI, CPGPBZ",
+  ISSN =         "0097-8930",
+  annote =       "numerical techniques for finding roots of polynomials
+                 \\ Many interesting surfaces can be written as
+                 polynomial functions of the spatial coordinates, often
+                 of low degree. We present a method based on a ray
+                 casting algorithm, extended to work in more than three
+                 dimensions, to produce pictures of these surfaces. The
+                 method uses a symbolic algebra system to automatically
+                 derive the equation of intersection between the ray and
+                 the surface and then solves this equation using an
+                 exact polynomial root finding algorithm. \\ Included
+                 are illustrations of the cusp catastrophe surface, and
+                 two unusually shaped quartic surfaces, Kummer's
+                 quadruple and Steiner's surface.",
+  conference =   "held in Detroit, Michigan; 25--29 July 1983",
+  keywords =     "root finding, algebraic surface, ray tracing intersect
+                 blob, I33 ray tracing, I37 algebraic surface",
+  who = "Havran Vlastimil: RT-0147",
+}
+
+@InProceedings{heidrich-gi98,
+  title =        "Ray-Tracing Procedural Displacement Shaders",
+  author =       "Wolfgang Heidrich and Hans-Peter Seidel",
+  booktitle =    "Graphics Interface",
+  year =         "1998",
+  month =        jun,
+  pages =        "8--16",
+  url =          "http://www.dgp.toronto.edu/gi/gi98/papers/111/111.html",
+  who = "Havran Vlastimil: RT-0146",
+}
+
+@inproceedings{gonzalez:cgi:98,
+  author = "P. Gonzalez and F. Gisbert",
+  title = "Object and Ray Coherence in the Optimization of the
+           Ray Tracing Algorithm",
+  booktitle = "Proceedings of Computer Graphics International '98 (CGI'98)",
+  year = "1998",
+  month = jun,
+  pages = "264--267",
+  address = "Hannover, Germany",
+  publisher = "IEEE, NY",
+  who = "Havran Vlastimil: RT-0145",
+}
+
+@Article{Moeller:1997:FMS,
+  author =       "Tomas M{\"{o}}ller and Ben Trumbore",
+  title =        "Fast, Minimum Storage Ray-Triangle Intersection",
+  journal =      "Journal of Graphics Tools",
+  year =         "1997",
+  volume =       "2",
+  number =       "1",
+  note =         "ISSN 1086-7651",
+  annote =       "We present a clean algorithm for determining whether a
+                 ray intersects a triangle. The algorithm translates the
+                 origin of the ray and then changes the base to yield a
+                 vector (t u v)T, where t is the distance to the plane
+                 in which the triangle lies and (u,v) represents the
+                 coordinates inside the triangle. One advantage of this
+                 method is that the plane equation need not be computed
+                 on the fly nor be stored, which can amount to
+                 significant memory savings for triangle meshes. As we
+                 found our method to be comparable in speed to previous
+                 methods, we believe it is the fastest ray-triangle
+                 intersection routine for triangles that do not have
+                 precomputed plane equations.",
+  who = "Havran Vlastimil: RT-0144",
+}
+
+@Article{pulleyblank87a,
+  author =       "Ron Pulleyblank and John Kapenga",
+  title =        "The Feasibility of a {VLSI} Chip for Ray Tracing
+                 Bicubic Patches",
+  pages =        "33--44",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "7",
+  number =       "3",
+  year =         "1987",
+  month =        mar,
+  keywords =     "bicubic patch",
+  annote =       "Also appears as ``A VLSI Chip for Ray Tracing Bicubic
+                 Patches'' in {\bf Advances in Computer Graphics
+                 Hardware I}, W. Stra\mbox{\ss}er (ed.), 1987, p.
+                 125-140. \\ In this article we explore the possibility
+                 of a VLSI chip for ray tracing bicubic patches in
+                 B\'{e}zier form. The purpose of the chip is to
+                 calculate the intersection point of a ray with the
+                 bicubic patch to a specified level of accuracy,
+                 returning parameter values $(u,v)$ specifing the
+                 location of the intersection on the patch, and a
+                 parameter value, $t$, which specifies the location of
+                 the intersection on the ray. The intersection is
+                 calculated by successively subdividing the patch and
+                 computing the intersection of the ray with a bounding
+                 box of each subpatch until the bounding volume meets
+                 the accuracy requirement. There are two operating
+                 modes: one in which only the nearest intersection is
+                 found, and another in which all intersections are
+                 found. This algorithm (and the chip) correctly handle
+                 the difficult cases of the ray tangentially
+                 intersecting a planar patch and intersections of the
+                 ray at a silhouette edge of the patch. Estimates
+                 indicate that such a chip could be implemented with
+                 2-micron NMOS (N-type metal oxide semiconductor) and
+                 could compute patch-ray intersections at the rate of
+                 one every 15 microseconds for patches that are
+                 prescaled and specified to a 12-bit fixed point for
+                 each of the $x, y$, and $z$ components. A version
+                 capable of handling 24-bit patches could compute
+                 patch-ray intersections at the rate of one every 140
+                 microseconds. Calculations of the normal at the
+                 intersection point could be performed with the addition
+                 of Re scalar subtractions and six scalar multiplies.
+                 Images drawn using a software version of the algorithm
+                 are presented and discussed.",
+   who = "Havran Vlastimil: RT-0143",
+}
+
+@InProceedings{Pearce:1991:ESC,
+  author =       "Andrew Pearce and David Jevans",
+  title =        "Exploiting Shadow Coherence in Ray Tracing",
+  pages =        "109--116",
+  booktitle =    "Proceedings of Graphics Interface '91",
+  year =         "1991",
+  month =        jun,
+  conference =   "held in Calgary, Alberta; 3-7 June 1991",
+  keywords =     "ray tracing, shadow testing, shadow caching, spatial
+                 subdivision",
+  who = "Havran Vlastimil: RT-0142",
+}
+
+@Article{haines86a,
+  author =       "Eric A. Haines and Donald P. Greenberg",
+  title =        "The Light Buffer: {A} Ray Tracer Shadow Testing
+                 Accelerator",
+  pages =        "6--16",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "6",
+  number =       "9",
+  year =         "1986",
+  month =        sep,
+  keywords =     "shading, ray tracing, shadows, ray tracing shadow
+                 cull",
+  abstract =     "In one area of computer graphics, realistic image
+                 synthesis, the ultimate goal is to produce a picture
+                 indistinguishable from a photograph of a real
+                 environment. A particularly powerful technique for
+                 simulating light reflection---an important element in
+                 creating this realism---is called ray tracing. This
+                 method produces images of excellent quality, but
+                 suffers from lengthy computation time that limits its
+                 practical use. \\ This article presents a new method to
+                 reduce shadow testing time during ray tracing. The
+                 technique involves generating light buffers, each of
+                 which partition the environment with respect to an
+                 individual light source. These partition descriptions
+                 are then used during shadow testing to quickly
+                 determine a small subset of objects that may have to be
+                 tested for intersection. \\ The results of timing tests
+                 illustrate the beneficial performance of these
+                 techniques. The tests compare the standard ray-tracing
+                 algorithm to light buffers of varying resolution.",
+  who = "Havran Vlastimil: RT-0141",
+}
+
+@InProceedings{shirley90b,
+  author =       "Peter Shirley",
+  title =        "A Ray Tracing Method for Illumination Calculation in
+                 Diffuse-Specular Scenes",
+  pages =        "205--212",
+  booktitle =      "Proceedings of Graphics Interface '90",
+  year =         "1990",
+  month =        may,
+  conference =   "held in Halifax, Nova Scotia; 14-18 May 1990",
+  keywords =     "bump mapping, illumination, radiosity, radiance, ray
+                 tracing, realism, stratified sampling, texture
+                 mapping",
+  annote =       "Several ways of improving the realism of the results
+                 of traditional ray tracing are presented. The essential
+                 physical quantities of spectral radiant power and
+                 spectral radiance and their use in lighting
+                 calculations are discussed. Global illumination terms
+                 are derived by employing illumination ray tracing for
+                 calculation of quickly changing indirect lighting
+                 components, and radiosity ray tracing for slowly
+                 changing indirect lighting components. Direct lighting
+                 is calculated during the viewing phase allowing the use
+                 of bump maps. Finally, a method is introduced that
+                 reduces the total number of shadow rays to no more than
+                 the total number of viewing rays for a given picture.",
+  who = "Havran Vlastimil: RT-0140",
+}
+
+@InProceedings{Shirley:1991:DLC,
+  author =       "Peter Shirley and Changyaw Wang",
+  title =        "Direct lighting calculation by Monte Carlo
+                 integration",
+  booktitle =    "Eurographics Workshop on Rendering",
+  year =         "1991",
+  conference =   "held in Barcelona, Spain; 13-15 May 1991",
+  keywords =     "monte carlo, illumination",
+  annote =       "Application of Monte Carlo techniques for rendering
+                 scenes with multiple light sources. Only one shadow ray
+                 per viewing ray is used. Some issues for the design of
+                 probability densities for light sources are given.",
+  who = "Havran Vlastimil: RT-0139",
+}
+
+@Article{Shirley:1996:MCT,
+  author =       "Peter Shirley and Changyaw Wang and Kurt Zimmerman",
+  title =        "{Monte Carlo} Techniques for Direct Lighting
+                 Calculations",
+  journal =      "ACM Transactions on Graphics",
+  volume =       "15",
+  number =       "1",
+  pages =        "1--36",
+  month =        jan,
+  year =         "1996",
+  coden =        "ATGRDF",
+  ISSN =         "0730-0301",
+  bibdate =      "Wed Apr 24 07:49:27 1996",
+  url =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/225887.html,
+                 http://www.acm.org/pubs/toc/Abstracts/0730-0301/226151.html",
+  abstract =     "In a distributed ray tracer, the sampling strategy is
+                 the crucial part of the direct lighting calculation.
+                 Monte Carlo integration with importance sampling is
+                 used to carry out this calculation. Importance sampling
+                 involves the design of integrand-specific probability
+                 density functions that are used to generate sample
+                 points for the numerical quadrature. Probability
+                 density functions are presented that aid in the direct
+                 lighting calculation from luminaires of various simple
+                 shapes. A method for defining a probability density
+                 function over a set of luminaires is presented that
+                 allows the direct lighting calculation to be carried
+                 out with a number of sample points that is independent
+                 of the number of luminaires.",
+  acknowledgement = ack-nhfb,
+  keywords =     "algorithms; design; theory",
+  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
+                 STATISTICS. {\bf G.1.4}: Mathematics of Computing,
+                 NUMERICAL ANALYSIS, Quadrature and Numerical
+                 Differentiation. {\bf I.3.0}: Computing Methodologies,
+                 COMPUTER GRAPHICS, General. {\bf I.4.1}: Computing
+                 Methodologies, IMAGE PROCESSING, Digitization,
+                 Sampling.",
+   who = "Havran Vlastimil: RT-0138",
+}
+
+@InProceedings{Shirley92-DRTTP,
+  author =       "Peter Shirley and Changyaw Wang",
+  month =        may,
+  year =         "1992",
+  title =        "Distribution {Ray} {Tracing}: {Theory} and
+                 {Practice}",
+  booktitle =    "Third Eurographics Workshop on Rendering",
+  pages =        "33--43",
+  address =      "Bristol, UK",
+  keywords =     "Monte Carlo",
+  who = "Havran Vlastimil: RT-0137",
+}
+
+@Article{Musgrave:1989:SRE,
+  author =       "F. Kenton Musgrave and Craig E. Kolb and Robert S.
+                 Mace",
+  editor =       "Jeffrey Lane",
+  title =        "The Synthesis and Rendering of Eroded Fractal
+                 Terrains",
+  journal =      "Computer Graphics (SIGGRAPH '89 Proceedings)",
+  volume =       "23",
+  number =       "3",
+  pages =        "41--50",
+  month =        jul,
+  year =         "1989",
+  coden =        "CGRADI, CPGPBZ",
+  ISSN =         "0097-8930",
+  annote =       "info on efficiently ray tracing height fields \\ In
+                 standard fractal terrain models based on fractional
+                 Brownian motion the statistical character of the
+                 surface is, by design, the same everywhere. A new
+                 approach to the synthesis of fractal terrain height
+                 fields is presented which, in contrast to previous
+                 techniques, features locally independent control of the
+                 frequencies composing the surface, and thus local
+                 control of fractal dimension and other statistical
+                 characteristics. The new technique, termed {\em noise
+                 synthesis}, is intermediate in difficulty of
+                 implementation, between simple stochastic subdivision
+                 and Fourier filtering or generalized stochastic
+                 subdivision, and does not suffer the drawbacks of
+                 creases or periodicity. Varying the local crossover
+                 scale of fractal character or the fractal dimension
+                 with altitude or other functions yields more realistic
+                 first approximations to eroded landscapes. A simple
+                 physical erosion model is then suggested which
+                 simulates hydraulic and thermal erosion processes to
+                 create global stream/valley networks and talus slopes.
+                 Finally, an efficient ray tracing algorithm for general
+                 height fields, of which most fractal terrains are a
+                 subset, is presented.",
+  conference =   "held in Boston, Massachusetts; 31 July -- 4 August
+                 1989",
+  keywords =     "fractal, terrain models, stochastic subdivision,
+                 fractional Brownian motion, fractal dimension,
+                 lacunarity, crossover scale, erosion models, height
+                 fields, ray tracing",
+  who = "Havran Vlastimil: RT-0136",
+}
+
+@InProceedings{musgrave89c,
+  author =       "F. Kenton Musgrave",
+  title =        "Prisms and rainbows: a dispersion model for computer
+                 graphics",
+  pages =        "227--234",
+  booktitle =      "Proceedings of Graphics Interface '89",
+  year =         "1989",
+  month =        jun,
+  conference =   "held in London, Ontario; 19-23 June 1989",
+  keywords =     "refraction, stochastic sampling, distributed ray
+                 tracing, spectrum, color gamut",
+  annote =       "{\em Dispersion} is the spreading of refracted light
+                 into its component colors or spectrum. A model of
+                 refraction including dispersion is developed using the
+                 techniques of distributed ray tracing. Two models of
+                 the rainbow, one empirical or impressionistic, the
+                 other purely physical, are developed using the results
+                 of the dispersion model. The problem of representing
+                 the spectrum of monochromatic colors using the rgb
+                 primaries of the graphics color monitor is addressed.",
+  who = "Havran Vlastimil: RT-0135",
+}
+
+@TechReport{Musgrave:1988:GTF,
+  author =       "F. Kenton Musgrave",
+  title =        "Grid Tracing: Fast Ray Tracing for Height Fields",
+  year =         "1988",
+  type =         "Technical Report",
+  number =       "YALEU/DCS/RR-639",
+  institution =  "Yale University Dept. of Computer Science Research",
+  keywords =     "parallel processing",
+  annote =       "An implementation of ray tracing using Linda. \\ A
+                 fast algorithm for ray tracing height fields is
+                 presented. The algorithm employs a modified Bresenham
+                 DDA to traverse a two dimensional array of height
+                 values. At each cell the altitude of the ray is
+                 compared with the heights of the four corners of the
+                 cell; ray/object intersections need only be calculated
+                 when the altitude of the ray is in the range of those
+                 heights. The average number of ray/object intersections
+                 performed is about two per ray; the two objects tested
+                 for intersection are located in $O(\sqrt{N-1})$ time
+                 where $N$ is the number of height values in the
+                 field.",
+  who = "Havran Vlastimil: RT-0134",
+}
+
+@InProceedings{Chapman90,
+  author =       "John Chapman and Thomas W. Calvert and John Dill",
+  title =        "Exploiting Temporal Coherence in Ray Tracing",
+  booktitle =    "Proceedings of Graphics Interface '90",
+  pages =        "196--204",
+  publisher =    "Canadian Information Processing Society",
+  address =      "Toronto, Ontario",
+  month =        may,
+  year =         "1990",
+  keywords =     "animation, temporal coherence",
+  who = "Havran Vlastimil: RT-0133",
+}
+
+@InProceedings{Woo:1990:VOT,
+  author =       "Andrew Woo and John Amanatides",
+  title =        "Voxel Occlusion Testing: {A} Shadow Determination
+                 Accelerator for Ray Tracing",
+  pages =        "213--220",
+  booktitle =    "Proceedings of Graphics Interface '90",
+  year =         "1990",
+  month =        may,
+  conference =   "held in Halifax, Nova Scotia; 14-18 May 1990",
+  keywords =     "grid, intersection culling, occlusion, penumbra, ray
+                 tracing, shadows, umbra, voxel traversal",
+  annote =       "A shadow determination accelerator for ray tracing is
+                 presented. It is built on top of the uniform voxel
+                 traversal grid structure. The accelerator proves to be
+                 rather efficient, requires little additional memory and
+                 the worst case scenario per shadow determination just
+                 reduces down to traditional voxel traversal. It can
+                 also be extended to model linear, area lights, as well
+                 as atmospheric shadows.",
+  who = "Havran Vlastimil: RT-0132",
+}
+
+@InProceedings{Jevans92,
+  author =       "David Jevans",
+  title =        "Object Space Temporal Coherence for Ray Tracing",
+  booktitle =    "Proceedings of Graphics Interface '92",
+  pages =        "176--183",
+  publisher =    "Canadian Information Processing Society",
+  address =      "Toronto, Ontario",
+  month =        may,
+  year =         "1992",
+  keywords =     "temporal coherence, efficiency, space subdivision",
+  who = "Havran Vlastimil: RT-0131",
+}
+
+@InProceedings{Woo:1992:RTP,
+  author =       "Andrew Woo",
+  title =        "Ray tracing polygons using spatial subdivision",
+  pages =        "184--191",
+  booktitle =    "Proceedings of Graphics Interface '92",
+  year =         "1992",
+  month =        may,
+  conference =   "held in Vancouver, B.C.; 11-15 May 1992",
+  keywords =     "intersection culling, subdivision, voxel traversal",
+  who = "Havran Vlastimil: RT-0130",
+}
+
+@InProceedings{Marton95a,
+  author =       "Gabor Marton",
+  editor =       "H.P. Seidel, B. Girod, H. Niemann",
+  title =        "Surfaces for Ray Tracing: A Fast View-Dependent Algorithm",
+  booktitle =    "Proceedings of 3D Image Analysis and Synthesis '97",
+  pages =        "19--26",
+  year =         "1997",
+  month =   nov,
+  who = "Havran Vlastimil: RT-0129",
+}
+
+@InCollection{Marton95b,
+  author =       "Gabor Marton",
+  editor =       "Alan W. Paeth",
+  title =        "Acceleration of Ray Tracing via Voronoi Diagrams",
+  booktitle =    "Graphics Gems V",
+  pages =        "268--284",
+  publisher =    "Academic Press",
+  address =      "Boston MA",
+  year =         "1995",
+  who = "Havran Vlastimil: RT-0128",
+}
+
+@InCollection{Moeller95a,
+  author =       "Tomas Moeller",
+  editor =       "Alan W. Paeth",
+  title =        "A Linear-time simple bounding volume algorithm",
+  booktitle =    "Graphics Gems V",
+  pages =        "242--257",
+  publisher =    "Academic Press",
+  address =      "Boston MA",
+  year =         "1995",
+  who = "Havran Vlastimil: RT-0127",
+}
+
+@InCollection{Wu93a,
+  author =       "Xiaolin Wu",
+  editor =       "David Kirk",
+  title =        "A Linear-time simple bounding volume algorithm",
+  booktitle =    "Graphics Gems III",
+  pages =        "301-306",
+  publisher =    "Academic Press",
+  address =      "San Diego",
+  year =         "1992",
+  who = "Havran Vlastimil: RT-0126",
+}
+
+@Unpublished{Subramanian91a,
+ author = "K.R. Subramanian and D.S. Fussel",
+  title = "Applying Space Subdivision Techniques to Volume Rendering",
+  pages = 9,
+  institution = "The University of Texas at Austin",
+  year = 1991,
+  note = "from WWW",
+  who = "Havran Vlastimil: RT-0125",
+}
+
+@TechReport{Subramanian92a,
+  author = "K.R. Subramanian and D.S. Fussel",
+  title = "A Search Structure based on K-d Trees for Efficient Ray Tracing",
+  pages = 39,
+  institution = "The University of Texas at Austin",
+  year = 1992,
+  number = "Tx 78712-1188",
+  who = "Havran Vlastimil: RT-0124",
+}
+
+@TechReport{Subramanian90a,
+  author = "K.R. Subramanian and D.S. Fussel",
+  title = "Factors Affecting Performance of Ray Tracing Hierarchies",
+  pages = 27,
+  institution = "The University of Texas at Austin",
+  year = 1990,
+  month = jul,
+  number = "Tx 78712",
+  who = "Havran Vlastimil: RT-0123",
+}
+
+@Unpublished{Duc97a,
+  author = "N.C. Duc",
+  title = "An exploration of coherence-based acceleration methods
+using the ray tracing kernel G/GX",
+  year = 1997,
+  month = mar,
+  note = "from WWW",
+  who = "Havran Vlastimil: RT-0122",
+}
+
+@InProceedings{Groeller93a,
+  author =       "E. Groeller",
+  title =        "Oct-tracing animation sequences",
+  pages =        "96--101",
+  booktitle =    "Summer school in computer graphics in Bratislava (SCCG93)",
+  year =         "1993",
+  month =        jun,
+  keywords =     "ray tracing",
+  who  = "Havran Vlastimil: RT-0121",
+}
+
+@InProceedings{Martinka94,
+  author =       "J. Martinka",
+  title =        "Pouzitie octree struktury na urychlenie metody ray tracing",
+  booktitle =    "Winter School of Computer Graphics 1994",
+  year =         "1994",
+  month =        "feb",
+  pages =        "106--112",
+  note =         "held at University of West Bohemia, Plzen, Czech
+                 Republic, February 1994",
+  who = "Havran Vlastimil: RT-0120",
+}
+
+@InProceedings{Kolingerova92,
+  author =       "I. Kolingerova",
+  title =        "Vyuziti dualniho prostoru pro metodu sledovani paprsku",
+  booktitle =    "Winter School of Computer Graphics 1992",
+  year =         "1992",
+  month =        "feb",
+  pages =        "66--80",
+  note =         "held at University of West Bohemia, Plzen, Czech
+                 Republic, February 1992",
+  who = "Havran Vlastimil: RT-0119",
+}
+
+@Article{Arvo88a,
+  author="J. Arvo",
+  title="Linear-time Voxel Walking for Octrees",
+  journal="Ray Tracing News (available at htpp://www.acm.org/tog/resources/RTNew
+s/html/rtnews2d.html)",
+  year="1988",
+  editor = "Eric Haines",
+  volume="1",
+  number="5",
+  pages="",
+  owner  = "Havran Vlastimil: RT-0118",
+}
+
+@InProceedings{Sramek92a,
+  author =       "M. \v{S}r\'{a}mek",
+  title =        "Ray tracing volume data with subvoxel precision",
+  booktitle =    "Winter School of Computer Graphics 1992",
+  year =         "1992",
+  month =        feb,
+  pages = "47--65",
+  note =         "held at University of West Bohemia, Plzen, Czech
+                 Republic, February 1992",
+  who = "Havran Vlastimil: RT-0117",
+}
+
+@Unpublished{Schregle96a,
+  author = "Roland Schregle",
+  title = "t\_{}DistLight A Distributed Light Source Class for the Minimal Ray Tracer",
+  year = 1996,
+  month = sep,
+  note = "from WWW",
+  who = "Havran Vlastimil: RT-0116",
+}
+
+@InProceedings{Stuerzlinger94a,
+  author =       "Wolfgang Stuerzlinger and R.F. Tobler",
+  title =        "Two Optimization Methods for Raytracing",
+  pages =        "104--107",
+  booktitle =    "Summer school in computer graphics in Bratislava (SCCG94)",
+  year =         "1994",
+  month =        jun,
+  keywords =     "ray tracing",
+  who  = "Havran Vlastimil: RT-0115",
+}
+
+@Misc{Qual96a,
+  author =    "Matthew Quail",
+  title =     "Space Time Ray Tracing using Ray Classification",
+  howpublished = "Bachelor thesis",
+  year =      "1996",
+  month =     nov,
+  who  = "Havran Vlastimil: RT-0114",
+}
+
+@InProceedings{Stuerzlinger96a,
+  author =       "Wolfgang Stuerzlinger",
+  title =        "Bounding Volume Construction using Point Clouds",
+  pages =        "239--246",
+  booktitle =    "Summer school in computer graphics in Bratislava (SCCG96)",
+  year =         "1996",
+  month =        jun,
+  keywords =     "bounding volume, bounding volume hierarchy, ray tracing",
+  who  = "Havran Vlastimil: RT-0113",
+}
+
+@Unpublished{Smith95a,
+  author = "Otto J.A. Smith",
+  title = "Ray-Tracing with Affine Transforms",
+  year = 1995,
+  month = jan,
+  note = "from WWW",
+  who = "Havran Vlastimil: RT-0112",
+}
+
+@Unpublished{Cak96a,
+  author = "S. Cak",
+  title = "An Effective Rendering System for Visual Realism",
+  year = 1996,
+  month = dec,
+  note = "from WWW",
+  who = "Havran Vlastimil: RT-0111",
+}
+
+@MastersThesis{Duc96a,
+  author =       "N.C. Duc",
+  title =        "Adaptives Verfahren zur Beschleunigung der generativen
+                  3D-Grafikberechnung",
+  school =       "Technical University Dresden",
+  year =         "1996",
+  month =     "july",
+  note =      "in German",
+  who = "Havran Vlastimil: RT-0110",
+}
+
+@Unpublished{Fellner93b,
+  author = "D.W. Fellner",
+  title = "Extensible Image Synthesis",
+  pages = "1--18",
+  year = 1993,
+  month = apr,
+  note = "from WWW",
+  anote = "similar to RT-0108",
+  who = "Havran Vlastimil: RT-0109",
+}
+
+@Unpublished{Fellner93a,
+  author = "D.W. Fellner",
+  title = "Extensible Image Synthesis",
+  pages = "1--14",
+  year = 1993,
+  month = apr,
+  note = "from WWW",
+  anote = "similar to RT-0109",
+  who = "Havran Vlastimil: RT-0108",
+}
+
+@Unpublished{Aguado96,
+  author = "F.A. Aguado and F. F. Perez and A. Formella",
+  title = "Fast Ray Tracing for Microcellular and Indoor Environments",
+  pages = "1--4",
+  year = 1996,
+  month = mar,
+  note = "concerns radio waves",
+  who = "Havran Vlastimil: RT-0107",
+}
+
+@TechReport{Teller96rep,
+  author = "S. Teller and K. Bala and J. Dorsey",
+  title = "Conservative Interpolants for Ray Tracing",
+  pages = "1--13",
+  institution = "MIT",
+  year = 1996,
+  month = apr,
+  number = "MIT/LCS/TM-549",
+  who = "Havran Vlastimil: RT-0106",
+}
+
+@InCollection{Woo90a,
+  author =       "Andrew Woo",
+  editor =       "Andrew S. Glassner",
+  title =        "Fast Ray-Box Intersection",
+  booktitle =    "Graphics Gems",
+  pages =        "395--396",
+  publisher =    "Academic Press",
+  address =      "San Diego",
+  year =         "1990",
+  keywords =     "efficiency",
+  who = "Havran Vlastimil: RT-0105",
+}
+
+@InCollection{Woo90,
+  author =       "Andrew Woo",
+  editor =       "Andrew S. Glassner",
+  title =        "Fast Ray-Polygon Intersection",
+  booktitle =    "Graphics Gems",
+  pages =        "394",
+  publisher =    "Academic Press",
+  address =      "San Diego",
+  year =         "1990",
+  keywords =     "efficiency",
+  note =         "includes code",
+  who = "Havran Vlastimil: RT-0104",
+}
+
+@InCollection{Haines91,
+  author =       "Eric Haines",
+  editor =       "James Arvo",
+  title =        "Fast Ray-Convex Polyhedron Intersection",
+  booktitle =    "Graphics Gems II",
+  pages =        "247--250",
+  publisher =    "Academic Press",
+  address =      "San Diego",
+  year =         "1991",
+  keywords =     "efficiency",
+  note =         "includes code",
+  who = "Havran Vlastimil: RT-0103",
+}
+
+@InCollection{Ritter90,
+  author =       "Jack Ritter",
+  editor =       "Andrew S. Glassner",
+  title =        "A Simple Ray Rejection Test",
+  booktitle =    "Graphics Gems",
+  pages =        "385--386",
+  publisher =    "Academic Press",
+  address =      "San Diego",
+  year =         "1990",
+  who = "Havran Vlastimil: RT-00102",
+}
+
+@InCollection{Cychosz92a,
+  author =       "Joseph M. Cychosz",
+  editor =       "David Kirk",
+  title =        "Use of Residency Masks and Object Space Partitioning
+                 to Eliminate Ray-Object Intersection Calculations",
+  booktitle =    "Graphics Gems III",
+  pages =        "284--287",
+  publisher =    "Academic Press",
+  address =      "San Diego",
+  year =         "1992",
+  who = "Havran Vlastimil: RT-0101",
+}
+
+@InCollection{Haines91a,
+  author =       "Eric Haines",
+  editor =       "James Arvo",
+  title =        "Efficiency Improvements for Hierarchy Traversal",
+  booktitle =    "Graphics Gems II",
+  pages =        "267--273",
+  publisher =    "Academic Press",
+  address =      "San Diego",
+  year =         "1991",
+  keywords =     "efficiency",
+  who = "Havran Vlastimil: RT-0100",
+}
+
+@InCollection{Pearce91,
+  author =       "Andrew Pearce",
+  editor =       "James Arvo",
+  title =        "A Recursive Shadow Voxel Cache for Ray Tracing",
+  booktitle =    "Graphics Gems II",
+  pages =        "273--274",
+  publisher =    "Academic Press",
+  address =      "San Diego",
+  year =         "1991",
+  keywords =     "efficiency",
+  note =         "includes code",
+  who = "Havran Vlastimil: RT-0099",
+}
+
+@InCollection{Pearce91a,
+  author =       "Andrew Pearce",
+  editor =       "James Arvo",
+  title =        "Avoiding Incorrect Shadow Intersections for Ray
+                 Tracing",
+  booktitle =    "Graphics Gems II",
+  pages =        "275--276",
+  publisher =    "Academic Press",
+  address =      "San Diego",
+  year =         "1991",
+  who = "Havran Vlastimil: RT-0098",
+}
+
+@InCollection{Voorhies91,
+  author =       "Douglas Voorhies and David Kirk",
+  editor =       "James Arvo",
+  title =        "Ray-Triangle Intersection Using Binary Recursive
+                 Subdivision",
+  booktitle =    "Graphics Gems II",
+  pages =        "257--263",
+  publisher =    "Academic Press",
+  address =      "San Diego",
+  year =         "1991",
+  who = "Havran Vlastimil: RT-0097",
+}
+
+@InCollection{Kirk91,
+  author =       "David Kirk and James Arvo",
+  editor =       "James Arvo",
+  title =        "Improved Ray Tagging for Voxel-Based Ray Tracing",
+  booktitle =    "Graphics Gems II",
+  pages =        "264--266",
+  publisher =    "Academic Press",
+  address =      "San Diego",
+  year =         "1991",
+  keywords =     "efficiency",
+  who = "Havran Vlastimil: RT-0096",
+}
+
+@InCollection{Cohen:1994:VTA,
+  author =       "Daniel Cohen",
+  editor =       "Paul Heckbert",
+  booktitle =    "Graphics Gems IV",
+  title =        "Voxel Traversal along a 3{D} Line",
+  publisher =    "Academic Press",
+  address =      "Boston",
+  pages =        "366--369",
+  year =         "1994",
+  keywords =     "digital line drawing, grid traversal, ray tracing,
+                 scan conversion",
+  summary =      "Visits all the voxels along a 3D line segment with
+                 integer endpoints, something like a 3D Bresenham's
+                 algorithm. This code could be modified to take
+                 endpoints with fixed point coordinates. Then the
+                 algorithm could be very useful for ray tracing, when a
+                 uniform grid is being used as a spatial data structure
+                 for optimization, or for volume rendering of grid data.
+                 Contains C code.",
+  who = "Havran Vlastimil: RT-0095",
+}
+
+@InProceedings{GARGANTINI:1995:EEI,
+  author =       "Irene GARGANTINI and J. H. G. REDEKOP",
+  title =        "Evaluating Exact Intersections of an Octree with Full
+                 Rays using only Radix-Sort and Meet Operations",
+  booktitle =    "Compugraphics '95",
+  pages =        "278--284",
+  year =         "1995",
+  month =        dec,
+  editor =       "Harold P. Santo",
+  note =         "ISBN 972-8342-00-4",
+  who = "Havran Vlastimil: RT-0094",
+}
+
+@InProceedings{Marton:1997:ACC,
+  author =       "L. {Szirmay-Kalos} and G. Marton",
+  title =        "On the Limitations of Worst--case Optimal Ray Shooting Algorithms",
+  booktitle =    "Winter School of Computer Graphics 1997",
+  year =         "1997",
+  month =        feb,
+  pages =        "562--571",
+  note =         "held at University of West Bohemia, Plzen, Czech
+                 Republic, 14-18 February 1997",
+  who = "Havran Vlastimil: RT-0093",
+}
+
+@Article{strauss90a,
+  author =       "Paul S. Strauss",
+  title =        "A Realistic Lighting Model for Computer Animators",
+  journal =      "IEEE Computer Graphics and Applications",
+  pages =        "56--64",
+  volume =       "10",
+  number =       "6",
+  month =        nov,
+  year =         "1990",
+  keywords =     "modeling, lighting model, Torrance-Sparrow, Cook,
+                 Phong",
+  annote =       "Phong's illumination model is simple and widely used.
+                 However it is incomplete. Torrance-Sparrow and Cook's
+                 models produce results closer to the reality but its
+                 many parameters, often dependent between themselves,
+                 are difficult to tune to obtain desired results.
+                 Moreover inconsistencies can arise for given choices of
+                 parameters. Strauss introduces a reformulation of the
+                 standard illumination functions, trying to restrict the
+                 values of the parameters between 0 and 1 and to make
+                 them as independent as possible. This should make
+                 illumination easier for non-expert while an expert or
+                 someone desiring ``unrealistic'' effects could be
+                 penalized.",
+  who = "Havran Vlastimil: RT-0092",
+}
+
+@Article{Zemcik:1995:OCT,
+  author =       "Pavel Zemcik and Alan Chalmers",
+  title =        "Optimised {CSG} Tree Evaluation for Space
+                 Subdivision",
+  journal =      "Com{\-}pu{\-}ter Graphics Forum",
+  volume =       "14",
+  number =       "2",
+  pages =        "139--146",
+  month =        jun,
+  year =         "1995",
+  coden =        "CGFODY",
+  ISSN =         "0167-7055",
+  bibdate =      "Tue Mar 17 15:44:38 MST 1998",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Technical Univ of Brno",
+  affiliationaddress = "Czech",
+  classification = "721.1; 723.2; 723.5; 921; 921.5; C4260
+                 (Computational geometry); C6120 (File organisation);
+                 C6130B (Graphics techniques)",
+  corpsource =   "Tech. Univ. of Brno, Czech Republic",
+  journalabr =   "Comput Graphics Forum",
+  keywords =     "Binary tree; Binary tree, Optimised CSG tree
+                 evaluation; Complex scenes; complex scenes;
+                 computational; computational geometry; Computational
+                 methods; Computational requirements; Computer graphics;
+                 computer graphics; Computer graphics; computer
+                 graphics; Computer images; Computer selection and
+                 evaluation; Constructive solid geometry; constructive
+                 solid geometry; Constructive solid geometry;
+                 constructive solid geometry; Data structures; Geometry;
+                 images; optimised CSG tree evaluation; Optimization;
+                 photorealistic; Photorealistic images; ray; Ray object
+                 intersection evaluations; Ray tracing; ray tracing; Ray
+                 tracing; Realistic computer images; realistic computer
+                 images; realistic images; Rendering; rendering;
+                 rendering (computer graphics); requirements; solid
+                 modelling; Space subdivision; space subdivision; Space
+                 subdivision; Status tree approach; status tree
+                 approach; structures; tracing; tree data",
+  thesaurus =    "Computational geometry; Ray tracing; Realistic images;
+                 Rendering [computer graphics]; Solid modelling; Tree
+                 data structures",
+  treatment =    "P Practical; T Theoretical or Mathematical",
+  who = "Havran Vlastimil: RT-0091",
+}
+
+@Article{Gervautz:1992:CSA,
+  author =       "Michael Gervautz",
+  title =        "Consistent schemes for addressing surfaces when ray
+                 tracing transparent {CSG} objects",
+  journal =      "Com{\-}pu{\-}ter Graphics Forum",
+  volume =       "11",
+  number =       "4",
+  pages =        "203--211",
+  month =        oct,
+  year =         "1992",
+  coden =        "CGFODY",
+  ISSN =         "0167-7055",
+  bibdate =      "Mon Apr 14 10:23:20 MDT 1997",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Technical Univ Vienna",
+  affiliationaddress = "Vienna, Austria",
+  classification = "723.1; 723.2; 741.1; 921.4; 931.2; C4260
+                 (Computational geometry); C6130B (Graphics
+                 techniques)",
+  corpsource =   "Inst. for Comput. Graphics, Tech. Univ. Vienna,
+                 Austria",
+  keywords =     "Asymmetric CSG-operators; asymmetric CSG-operators;
+                 Classification (of information); classification scheme;
+                 Classification scheme; classification scheme;
+                 computational geometry; constructive solid geometry;
+                 Constructive Solid Geometry (CSG) modelling; CSG
+                 modelling; CSG trees; Data representation, Constructive
+                 solid geometry; geometrical optics; Geometry; Graphic
+                 primitives; Image processing; Light refraction;
+                 Material boundaries; material boundaries; material
+                 properties; Material properties; material properties;
+                 Mathematical models; Mathematical operators; objects;
+                 properties; ray tracing; Ray tracing; Refraction;
+                 refraction; Set theory; shading; Shading; shading;
+                 solid modelling; surface; Surface properties; Surfaces;
+                 Three dimensional computer graphics; Transparency;
+                 transparent CSG; Transparent CSG objects; Trees
+                 (mathematics); Unambiguous model; unambiguous model;
+                 Visualization",
+  thesaurus =    "Computational geometry; Geometrical optics; Solid
+                 modelling",
+  treatment =    "P Practical; T Theoretical or Mathematical",
+  who = "Havran Vlastimil: RT-0090",
+}
+
+Article{Horvath:1992:RCB,
+  author =       "T. Horvath and G. Marton and P. Risztics and L.
+                 Szirmay-Kalos",
+  title =        "Ray coherence between a sphere and a convex
+                 polyhedron",
+  journal =      "Com{\-}pu{\-}ter Graphics Forum",
+  volume =       "11",
+  number =       "2",
+  pages =        "163--172",
+  month =        jun,
+  year =         "1992",
+  coden =        "CGFODY",
+  ISSN =         "0167-7055",
+  bibdate =      "Mon Apr 14 10:23:20 MDT 1997",
+  acknowledgement = ack-nhfb,
+  classification = "C4240 (Programming and algorithm theory); C4260
+                 (Computational geometry); C6130B (Graphics
+                 techniques)",
+  corpsource =   "Dept. of Process Control, Tech. Univ. of Budapest,
+                 Hungary",
+  keywords =     "computational complexity; computational geometry;
+                 computer; Convex polyhedron; convex polyhedron;
+                 graphics; ray; ray coherence theorems; Ray coherence
+                 theorems; Ray tracing algorithms; Sphere; sphere;
+                 tracing algorithms",
+  thesaurus =    "Computational complexity; Computational geometry;
+                 Computer graphics",
+  treatment =    "T Theoretical or Mathematical",
+  who = "Havran Vlastimil: RT-0089",
+}
+
+@Article{Barequet:1996:BHR,
+  author =       "Gill Barequet and Bernard Chazelle and Leonidas J.
+                 Guibas and Joseph S. B. Mitchell and Ayellet Tal",
+  title =        "{BOXTREE}: {A} Hierarchical Representation for
+                 Surfaces in {3D}",
+  journal =      "Com{\-}pu{\-}ter Graphics Forum",
+  volume =       "15",
+  number =       "3",
+  pages =        "C387--C396, C484",
+  month =        sep,
+  year =         "1996",
+  coden =        "CGFODY",
+  ISSN =         "0167-7055",
+  bibdate =      "Tue Mar 17 15:44:38 MST 1998",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Tel Aviv Univ",
+  affiliationaddress = "Tel Aviv, Isr",
+  affiliationaddress = "Isr",
+  classification = "723.2; 723.5; 921.4; C4260 (Computational geometry);
+                 C6120 (File organisation); C6130B (Graphics
+                 techniques)",
+  conference =   "Proceedings of the 1996 17th Annual Conference and
+                 Exhibition of the European Association for Computer
+                 Graphics, EUROGRAPHICS'96",
+  conflocation = "Poitiers, France; 26-30 Aug. 1996",
+  conftitle =    "European Association for Computer Graphics 17th Annual
+                 Conference and Exhibition. EUROGRAPHICS '96",
+  corpsource =   "Dept. of Comput. Sci., Tel Aviv Univ., Israel",
+  journalabr =   "Comput Graphics Forum",
+  keywords =     "Boxtree; Collision detection; Computational geometry;
+                 Data structures; Hierarchical systems; Octrees;
+                 Piecewise linear techniques; Ray shooting; Ray tracing;
+                 Surfaces; Three dimensional computer graphics",
+  keywords =     "3D representation; boxtree; BOXTREE; BSP trees;
+                 collision detection; Collision detection; computational
+                 geometry; Computational geometry; Data structures; data
+                 structures; hierarchical representation; Hierarchical
+                 systems; meshed surfaces; nested boxes; octrees;
+                 Octrees; Piecewise linear techniques; R-trees; Ray
+                 shooting; ray tracing; Ray tracing; ray tracing;
+                 surface fitting; Surfaces; Three dimensional computer
+                 graphics; three dimensional representation; tree; tree
+                 data structure; triangulated surfaces",
+  meetingaddress = "Poitiers, Fr",
+  meetingdate =  "Aug 26--30 1996",
+  meetingdate2 = "08/26--30/96",
+  sponsor =      "CNRS; ERCIM; BARCO; EDF; SUN; et al",
+  sponsororg =   "CNRS; BARCO; Electr. France; et al",
+  treatment =    "P Practical; T Theoretical or Mathematical",
+  who = "Havran Vlastimil: RT-0088",
+}
+
+@InProceedings{ENDL:1995:OOR,
+  author =       "Robert ENDL",
+  title =        "An Object-Oriented Ray Tracing Architecture for the
+                 Analysis of Ray-Generators in Spatial Subdivisions",
+  booktitle =    "Compugraphics '95",
+  pages =        "268--277",
+  year =         "1995",
+  month =        dec,
+  editor =       "Harold P. Santo",
+  note =         "ISBN 972-8342-00-4",
+  who = "Havran Vlastimil: RT-0087",
+}
+
+@InProceedings{Pharr:1997:RCS,
+  author =       "Matt Pharr and Craig Kolb and Reid Gershbein and Pat
+                 Hanrahan",
+  title =        "Rendering Complex Scenes with Memory-Coherent Ray
+                 Tracing",
+  booktitle =    "SIGGRAPH 97 Conference Proceedings",
+  editor =       "Turner Whitted",
+  series =       "Annual Conference Series",
+  year =         "1997",
+  organization = "ACM SIGGRAPH",
+  publisher =    "Addison Wesley",
+  month =        aug,
+  pages =        "101--108",
+  note =         "ISBN 0-89791-896-7",
+  keywords =     "scene data management, caching, computation
+                 re-ordering, coherence",
+  annote =       "Simulating realistic lighting and rendering complex
+                 scenes are usually considered separate problems with
+                 incompatible solutions. Accurate lighting calculations
+                 are typically performed using ray tracing algorithms,
+                 which require that the entire scene database reside in
+                 memory to perform well. Conversely, most systems
+                 capable of rendering complex scenes use scan-conversion
+                 algorithms that access memory coherently, but are
+                 unable to incorporate sophisticated illumination. We
+                 have developed algorithms that use caching and lazy
+                 creation of texture and geometry to manage scene
+                 complexity. To improve cache performance, we increase
+                 locality of reference by dynamically reordering the
+                 rendering computation based on the contents of the
+                 cache. We have used these algorithms to compute images
+                 of scenes containing millions of primitives, while
+                 storing ten percent of the scene description in memory.
+                 Thus, a machine of a given memory capacity can render
+                 realistic scenes that are an order of magnitude more
+                 complex than was previously possible.",
+  who = "Havran Vlastimil: RT-0086",
+}
+
+@InProceedings{kalra89a,
+  author =       "Devendra Kalra and Alan H. Barr",
+  title =        "Guaranteed Ray Intersections with Implicit Surfaces",
+  pages =        "297--306",
+  booktitle = "SIGGRAPH '89 Proceedings",
+  journal =      "Computer Graphics (SIGGRAPH '89 Proceedings)",
+  volume =       "23",
+  number =       "3",
+  year =         "1989",
+  month =        jul,
+  editor =       "Jeffrey Lane",
+  conference =   "held in Boston, Massachusetts; 31 July -- 4 August
+                 1989",
+  keywords =     "implicit surfaces, ray tracing, rendering, sampling,
+                 subdivision, Lipschitz constant, root finding",
+  annote =       "Automatic interval finding for implicit surface
+                 intersection \\ In this paper, we present a robust and
+                 mathematically sound ray-intersection algorithm for
+                 implicit surfaces. The algorithm is guaranteed to
+                 numerically find the nearest intersection of the
+                 surface with a ray, and is guaranteed not to miss fine
+                 features of the surface. It does not require fine
+                 tuning or human choice of interactive parameters.
+                 Instead, it requires two upper bounds: ``L'' that
+                 limits the net rate of change of the implicit surface
+                 function $f(x,y,z)$ and ``G'' that limits the rate of
+                 change of the gradient. An implicit surface with these
+                 rate limits is referred to as an ``LG-implicit
+                 surface.'' \\ Existing schemes to intersect a ray with
+                 an implicit surface have typically been guaranteed to
+                 work only for a limited set of implicit functions, such
+                 as quadric surfaces or polynomials, or else have been
+                 ad-hoc and have not been guaranteed to work. Our
+                 technique significanty extends the ability to intersect
+                 rays with implicit surfaces in a guaranteed fashion.",
+  who = "Havran Vlastimil: RT-0085",
+}
+
+@Article{Woo:1993:ESC,
+  author =       "Andrew Woo",
+  title =        "Efficient shadow computations in ray tracing",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "13",
+  number =       "5",
+  pages =        "78--83",
+  month =        sep,
+  year =         "1993",
+  coden =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
+  abstract =     "Two simple techniques speed up shadows in ray tracing.
+                 Both require little memory and easily extend to other
+                 types. One can also benefit radiosity- related
+                 computations.",
+  acknowledgement = ack-nhfb,
+  annote =       "Two simple techniques speed up shadows in ray tracing.
+                 Both require little memory and easily extend to other
+                 ray types. One can also benefit radiosity-related
+                 computations.",
+  who = "Havran Vlastimil: RT-0084",
+}
+
+@InProceedings{Milosmek:1994:AFV,
+  author =       "Milos Sramek",
+  title =        "An Algorithm for Fast Voxel Scene Traversal",
+  booktitle =    "Winter School of Computer Graphics 1994",
+  year =         "1994",
+  month =        jan,
+  note =         "held at University of West Bohemia, Plzen, Czech
+                 Republic, 19-20 January 1994",
+  who = "Havran Vlastimil: RT-0083",
+}
+
+@InProceedings{rubin80a,
+  author =       "Steven M. Rubin and Turner Whitted",
+  title =        "A 3-Dimensional Representation for Fast Rendering of
+                 Complex Scenes",
+  pages =        "110--116",
+  booktitle =      "SIGGRAPH '80 Proceedings",
+  journal =      "Computer Graphics (SIGGRAPH '80 Proceedings)",
+  volume =       "14",
+  number =       "3",
+  year =         "1980",
+  month =        jul,
+  keywords =     "bounding volume, ray tracing cull, graphical
+                 data/base/structure representation, Methodologies,
+                 Techniques, Modeling scene, Algorithmic Aspects surface
+                 representation",
+  annote =       "hierarchical bounding boxes, used to speed up ray
+                 tracing and other algorithms \\ Hierarchical
+                 representations of 3-dimensional objects are both time
+                 and space efficient. They typically consist of trees
+                 whose branches represent bounding volumes and whose
+                 terminal nodes represent primitive object elements
+                 (usually polygons). This paper describes a method
+                 whereby the object space is represented entirely by a
+                 hierarchical data structure consisting of bounding
+                 volumes, with no other form of representation. This
+                 homogeneity allows the visible surface rendering to be
+                 performed simply and efficiently. \\ The bounding
+                 volumes selected for this algorithm are parallelepipeds
+                 oriented to minimize their sizes. With this
+                 representation, any surface can be rendered since in
+                 the limit the bounding volumes make up a point
+                 representation of the object. The advantage is that the
+                 visibility calculations consist only of a search
+                 through the data structure to determine the
+                 correspondence between terminal level bounding volumes
+                 and the current pixel. For ray tracing algorithms, this
+                 means that a simplified operation will produce the
+                 point of intersection of each ray with the bounding
+                 volumes. \\ Memory requirements are minimized by
+                 expanding or fetching lower levels of the hierarchy
+                 only when required. Because the viewing process has a
+                 single operation and primitive type, the software and
+                 hardware chosen to implement the search can be highly
+                 optimized for very fast execution.",
+  who = "Havran Vlastimil: RT-0082",
+}
+
+@Article{Kuzmin:1994:RTS,
+  author =       "Y. P. Kuzmin",
+  title =        "Ray Traversal of Spatial Structures",
+  journal =      "Com{\-}pu{\-}ter Graphics Forum",
+  volume =       "13",
+  number =       "4",
+  pages =        "223--227",
+  month =        oct,
+  year =         "1994",
+  coden =        "CGFODY",
+  ISSN =         "0167-7055",
+  bibdate =      "Mon Apr 14 10:23:20 MDT 1997",
+  acknowledgement = ack-nhfb,
+  classification = "C6130B (Graphics techniques)",
+  corpsource =   "Dept. of Math. and Mech., Moscow State Univ., Russia",
+  keywords =     "computer graphics; Efficient algorithm; efficient
+                 algorithm; error accumulation; Error accumulation;
+                 error accumulation; errors; hardware implementation;
+                 Hardware implementation; hardware implementation;
+                 hierarchical spatial; Hierarchical spatial structures;
+                 integer operations; Integer operations; Logical
+                 operations; logical operations; ray; ray casting; Ray
+                 casting; ray casting; ray tracing; Ray tracing
+                 acceleration; ray traversal; Ray traversal; Software
+                 implementation; software implementation; structures;
+                 tracing acceleration; uniform spatial structures;
+                 Uniform spatial structures",
+  thesaurus =    "Computer graphics; Errors; Ray tracing",
+  treatment =    "P Practical; T Theoretical or Mathematical",
+  who = "Havran Vlastimil: RT-0081",
+}
+
+@Article{Akimoto:1991:PRT,
+  author =       "Takaaki Akimoto and Kenji Mase and Yasuhito Suenaga",
+  title =        "Pixel-selected ray tracing",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "11",
+  number =       "4",
+  pages =        "14--22",
+  month =        jul,
+  year =         "1991",
+  coden =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
+  acknowledgement = ack-nhfb,
+  affiliation =  "NTT Corp, Kanagawa, Japan",
+  classification = "723; 741",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "Computer Graphics; Image Processing --- Image Coding;
+                 Ray Tracing; ray tracing, acceleration; Three
+                 Dimensional Graphics",
+  who = "Havran Vlastimil: RT-0080",
+}
+
+
+@Article{McNeill:1992:PSS,
+  author =       "M. D. J. McNeill and B. C. Shah and M.-P. Hebert and
+                 P. F. Lister and R. L. Grimsdale",
+  title =        "Performance of space subdivision techniques in ray
+                 tracing",
+  journal =      "Com{\-}pu{\-}ter Graphics Forum",
+  volume =       "11",
+  number =       "4",
+  pages =        "213--220",
+  month =        oct,
+  year =         "1992",
+  coden =        "CGFODY",
+  ISSN =         "0167-7055",
+  bibdate =      "Mon Apr 14 10:23:20 MDT 1997",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Univ of Sussex",
+  affiliationaddress = "Brighton, Engl",
+  classification = "721.1; 722.4; 723.1; 723.2; 921.5; C4240P (Parallel
+                 programming and algorithm theory); C6120 (File
+                 organisation); C6130B (Graphics techniques)",
+  corpsource =   "Sch. of Eng., Sussex Univ., Brighton, UK",
+  keywords =     "algorithm; Algorithms; Computational complexity;
+                 computer graphics; Data structure; data structure; data
+                 structures; Data structures; dynamic; dynamic building;
+                 Dynamic building algorithm; Dynamic scenes; dynamic
+                 structure building; Dynamic structure building; dynamic
+                 structure building; Dynamic structure building
+                 algorithms; geometrical optics; Image parallelism
+                 performance; image parallelism performance; Image
+                 processing; Image quality; Image synthesis, Ray
+                 tracing; Optimization; parallel; parallel algorithms;
+                 Parallel processing systems; Performance; processing
+                 systems; ray tracing; Ray tracing; ray tracing;
+                 rendering; Rendering; rendering; scenes; Space
+                 subdivision algorithms; space subdivision algorithms;
+                 Three dimensional computer graphics",
+  thesaurus =    "Computer graphics; Data structures; Geometrical
+                 optics; Parallel algorithms",
+  treatment =    "P Practical; T Theoretical or Mathematical",
+  who = "Havran Vlastimil: RT-0079",
+}
+
+@InProceedings{sequin89a,
+  author =       "Carlo H. Sequin and Eliot K. Smyrl",
+  title =        "Parameterized Ray Tracing",
+  pages =        "307--314",
+  booktitle =    "SIGGRAPH '89 Proceedings",
+  journal =      "Computer Graphics (SIGGRAPH '89 Proceedings)",
+  volume =       "23",
+  number =       "3",
+  year =         "1989",
+  month =        jul,
+  editor =       "Jeffrey Lane",
+  conference =   "held in Boston, Massachusetts; 31 July -- 4 August
+                 1989",
+  keywords =     "ray tracing, rendering, parameterization, surface
+                 properties, runlength encoding, subexpression
+                 elimination, hashing",
+  annote =       "store ray tree data to allow quick material changes \\
+                 The construction and refinement of a computer graphics
+                 scene is unacceptably slow when using ray tracing. We
+                 introduce a new technique to speed up the generation of
+                 successive ray traced images when the geometry of the
+                 scene remains constant and only the light source
+                 intensities and the surface properties need to be
+                 adjusted. When the scene is first traced, an expression
+                 parameterized in the color of all lights and the
+                 surface property coefficients of all objects is
+                 calculated and stored for each pixel. Redisplaying a
+                 scene with a new set of lights and colors then consists
+                 of substituting values for the corresponding parameters
+                 and re-evaluating the expressions for the pixels. This
+                 parameter updating and redisplay takes only a few
+                 seconds, as compared to the many minutes or hours
+                 required to ray trace the entire scene again, but it
+                 uses much more memory and disk space. With suitable
+                 expression sharing, however, these storage needs can be
+                 reduced to an acceptable level.",
+  who = "Havran Vlastimil: RT-0078",
+}
+
+@InProceedings{hart89a,
+  author =       "John C. Hart and Daniel J. Sandin and Louis H.
+                 Kauffman",
+  title =        "Ray Tracing Deterministic 3-{D} Fractals",
+  pages =        "289--296",
+  booktitle =      "Computer Graphics (SIGGRAPH '89 Proceedings)",
+  volume =       "23",
+  number =       "3",
+  year =         "1989",
+  month =        jul,
+  editor =       "Jeffrey Lane",
+  conference =   "held in Boston, Massachusetts; 31 July -- 4 August
+                 1989",
+  keywords =     "fractal",
+  annote =       "As shown in 1982, Julia sets of quadratic functions as
+                 well as many other deterministic fractals exist in
+                 spaces of higher dimensionality than the complex plane.
+                 Originally a boundary-tracking algorithm was used to
+                 view these structures but required a large amount of
+                 storage space to operate. By ray tracing these objects,
+                 the storage facilities of a graphics workstation frame
+                 buffer are sufficient. A short discussion of a specific
+                 set of 3-D deterministic fractals precedes a full
+                 description of a ray-tracing algorithm applied to these
+                 objects. A comparision with the boundary-tracing method
+                 and applications to other 3-D deterministic fractals
+                 are also included.",
+  who = "Havran Vlastimil: RT-0077",
+}
+
+@InProceedings{Marton:1995:ACC,
+  author =       "G. Marton and L. {Szirmay-Kalos}",
+  title =        "On Average-case Complexity of Ray Tracing Algorithms",
+  booktitle =    "Winter School of Computer Graphics 1995",
+  year =         "1995",
+  month =        feb,
+  note =         "held at University of West Bohemia, Plzen, Czech
+                 Republic, 14-18 February 1995",
+  who = "Havran Vlastimil: RT-0076",
+}
+
+@InProceedings{painter89a,
+  author =       "James Painter and Kenneth Sloan",
+  title =        "Antialiased Ray Tracing by Adaptive Progressive
+                 Refinement",
+  pages =        "281--288",
+  booktitle =      "Computer Graphics (SIGGRAPH '89 Proceedings)",
+  journal =      "Computer Graphics (SIGGRAPH '89 Proceedings)",
+  volume =       "23",
+  number =       "3",
+  year =         "1989",
+  month =        jul,
+  editor =       "Jeffrey Lane",
+  conference =   "held in Boston, Massachusetts; 31 July -- 4 August
+                 1989",
+  keywords =     "adaptive sampling, antialiasing, filtering,
+                 progressive refinement, ray tracing",
+  annote =       "We describe an antialiasing system for ray tracing
+                 based on adaptive progressive refinement. The goals of
+                 the system are to produce high quality antialiased
+                 images at a modest average sample rate, and to refine
+                 the image progressively so that the image is available
+                 in a usable form early and is refined gradually toward
+                 the final result. \\ The method proceeds by adaptive
+                 stochastic sampling of the image plane, evaluation of
+                 the samples by ray tracing, and image reconstruction
+                 from the samples. Adaptive control of the sample
+                 generation process is driven by three basic goals:
+                 coverage of the image, location of features, and
+                 confidence in the values at a distinguished ``pixel
+                 level'' resolution. \\ A three-stage process of
+                 interpolating, filtering, and resampling is used to
+                 reconstruct a regular grid of display pixels. This
+                 reconstruction can be either batch or incremental.",
+  who  = "Havran Vlastimil: RT-0075",
+}
+
+@InProceedings{Foris:1996:RSL,
+  author =       "T. Foris and G. Marton and L. {Szirmay-Kalos}",
+  title =        "Ray Shooting in Logarithmic Time",
+  booktitle =    "Winter School of Computer Graphics 1996",
+  year =         "1996",
+  month =        feb,
+  note =         "held at University of West Bohemia, Plzen, Czech
+                 Republic, 12-16 February 1996",
+  who  = "Havran Vlastimil: RT-0074",
+}
+
+@Article{sweeney86a,
+  author =       "Michael Sweeney and Richard H. Bartels",
+  title =        "Ray Tracing Free-Form {B}-Spline Surfaces",
+  pages =        "41",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "6",
+  number =       "2",
+  year =         "1986",
+  month =        feb,
+  annote =       "We present a method for using ray tracing to render
+                 spline surfaces--one that is suitable for any object
+                 generated from control vertices via tensor-product
+                 B-splines. The method derives from Kajiya's work on ray
+                 tracing procedurally defined surfaces and make use of
+                 two preprocessing steps. One involves the
+                 control-vertex refinement recurrences due to Riesenfeld
+                 {\em et al}.\ and the second generates a tree of nested
+                 bounding boxes. Intersection testing involves running
+                 Kajiya's algorithm on the tree, followed by two or
+                 three (on the average) iterations of Newton's method.",
+  who  = "Havran Vlastimil: RT-0073",
+}
+
+@InProceedings{Pharr:1996:GCR,
+  author =       "Matt Pharr and Pat Hanrahan",
+  title =        "Geometry Caching for Ray-Tracing Displacement Maps",
+  booktitle =    "Eurographics Rendering Workshop 1996",
+  editor =       "Xavier Pueyo and Peter Schr{\"{o}}der",
+  year =         "1996",
+  organization = "Eurographics",
+  publisher =    "Springer Wein",
+  address =      "New York City, NY",
+  month =        jun,
+  pages =        "31--40",
+  note =         "ISBN 3-211-82883-4",
+  annote =       "We present a technique for rendering displacement
+                 mapped geometry in a ray-tracing renderer. Displacement
+                 mapping is an important technique for adding detail to
+                 surface geometry in rendering systems. It allows
+                 complex geometric variation to be added to simpler
+                 geometry, without the cost in geometric complexity of
+                 completely describing the nuances of the geometry at
+                 modeling time and with the advantage that the detail
+                 can be added adaptively at rendering time. The cost of
+                 displacement mapping is geometric complexity. Renderers
+                 that provide it must be able to efficiently render
+                 scenes that have effectively millions of geometric
+                 primitives. Scan-line renderers process primitives one
+                 at a time, so this complexity doesn't tax them, but
+                 traditional ray-tracing algorithms require random
+                 access to the entire scene database, so any part of the
+                 scene geometry may need to be available at any point
+                 during rendering. If the displaced geometry is fully
+                 instantiated in memory, it is straightforward to
+                 intersect rays with it, but displacement mapping has
+                 not yet been practical in ray-tracers due to the memory
+                 cost of holding this much geometry. We introduce the
+                 use of a geometry cache in order to handle the large
+                 amounts of geometry created by displacement mapping. By
+                 caching a subset of the geometry created and rendering
+                 the image in a coherent manner, we are able to take
+                 advantage of the fact that the rays spawned by
+                 traditional ray-tracing algorithms are spatially
+                 coherent. Using our algorithm, we have efficiently
+                 rendered highly complex scenes while using a limited
+                 amount of memory.",
+  who  = "Havran Vlastimil: RT-0072",
+}
+
+@Article{Musgrave:1990:NRT,
+  author =       "F. Kenton Musgrave",
+  title =        "A Note on Ray Tracing Mirages",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "10",
+  number =       "6",
+  pages =        "10--12",
+  month =        nov,
+  year =         "1990",
+  coden =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Yale Univ, New Haven, CT, USA",
+  annote =       "Discuss Berger's [berger90a] technique to render
+                 mirages, stressing mirages come more from internal
+                 interreflection than refraction.",
+  classification = "723; 741",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "Bending Agent; Computer Graphics; Dispersive Ray
+                 Tracing; Image Processing; Light --- Reflection; Mirage
+                 Formation; mirages, internal reflection; Optics; Ray
+                 Tracing Mirages; Total Internal Reflection",
+  who  = "Havran Vlastimil: RT-0071",
+}
+
+@Article{Berger:1990:RTM,
+  author =       "Marc Berger and Terry Trout and Nancy Levit",
+  title =        "Ray Tracing Mirages",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "10",
+  number =       "3",
+  pages =        "36--41",
+  month =        may,
+  year =         "1990",
+  coden =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Univ of Adelaide, Adelaide, SA, Aust",
+  annote =       "Ray tracing has been used extensively to produce
+                 realistic images. Traditional algorithms simulate
+                 various optical phenomena, including reflections,
+                 refractions, and shadows. With all of these the
+                 direction of the ray changes only when it intersects an
+                 object. Atmospheric variations, however, can cause
+                 light rays to bend, thereby changing their direction at
+                 any time. Mirages are just one possible visual effect
+                 of these bent rays. We generate mirages by sending rays
+                 through an object with multiple air layers having
+                 different refractive indices. As a ray enters this
+                 virtual object, it strikes several air layers and
+                 causes repeated bending of the ray, which results in
+                 the mirage effect.",
+  classification = "723; 741",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "Color; Computer Generated Images; Computer Graphics;
+                 Image Processing --- Image Analysis; Mirages; ray
+                 tracing; Ray Tracing",
+  who  = "Havran Vlastimil: RT-0070",
+}
+
+@Article{Maurel:1993:RT,
+  author =       "H. Maurel and Y. Duthen and R. Caubet",
+  title =        "A {4D} ray tracing",
+  journal =      "Com{\-}pu{\-}ter Graphics Forum",
+  volume =       "12",
+  number =       "3",
+  pages =        "C285--C294",
+  month =        "????",
+  year =         "1993",
+  coden =        "CGFODY",
+  ISSN =         "0167-7055",
+  bibdate =      "Mon Apr 14 10:23:20 MDT 1997",
+  acknowledgement = ack-nhfb,
+  classification = "C4260 (Computational geometry); C6130B (Graphics
+                 techniques)",
+  conflocation = "Barcelona, Spain; 6-10 Sept. 1993",
+  conftitle =    "European Association for Computer Graphics 14th Annual
+                 Conference and Exhibition. EUROGRAPHICS '93",
+  corpsource =   "Inst. de Recherche en Inf. de Toulouse, Univ. Paul
+                 Sabatier, France",
+  keywords =     "4D ray tracing; Animation sequences; animation
+                 sequences; computer animation; graphics); illumination
+                 calculations; Illumination calculations; illumination
+                 calculations; intersection; Intersection; optical
+                 event; Optical event; optical event; ray tracing;
+                 rendering (computer; temporal coherence; Temporal
+                 coherence",
+  thesaurus =    "Computer animation; Ray tracing; Rendering [computer
+                 graphics]",
+  treatment =    "P Practical",
+  who = "Havran Vlastimil: RT-0069",
+}
+
+@PhDThesis{Simiakakis95,
+ author="G. Simiakakis",
+ title ="Accelerating RayTracing with Directional Subdivision and
+         Parallel Processing",
+ school = "University of East Anglia",
+ year = "1995",
+ month = "october",
+ note  = "available at ftp://ftp.sys.uea.ac.uk/pub/ah/G.Simiakakis\_PhD.ps",
+ who = "Havran Vlastimil: RT-0068",
+}
+
+@InProceedings{Cazals97,
+  author="F. Cazals and C. Puech",
+  title="Bucket-like space partitioning data-structures with
+         applications to ray-tracing",
+  booktitle="13th ACM Symposium on Computational Geometry",
+  address="Nice",
+  year="1997",
+  pages="To Appear",
+  who  	= "Havran Vlastimil: RT-0067",
+}
+
+@InCollection{Jansen:1986:DSR,
+      author =       "Frederik W. Jansen",
+      editor =       "L. R. A. Kessener and F. J. Peters and M. L. P. van
+		     Lierop",
+      title =        "Data Structures for Ray Tracing",
+      booktitle =    "Data Structures for Raster Graphics",
+      pages =        "57--73",
+      publisher =    "Springer-Verlag",
+      address =      "New York",
+      year =         "1986",
+      keywords =     "efficiency, CSG, BSP tree, data structures",
+      note =         "Eurographic Seminar",
+      anote =         "overview of published algorithms for ray tracing using
+		     spatial subdivision",
+      where = " MAJI V STK !!!!!",
+     who  	= "Havran Vlastimil: RT-0066",
+}
+
+@InProceedings{Semwal97,
+  author= "Semwal S and Kvarnstrom H",
+  title = "Directional Safe Zones \& Dual Extent Algorithms for Efficient
+	   Grid Traversal",
+  booktitle = "Graphics Interface 97",
+  year  = "1997",
+  pages = "to appear",
+  note  = "University of Colorado",
+  who  	= "Havran Vlastimil: RT-0065",
+}
+
+@Article{Levoy:1990:HRT,
+  author =       "Marc Levoy",
+  title =        "A Hybrid Ray Tracer for Rendering Polygon and Volume
+                 Data",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "10",
+  number =       "2",
+  pages =        "33--40",
+  month =        mar,
+  year =         "1990",
+  coden =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Univ of North Carolina, Dep of Comput Sci, Chapel
+                 Hill, NC, USA",
+  annote =       "Volume rendering is a technique for visualizing
+                 sampled functions of three spatial dimensions by
+                 computing 2D projections of a colored semitransparent
+                 volume. In this article I address the problem of
+                 extending volume rendering to handle polygonally
+                 defined objects. The solution I propose is a hybrid
+                 ray-tracing algorithm. Rays are simultaneously cast
+                 through a set of polygons and a volume data array.
+                 Samples of each are drawn at equally spaced intervals
+                 along the rays, and the resulting colors and opacities
+                 are composited together in depth-sorted order. To avoid
+                 aliasing of polygonal edges at modest computational
+                 expense, I use a form of selective supersampling. To
+                 avoid errors in visibility at polygon-volume
+                 intersections, I give special treatment to volume
+                 samples lying immediately in front of and behind
+                 polygons. I will evaluate the cost, image quality, and
+                 versatility of the algorithm using data from 3D medical
+                 imaging applications.",
+  classification = "461; 723",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "Computer Graphics; Computer Programming ---
+                 Algorithms; Medical Applications; Polygon Data; Ray
+                 Tracing; Sampling; Selective Supersampling; Volume
+                 Rendering; volume rendering",
+  who  = "Havran Vlastimil: RT-0064",
+}
+
+@Article{Gargantini:1993:RTO,
+  author =       "I. Gargantini and H. H. Atkinson",
+  title =        "Ray tracing an octree: numerical evaluation of the
+                 first intersection",
+  journal =      "Com{\-}pu{\-}ter Graphics Forum",
+  volume =       "12",
+  number =       "4",
+  pages =        "199--210",
+  month =        oct,
+  year =         "1993",
+  coden =        "CGFODY",
+  ISSN =         "0167-7055",
+  bibdate =      "Mon Apr 14 10:23:20 MDT 1997",
+  acknowledgement = ack-nhfb,
+  classification = "C1160 (Combinatorial mathematics); C4260
+                 (Computational geometry); C6120 (File organisation);
+                 C6130B (Graphics techniques)",
+  corpsource =   "Dept. of Comput. Sci., Univ. of Western Ontario,
+                 London, Ont., Canada",
+  keywords =     "based region octree; Bisecting planes; bisecting
+                 planes; computational geometry; data structures;
+                 directed graphs; directed semi-infinite straight-line;
+                 Directed semi-infinite straight-line; first; First
+                 intersection; Floating-point arithmetic; floating-point
+                 arithmetic; intersection; local ordering; Local
+                 ordering; numerical accuracy; Numerical accuracy;
+                 numerical accuracy; numerical evaluation; Numerical
+                 evaluation; numerical evaluation; octree; Octree;
+                 octree; pointer-; Pointer-based region octree; ray
+                 tracing; Ray tracing; tree",
+  thesaurus =    "Computational geometry; Directed graphs; Ray tracing;
+                 Tree data structures",
+  treatment =    "T Theoretical or Mathematical",
+      who  	= "Havran Vlastimil: RT-0063",
+}
+
+@Article{charney90a,
+        author =       "Mark J. Charney and Isaac D. Scherson",
+        title =        "Efficient Traversal of Well-Behaved Hierarchicial
+                       Trees of Extents for Ray-Tracing Complex Scenes",
+        journal =      "The Visual Computer",
+        pages =        "167--178",
+        volume =       "6",
+        number =       "3",
+        month =        jun,
+        year =         "1990",
+        keywords =     "ray tracing, hierarchy, bounding volumes, tree of
+                       extents, hte, hidden surface removal, traversal",
+        annote =       "Traversal of hierarchical trees of extents (HTE)
+                       requires computation of intersections between rays and
+                       bounding volumes whose faces are parallel to the
+                       cartesian axes. By redefining the HTE so that
+                       non-overlapping bounding volumes are generated, a
+                       well-behaved data structure is obtained in which
+                       `geometrical coherence'' is applied to speed up its
+                       traversal. We distinguish two types of bounding
+                       volumes: {\em internal} boxes contain the ray's origin
+                       while {\em external} bounding volumes do not contain
+                       the ray's origin. To traverse the HTE, we look first to
+                       polygons in the internal bounding volumes and external
+                       boxes are dealt with only when no ray-polygon
+                       intersection is found in internal nodes. As external
+                       nodes in the HTE define pruned subtrees of external
+                       bounding volumes, geometrical characteristics of the
+                       boxes are exploited for HTE traversal. A coding scheme
+                       allows a 6-bit code to determine which faces of a
+                       bounding volume need to be tested for intersection.
+                       Also, our well-behaved HTE allows for reuse of
+                       intersection points at lower levels of the tree.",
+	who  	= "Havran Vlastimil: RT-0062",
+}
+
+@Article{Cohen:1994,
+	author 	= "D.Cohen and Z.Sheffer", 
+	title  	= "Proximity clouds - an acceleration technique for 3D grid traversal",
+	journal = "The Visual Computer",
+	volume 	= "11",
+	pages 	= "27-38",
+	year 	= "1994",
+	keywords = "ray tracing, space subdivision, distance transformation,
+		   distance map, grid traversal",
+	who  	= "Havran Vlastimil: RT-0061",
+}
+
+@Article{Kok:1994:ECR,
+        author 	= "Arjan J. F. Kok and Frederik W. Jansen and C. Woodward",
+        title 	= "Efficient, Complete Radiosity Ray Tracing Using a
+                   Shadow-Coherence Method",
+        journal = "The Visual Computer",
+        volume	= "10",
+        pages	= "19--33",
+        year 	= "1993",
+	month 	= "oct",
+        bibsource = "sig-11-1993",
+	keywords = "rendering, radiosity, ray tracing, source selection,
+		shadow coherence",
+  	who  	= "Havran Vlastimil: RT-0060",
+}
+
+@Article{wyvill86d,
+  	author =       "G. Wyvill and T. L. Kunii and Y. Shirai",
+  title =        "Space Division for Ray Tracing in {CSG} (Constructive
+		 Solid Geometry)",
+  pages =        "28--34",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "6",
+  number =       "4",
+  year =         "1986",
+  month =        apr,
+  keywords =     "I35 CSG, I35 trees (mathematics), I37 ray tracing",
+  annote =       "A system of Constructive Solid Geometry (CSG) enables
+		 an engineering designer to compose three-dimensional
+		 shapes by combining simpler ones. Definitions of such
+		 objects are represented by tree structures or direct
+		 acyclic graphs. \\ Most existing systems convert this
+		 representation to a more conventional boundary
+		 representation of the solids in order to render
+		 pictures from the model. More recently, a number of
+		 systems have been described that render the pictures
+		 directly from the CSG structure. We describe such a
+		 system. We render a scene by ray tracing from a
+		 directed acyclic graph. This process is made efficient
+		 for large models by using an adaptive method of space
+		 division to reduce the number of intersection
+		 calculations needed.",
+  who  = "Havran Vlastimil: RT-0059",
+}
+
+@Article{Kok:1992:ASA,
+      author =       "Arjan J. F. Kok and Frederik W. Jansen",
+      title =        "Adaptive Sampling of Area Light Sources in Ray Tracing
+		     Including Diffuse Interreflection",
+      journal =      "Computer Graphics Forum (Eurographics '92)",
+      volume =       "11",
+      number =       "3",
+      address =      "Cambridge, UK",
+      pages =        "289--298",
+      month =        sep,
+      year =         "1992",
+      bibsource =    "sig-11-1994",
+  who  = "Havran Vlastimil: RT-0058",
+}
+
+@Article{Haines87,
+  author =       "Eric A. Haines",
+  title =        "A Proposal for Standard Graphics Environments",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "7",
+  number =       "11",
+  pages =        "3--5",
+  month =        nov,
+  year =         "1987",
+  keywords =     "benchmark",
+  note =         "also in SIGGRAPH '87, '88, '89 Introduction to Ray
+                 Tracing course notes, code available via FTP from
+                 princeton.edu:/pub/Graphics",
+  anote =         "renderer benchmarking environments and how to obtain
+                 them",
+  who  = "Havran Vlastimil: RT-0057",
+}
+
+@Article{glassner88a,
+      author =       "Andrew S. Glassner",
+      title =        "Spacetime ray tracing for animation",
+      journal =      "IEEE Computer Graphics and Applications",
+      pages =        "60--70",
+      volume =       "8",
+      number =       "2",
+      month =        mar,
+      year =         "1988",
+      keywords =     "animation, ray tracing cull",
+      annote =       "We are presenting techniques for the efficient ray
+                     tracing of animated scenes. These techniques are based
+                     on two central concepts: spacetime ray tracing, and a
+                     hybrid adaptive subdivision/bounding volume technique
+                     for generating efficient, nonoverlapping hierarchies of
+                     bounding volumes. \\ In spacetime ray tracing, instead
+                     of rendering dynamically moving objects in 3D space, we
+                     render static objects in 4D spacetime. To support
+                     spacetime ray tracing, we use 4-dimensional analogues
+                     to familiar 3-dimensional ray-tracing techniques. \\
+                     The new bounding volume hierarchy combines elements of
+                     adaptive space subdivision and bounding volume
+                     techniques. The quality of the hierarchy and its
+                     nonoverlapping character make it an improvement over
+                     previous algorithms, because both attributes reduce the
+                     number of ray/object intersections that must be
+                     computed. These savings are amplified in animation
+                     because of the much higher cost of computing ray/object
+                     intersections for motion-blurred animation. \\ We show
+                     it is possible to ray trace large animations more
+                     quickly with spacetime ray tracing using this hierarchy
+		     than with straightforward frame-by-frame rendering.",
+  who  = "Havran Vlastimil: RT-0056",
+}
+@Article{Elber:1997:RT,
+  author =       "Gershon Elber and {Jung-Ju} Choi and {Myung-Soo} Kim",
+  title =        "Ruled Tracing",
+  journal =      "The Visual Computer",
+  year =         "1997",
+  volume =       "13",
+  number =       "2",
+  pages =        "78--94",
+  publisher =    "Springer-Verlag",
+  note =         "ISSN 0178-2789",
+  annote =       "The traditional ray-tracing technique based on a
+                 ray-surface intersection is reduced to a ruled or
+                 developable surface-surface intersection problem. That
+                 enables direct freeform surface rendering. By
+                 exploiting the spatial coherence gained in the
+                 ruled/developable surface-tracing approach presented,
+                 the emulation of shadows, specular reflections, and/or
+                 refractions in a freeform surface environment can all
+                 be implemented efficiently. The approach provides a
+                 direct freeform surface-rendering alternative to ray
+                 tracing. An implementation of a direct freeform surface
+                 renderer that emulates shadows as well as specular
+                 reflections is discussed. This renderer processes
+                 isoparametric curves as its basic building block,
+                 eliminating the need for polygonal approximation.",
+  keywords =     "Ray tracing, light wavefronts, direct freeform surface
+                 rendering, shadow computation, reflection/refraction",
+  who  = "Havran Vlastimil: RT-0055",
+}
+
+@Article{Cazals:1995:FCH,
+  author =       "F. Cazals and G. Drettakis and C. Puech",
+  title =        "Filtering, Clustering and Hierarchy Construction: {A}
+                 New Solution for Ray-Tracing Complex Scenes",
+  journal =      "Com{\-}pu{\-}ter Graphics Forum",
+  volume =       "14",
+  number =       "3",
+  pages =        "C/371--382",
+  year =         "1995",
+  coden =        "CGFODY",
+  ISSN =         "0167-7055",
+  bibdate =      "Fri Sep 13 06:22:32 MDT 1996",
+  acknowledgement = ack-nhfb,
+  classification = "C6130B (Graphics techniques); C6120 (File
+                 organisation); C6115 (Programming support)",
+  keywords =     "Hierarchy construction; Ray tracing; Complex scenes;
+                 Data structures; Input objects; Clustering step;
+                 Uniform grids; Memory requirements; Memory usage;
+                 Computational efficiency; HUG",
+  thesaurus =    "Automatic programming; Data structures; Ray tracing",
+  who  = "Havran Vlastimil: RT-0054",
+}
+ 
+@Article{Simiakakis:1994:FAS,
+ author=        "G. Simiakakis and A. M. Day",
+ title=         "Five-dimensional Adaptive Subdivision for Ray Tracing",
+ journal   =    "Com{\-}pu{\-}ter Graphics Forum",
+ volume    =    "13",
+ number    =    "2",
+ pages     =    "133--140",
+ month     =    jun,
+ year      =    "1994",
+ coden     =    "CGFODY",
+ ISSN      =    "0167-7055",
+ bibdate   =    "Fri Sep 13 06:30:31 MDT 1996",
+ acknowledgement  = ack-nhfb,
+ classification = "C6130B (Graphics techniques)",
+ keywords  =  "Five-dimensional adaptive subdivision; Ray tracing; Directional
+               subdivision method; Memory saving scheme",
+ pubcountry =   "UK",
+ thesaurus =    "Computer graphics; Ray tracing",
+ who  = "Havran Vlastimil: RT-0053",
+}
+
+@InCollection{Voorhies90,
+  author =       "Douglas Voorhies",
+  editor =       "James Arvo",
+  title =        "Space-Filling Curves and a Measure of Coherence",
+  booktitle =    "Graphics Gems",
+  pages =        "257--262",
+  publisher =    "Academic Press",
+  address =      "San Diego",
+  year =         "1990",
+  who  = "Havran Vlastimil: RT-0052",
+}
+
+@Article{Yagel:1992:DRT,
+  author =       "Roni Yagel and Daniel Cohen and Arie Kaufman",
+  title =        "Discrete Ray Tracing",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "12",
+  number =       "5",
+  pages =        "19--??",
+  month =        sep,
+  year =         "1992",
+  coden =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
+  abstract =     "This ray tracing method, called 3D raster ray tracing,
+                 is insensitive to a scene's complexity and thus
+                 substantially improves computational speed over
+                 existing algorithms.",
+  acknowledgement = ack-nhfb,   
+  who  = "Havran Vlastimil: RT-0051",
+}
+
+InProceedings{Stolte:1995:DRT,
+  author =       "N. Stolte and R. Caubet",
+  title =        "Discrete Ray Tracing High Resolution {3D} Grids",
+  booktitle =    "Winter School of Computer Graphics 1995",
+  year =         "1995",
+  month =        feb,
+  note =         "held at University of West Bohemia, Plzen, Czech
+                 Republic, 14-18 February 1995",
+  who  = "Havran Vlastimil: RT-0050",
+}
+
+@TechReport{EVL-1996-84,
+  author =       "S. Campagna and Ph. Slusallek",
+  title =        "Rendering of Quadric Surfaces According to the
+                 RenderMan-Standard",
+  number =       "5",
+  institution =  "Universit{\"a}t Erlangen-N{\"u}rnberg",
+  year =         "1996",
+  abstract =     "Rendering of high-quality pictures has two basic
+                 requirements: a renderer and a modeler. In practice,
+                 only the modeler has to comunicate with the renderer.
+                 Usually this is done by a specified file-format. Each
+                 renderer capable of that format has to produce pictures
+                 with exactly the desired surfaces, e.g. compared to a
+                 reference-platform. One popular and powerful format is
+                 the RenderMan Interface Bytestream Protocol by Pixar.
+                 Unfortunately, its specification is ambiguous in some
+                 cases. This paper clarifies the usage especially of the
+                 geometric primitives according to the
+                 RenderMan-Interface.",
+  postscript-url = "ftp://faui90.informatik.uni-erlangen.de/pub/Publications/1996/TR.1996.5.ps.gz",
+  postscript-url-md5 = "0ad1de6e9d65add7b740cfff92a03238",
+  evlib-url =    "http://infovis.zib.de:8000/Dienst/UI/2.0/Describe/evl.surfacerendering%2FEVL-1996-83",
+  evlib-revision = "1st",
+  who  = "Havran Vlastimil: RT-0049",
+}
+
+@TechReport{EVL-1996-83,
+  author =       "S. Campagna and W. Heidrich and Ph. Slusallek",
+  title =        "Rendering of Geometric Primitives According to the
+                 RenderMan-Standard",
+  number =       "5",
+  institution =  "Universit{\"a}t Erlangen-N{\"u}rnberg",
+  year =         "1996",
+  abstract =     "Rendering of high-quality pictures has two basic
+                 requirements: a renderer and a modeler. In practice,
+                 only the modeler has to comunicate with the renderer.
+                 Usually this is done by a specified file-format. Each
+                 renderer capable of that format has to produce pictures
+                 with exactly the desired surfaces, e.g. compared to a
+                 reference-platform. One popular and powerful format is
+                 the RenderMan Interface Bytestream Protocol by Pixar.
+                 Unfortunately, its specification is ambiguous in some
+                 cases. This paper clarifies the usage especially of the
+                 geometric primitives according to the
+                 RenderMan-Interface.",
+  postscript-url = "ftp://faui90.informatik.uni-erlangen.de/pub/Publications/1996/TR.1996.5.ps.gz",
+  postscript-url-md5 = "0ad1de6e9d65add7b740cfff92a03238",
+  evlib-url =    "http://infovis.zib.de:8000/Dienst/UI/2.0/Describe/evl.surfacerendering%2FEVL-1996-83",
+  evlib-revision = "1st",
+  who  = "Havran Vlastimil: RT-0048",
+}
+
+@InProceedings{Haines94,
+  author =       "Eric A. Haines and John R. Wallace",
+  editor =       "P. Brunet and F. W. Jansen",
+  title =        "Shaft Culling for Efficient Ray-Traced Radiosity",
+  booktitle =    "Photorealistic Rendering in Computer Graphics
+                 (Proceedings of the Second Eurographics Workshop on
+                 Rendering)",
+  publisher =    "Springer-Verlag",
+  address =      "New York, NY",
+  year =         "1994",
+  keywords =     "ray tracing",
+  note =         "also available via FTP from
+                 princeton.edu:/pub/Graphics/Papers",
+  anote =         "also in ACM SIGGRAPH '91 Course Notes - Frontiers in
+                 Rendering",
+  who  = "Havran Vlastimil: RT-0047",
+}
+
+@TechReport{Loofbourrow93,
+  author =       "Nathan Loofbourrow",
+  title =        "Optimizing ray tracing with visual coherence",
+  institution =  "Carnegie-Mellon University, Department of Computer
+                 Science",
+  number =       "CMU-CS-93-209",
+  year =         "1993",
+  keywords =     "adaptive sampling, nonuniform sampling, antialiasing,
+                 filtering, progressive refinement",
+  who  = "Havran Vlastimil: RT-0046",
+}
+
+@InProceedings{gunter96,
+  author =       "Gunter Raidl and Wilhelm Barth",
+  title =        "Fast Adaptive Previewing by Ray Tracing",
+  pages =        "(do not know)",
+  booktitle =    "Summer school in computer graphics in Bratislava (SCCG96)",
+  year =         "1996",
+  month =        jun,
+  keywords =     "ray tracing, previewing",
+  who  = "Havran Vlastimil: RT-0045",
+}
+
+@Article{MacDonald90,
+      author =       "J. David MacDonald and Kellogg S. Booth",
+      title =        "Heuristics for Ray Tracing Using Space Subdivision",
+      journal =      "Visual Computer",
+      pages =        "153--65",
+      publisher =    "Springer Verlag",
+      year =         "1990", 
+      volume =       "6",
+      number =       "6",
+     who  = "Havran Vlastimil: RT-0044",
+}
+
+@InCollection{Sung92,
+      author =       "Kelvin Sung and Peter Shirley",
+      editor =       "David Kirk",
+      title =        "Ray Tracing with the {BSP} Tree",
+      booktitle =    "Graphics Gems III",
+      pages =        "271--274",
+      publisher =    "Academic Press",
+      address =      "San Diego",
+      year =         "1992",
+      keywords =     "efficiency, BSP tree, octree",
+      note =         "includes code",
+ who  = "Havran Vlastimil: RT-0043",
+}
+
+@Article{Whang:1995:ORA,  
+ author =       "K. Y. Whang and J. W. Song and J. W. Chang and J. Y.
+                 Kim and W. S. Cho and C. M. Park and I. Y. Song",  
+ title =        "{Octree-R}: an adaptive octree for efficient ray tracing",
+ journal =      "IEEE Transactions on Visualization and Computer Graphics",  
+ year =         "1995",  
+ volume =       "1",
+ number =       "4",
+ pages =        "343--349",
+ month =        dec,
+ note =         "ISSN 1077-2626",
+ who  = "Havran Vlastimil: RT-0042",
+}
+
+@PhdThesis{Thompson:1991:RTA,
+        author =       "Karl Kelvin Thompson",
+        title =        "Ray tracing with amalgams",
+        month =        may,
+        year =         "1991",
+        type =         "Ph.D. Thesis",
+        school =       "University of Texas at Austin",
+        annote =       "Supervisors: Alan Bovik and Donald Fussell; Traditional ray tracing 
+	databases that use bounding volumes attach only geometric properties (e.g.
+	position, orientation, size) to each bounding volume. By also associating 
+	shading properties (e.g. color, translucency, reflectance) with each bounding 
+	volume, the database can become a multi-resolution database - a database that 
+	represents objects at different levels of detail. Specifically, the bounding
+	region itself may be rendered to coarsely represent the objects inside it. 
+	With a minor extension to the traditional ray tracing algorithm, a ray tracing 
+	renderer can traverse such a database with fewer intersection tests per ray, 
+	improving antialiasing, and (arguably) better asymptotic time complexity. The 
+	enhanced database and algorithm are particularly suited to scenes containing a 
+	large number of	primitives at a wide range of scales.",
+  who  = "Havran Vlastimil: RT-0041",
+}
+
+@Article{cleary88a,
+        author =       "John G. Cleary and Geoff Wyvill",
+        title =        "Analysis of an algorithm for fast ray tracing using
+                       uniform space subdivision",
+        journal =      "The Visual Computer",
+        pages =        "65--83",
+        volume =       "4",
+        number =       "2",
+        month =        jul,
+        year =         "1988",
+        keywords =     "rendering",
+        annote =       "Ray tracing is becoming popular as the best method of
+                       rendering high quality images from three dimensional
+                       models. Unfortunately, the computational cost is high.
+                       Recently, a number of authors have reported on ways to
+                       speed up this process by means of space subdivision
+                       which is used to minimize the number of intersection
+                       calculations. We describe such an algorithm together
+                       with an analysis of the factors which affect its
+                       performance. The critical operation of skipping an
+                       empty space subdivision can be done very quickly, using
+                       only integer addition and comparison. A theoretical
+                       analysis of the algorithm is developed. It shows how
+                       the space and time requirements vary with the number of
+                       objects in the scene.",
+  who  = "Havran Vlastimil: RT-0040",
+}
+
+@InProceedings{Arvo86-BRT,
+  author =       "James R. Arvo",
+  month =        aug,
+  year =         "1986",
+  title =        "Backward {Ray} {Tracing}",
+  booktitle =    "ACM SIGGRAPH '86 Course Notes - Developments in Ray
+                 Tracing",
+  volume =       "12",
+  keywords =     "light tracing",
+  comments =     "also appeared in ACM SIGGRAPH '89 Course Notes -
+                 Radiosity",
+  who  = "Havran Vlastimil: RT-0039",
+}
+
+@Article{Chuang:1995:NSS,
+  author =       "Jung-Hong Chuang and Weun-Jier Hwang",
+  title =        "A new space subdivision for ray tracing {CSG} solids",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "15",
+  number =       "6",
+  pages =        "56--62",
+  month =        nov,
+  year =         "1995",
+  coden =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Natl Chiao Tung Univ",
+  affiliationaddress = "Hsinchu, Taiwan",
+  classification = "721.1; 722.2; 723.2; 723.5; 921.4",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "Algorithms; Computational complexity; Computational
+                 methods; Computer graphics; Computer simulation;
+                 Constructive solid geometry; Heuristic methods; Image
+                 processing; Ray tracing; Space subdivision; Trees
+                 (mathematics)",
+ who  = "Havran Vlastimil: RT-0038",
+}
+
+@Article{wolff90a,
+  author =       "Lawrence B. Wolff and David J. Kurlander",
+  title =        "Ray Tracing with Polarization Parameters",
+  journal =      "IEEE Computer Graphics and Applications",
+  pages =        "44--55",
+  volume =       "10",
+  number =       "6",
+  month =        nov,
+  year =         "1990",
+  keywords =     "ray tracing, lighting model, Torrance-Sparrow,
+                 Fresnel, polarization",
+  annote =       "Implement a polarization scheme for the reflection off
+                 surfaces with the Torrance-Sparrow illumination model.
+                 They use a technique suggested by Emil Wolf, a 2x2
+                 matrix that indicates the polarization state of the
+                 wavelength. \\ We demonstrate that incorporating
+                 polarization parameters into the lighting model can
+                 enhance the physical realism of images rendered with a
+                 ray tracer. Polarization effects can be importantin
+                 certain scenes, and the difference in rendering even
+                 simple scenes with and without proper treatment of
+                 polarization can be rather striking. All light waves
+                 possess a state of polarization, which changes almost
+                 every time light reflects off a material surface. A
+                 single reflection partially polarizes and may even
+                 completely polarize previously unpolarized light.
+                 Polarization influences the rendering of a scene
+                 because the reflected radiant intensity depends largely
+                 on the incident light wave's polarization state. \\ We
+                 have incorporated Emil Wolf's coherence matrix
+                 formalism for polarization into the Torrance-Sparrow
+                 reflectance model. This combination enables elegant
+                 quantitative derivations of the altered polarization
+                 state of light upon reflection in a ray tracer.
+                 Comparisons of identicala scenes rendered with a
+                 conventional ray tracer and our ray tracer.
+                 Incorporating a polarization model show that our method
+                 renders specular interobject reflections more
+                 accurately with respect to reflected radiance and
+                 color.",
+  who  = "Havran Vlastimil: RT-0037",
+}
+
+@Article{Endl:1994:CRU,
+  author =       "R. Endl and M. Sommer",
+  title =        "Classification of ray-generators in uniform
+                 subdivisions and octrees for ray tracing",
+  journal =      "Com{\-}pu{\-}ter Graphics Forum",
+  volume =       "13",
+  number =       "1",
+  pages =        "3--19",
+  month =        mar,
+  year =         "1994",
+  coden =        "CGFODY",
+  ISSN =         "0167-7055",
+  bibdate =      "Fri Sep 13 06:30:31 MDT 1996",
+  acknowledgement = ack-nhfb,
+  classification = "C6130B (Graphics techniques); C6120 (File
+                 organisation); C6180 (User interfaces)",
+  keywords =     "Ray-generator classification; Uniform subdivisions;
+                 Octrees; Ray tracing; Spatial subdivisions; Ray-object
+                 intersections; Ray-cell sequence generation;
+                 X-ray-generators; Global time measurements; Random
+                 rays; Ray cell initialization; Ray cell determination",
+  pubcountry =   "UK",
+  thesaurus =    "Computer graphics; Ray tracing; Tree data structures",
+ who  = "Havran Vlastimil: RT-0036",
+}
+
+@Article{goldsmith87a,
+        author =       "Jeffrey Goldsmith and John Salmon",
+        title =        "Automatic Creation of Object Hierarchies for Ray
+                       Tracing",
+        pages =        "14--20",
+        journal =      "IEEE Computer Graphics and Applications",
+        volume =       "7",
+        number =       "5",
+        year =         "1987",
+        month =        may,
+        keywords =     "ray tracing cull, bounding volume",
+        annote =       "Intersection calculations dominate the run time of
+                       canonical ray tracers. A common algorithm to reduce the
+                       number of intersection tests required is the
+                       intersection of rays with a tree of extents, rather
+                       than the whole database of objects. A shortcomming of
+                       this method is that these trees are difficult to
+                       generate. Additionally, manually generated trees are
+                       poor, greatly reducing the run-time improvement
+                       available. We present methods for evaluation of these
+                       trees in approximate number of intersection
+                       calculations required and for automatic generation of
+                       good trees. These methods run in $O(n \log n)$ expected
+                       time where $n$ is the number of objects in the scene.
+                       Some examples of speedup are reported.",
+  who  = "Havran Vlastimil: RT-0035",
+}
+
+@InProceedings{arvo87a,
+        author =       "James Arvo and David Kirk",
+        title =        "Fast Ray Tracing by Ray Classification",
+        pages =        "55--64",
+        booktitle =    "(SIGGRAPH '87 Proceedings)",
+        volume =       "21",
+        number =       "4",
+        year =         "1987",
+        month =        jul,
+        editor =       "Maureen C. Stone",
+        conference =   "held in Anaheim, California; 27 -- 31 July 1987",
+        keywords =     "visible surface algorithms, extent, bounding volume,
+                       hierarchy, traversal, octree",
+        annote =       "five dimensional space subdivision \\ We describe a
+                       new approach to ray tracing which drastically reduces
+                       the number of ray-object and ray-bounds intersection
+                       calculations by means of 5-dimensional space
+                       subdivision. Collections of rays originating from a
+                       common 3D rectangular volume and directed through a 2D
+                       solid angle are represented as hypercubes in 5-space. A
+                       5D volume bounding the space of rays is dynamically
+                       subdivided into hypercubes, each linked to a set of
+                       objects which are candidates for intersection. Rays are
+                       classified into unique hypercubes and checked for
+                       intersection with the associated candidate object set.
+                       We compare several techniques for object extent
+                       testing, including boxes, spheres, plane-sets, and
+                       convex poyhedra. In addition, we examine optimizations
+                       made possible by the directional nature of the
+                       algorithm, such as sorting, caching and backface
+                       culling. Results indicate that this algorithm
+                       significantly outperforms previous ray tracing
+                       techniques, especially for complex environments.",
+ who  = "Havran Vlastimil: RT-0034",
+}
+
+@InCollection{Arvo:1990:RTM,
+  author =       "James Arvo",
+  title =        "Ray Tracing with Meta-Hierarchies",
+  year =         "1990",
+  month =        aug,
+  booktitle =    "SIGGRAPH '90 Advanced Topics in Ray Tracing course
+                 notes",
+  keywords =     "hierarchical space subdivision, octree, grid
+                 subdivision",
+  publisher = "ACM Press",
+  who  = "Havran Vlastimil: RT-0033",
+}
+
+@InProceedings{Cassen95,
+      author =       "Cassen T. and Subramanian K.R. and Michalewicz Z.",
+      title =        "Near-Optimal Construction of Partitioning Trees by
+		      Evolutionary Techniques",
+      booktitle =    "Proceedings of Graphics Interface '95",
+      pages =        "263--271",
+      address =      "Canada",
+      month =        jun,
+      year =         "1995",
+      keywords =     "BSP tree, genetic algorithms",
+ who  = "Havran Vlastimil: RT-0032",
+}
+
+@Article{Samet89,
+        author =       "Hanan Samet",
+        title =        "Implementing Ray Tracing with Octrees and Neighbor
+                       Finding",
+        journal =      "Computers and Graphics",
+        volume =       "13",
+        number =       "4",
+        pages =        "445--60",
+        year =         "1989",
+        keywords =     "octree",
+        note =         "includes code",
+        anote = "A Ray Tracing implementation is described that is based on 
+		an octree representation of a scene. Rays are traced through 
+		the scene by calculating the blocks through which they pass. 
+		This calculation is performed in a bottom-up manner through 
+		the use of neighbor finding. The octrees are assumed to be
+		implemented by a pointer representation.",
+ who  = "Havran Vlastimil: RT-0031",
+}
+
+@InProceedings{wallace89a,
+  author =       "John R. Wallace and Kells A. Elmquist and Eric A.
+                 Haines",
+  title =        "A Ray Tracing Algorithm for Progressive Radiosity",
+  pages =        "315--324",
+  booktitle =      "SIGGRAPH '89 Proceedings",
+  journal =      "Computer Graphics (SIGGRAPH '89 Proceedings)",
+  year =         "1989",
+  month =        jul,
+  conference =   "held in Boston, Massachusetts; 31 July -- 4 August
+                 1989",
+  keywords =     "radiosity, ray tracing, progressive refinement,
+                 distributed ray tracing, global illumination",
+  annote =       "calculating form-factors via ray tracing to avoid
+                 hemicube problems \\ A new method for computing
+                 form-factors within a progressive radiosity approach is
+                 presented. Previously, the progressive radiosity
+                 approach has depended on the use of the hemi-cube
+                 algorithm to determine form-factors. However, sampling
+                 problems inherent in the hemi-cube algorithm limit its
+                 usefulness for complex images. A more robust approach
+                 is described in which ray tracing is used to perform
+                 the numerical integration of the form-factor equation.
+                 The approach is tailored to provide good, approximate
+                 results for a low number of rays, while still providing
+                 a smooth continuum of increasing accuracy for higher
+                 number of rays. Quantitative comparisons between
+                 analytically derived form-factors and ray traced
+                 form-factors are presented.",
+  who  = "Havran Vlastimil: RT-0030",
+}
+
+
+@InProceedings{peng87a,
+      author =       "Qunsheng Peng and Yining Zhu and Youdong Liang",
+      title =        "A Fast Ray Tracing Algorithm Using Space Indexing
+                     Techniques",
+      pages =        "11--23",
+      booktitle =    "Eurographics '87",
+      year =         "1987",
+      month =        aug,
+      editor =       "G. Marechal",
+      publisher =    "North-Holland",
+      conference =   "European Computer Graphics Conference and Exhibition;
+                     held in Amsterdam, The Netherlands; 24 -- 28 August
+                     1987",
+      keywords =     "octree",
+      annote =       "A fast ray tracing algorithm is presented. Spatial
+                     coherency is exploited by adopting a linear octree data
+                     structure which corresponds to an adaptive partitioning
+                     of space. A ray strides over a number of empty regions
+                     aligning on its way and intersects the desired objects
+                     directly. Efficiency of the algorithm is achieved by
+                     decreasing the number of regions that the ray must be
+                     checked with, by reducing the computations involved in
+                     skipping an empty region and performing a binary search
+                     to find the next region. An efficient algorithm based
+                     on linear programming for mapping the whole environment
+                     into a sorted linear octree is also described. Only the
+                     terminal nodes containing boundary surfaces of objects
+                     are explicitly represented, which not only shortens the
+                     searching process but also leads to a considerable
+                     saving on storage space.",
+ who  = "Havran Vlastimil: RT-0029",
+}
+
+@InProceedings{Ward:1991:AST,
+      author =       "Gregory Ward",
+      title =        "Adaptive shadow testing for ray tracing",
+      booktitle =    "Eurographics Workshop on Rendering",
+      year =         "1991",
+      conference =   "held in Barcelona, Spain; 13-15 May 1991",
+      annote =       "Method for reducing the number of shadow rays for
+                     scenes with a large number of light sources. The
+                     sources are sorted on their contribution, and only for
+                     the most important sources rays are cast. The influence
+		     of the other sources is estimated statistically. Tests
+                     are done with different tolerances (threshold to
+                     determine whether sources are important) and
+                     certainties (rate of accuracy). The method gives good
+                     reduction and is able to find the most important
+                     shadows because it selects contrast as criterion.",
+ who  = "Havran Vlastimil: RT-0028",
+}
+
+@Article{Pradhan:1991:ACD, 
+ author = "B. S. S. Pradhan and A. Mukhopadhyay",
+ title  = "Adaptive cell division for ray tracing",
+ journal= "Computers and Graphics",
+ volume = "15",
+ number = "4",
+ pages  = "549--552",
+ year   = "1991",
+ coden  = "COGRD2",
+ ISSN   = "0097-8493",
+ bibdate= "Wed Feb 5 07:22:58 MST 1997",
+ acknowledgement= ack-nhfb,
+ affiliation="Indian Inst of Technology",
+ affiliationaddress="Kanpur, India",
+ classification="723",
+ journalabr="Comput Graphics (Pergamon)",
+ keywords="Computer Graphics; Data Processing--Data Structures; Three Dimensional Graphics",
+ who  = "Havran Vlastimil: RT-0027",
+}
+
+@Article{scherson87a,
+        author =       "Isaac D. Scherson and Elisha Caspary",
+        title =        "Data Structures and the Time Complexity of Ray
+                       Tracing",
+        pages =        "201--213",
+        journal =      "The Visual Computer",
+        volume =       "3",
+        number =       "4",
+        year =         "1987",
+        month =        dec,
+        annote =       "The time complexity of ray tracing is a function of
+                       the data structures used for space division. Octree and
+                       hierarchical extents have been suggested as effective
+                       choices. In this paper, complexity parameters are
+                       suggested to characterize images and show that both
+                       octrees and hierarchies are appropriate choices if
+                       given most favorable images. Also, a unified technique
+                       is proposed and shown to be better than previous
+                       methods for all images. Octrees and hierarchies are
+                       particular cases of the new proposed algorithm.",
+  who  = "Havran Vlastimil: RT-0026",
+}
+
+@InProceedings{Reinhard96,
+ author=	"Erik Reinhard and Arjan J. F. Kok and Frederik W. Jansen",
+ title =	"Cost Prediction in Ray Tracing",
+ booktitle=	"Rendering Techniques '96 (Proceedings of the Seventh Eurographics
+		Workshop on Rendering)",
+ pages=		"41--50",
+ publisher=	"Springer-Verlag/Wien",
+ address=	"New York, NY",
+ year=		"1996",
+ ISBN=		"3-211-82883-4",
+  who  = "Havran Vlastimil: RT-0025",
+} 
+
+@InProceedings{devillers89a,
+        author =       "Olivier Devillers",
+        title =        "The Macro-regions: an Efficient Space Subdivision
+                       Structure for Ray Tracing",
+        pages =        "27--38",
+        booktitle =    "Eurographics '89",
+        year =         "1989",
+        month =        sep,
+        editor =       "W. Hansmann and F. R. A. Hopgood and W. Strasser",
+        publisher =    "Elsevier / North-Holland",
+        conference =   "European Computer Graphics Conference and Exhibition;
+                       h eld in , ; -- September 1989",
+        annote =       "Ray tracing is the usual image synthesis technique
+                       which allows rendering of specular effects. The use of
+                       space subdivision for ray tracing optimization is
+                       studied. A new method of subdivision is proposed: the
+                       macro-regions. This structure allows a different
+                       treatment of the regions with a low density of
+                       information, and the regions with a high density of
+                       information. A theoretical and practical study of space
+                       subdivision methods--grid, octree--and the
+                       macro-regions structure is presented.",
+  who  = "Havran Vlastimil: RT-0024",
+}
+
+@Article{Stolte:1995:DRH,
+  author =       "N. Stolte and R. Caubet",
+  title =        "Discrete Ray-Tracing of Huge Voxel Spaces",
+  journal =      "Com{\-}pu{\-}ter Graphics Forum",
+  volume =       "14",
+  number =       "3",
+  pages =        "C/383--C/394",
+  month =        sep,
+  year =         "1995",
+  coden =        "CGFODY",
+  ISSN =         "0167-7055",
+  bibdate =      "Fri Jul 18 14:10:31 1997",
+  acknowledgement = ack-nhfb,
+  classification = "C1160 (Combinatorial mathematics); C5470
+                 (Performance evaluation and testing); C6120 (File
+                 organisation); C6130B (Graphics techniques)",
+  conflocation = "Maastricht, Netherlands; 18 Aug.-1 Sept. 1995",
+  conftitle =    "EUROGRAPHICS '95",
+  corpsource =   "Inst. de Recherche en Inf. de Toulouse, France",
+  keywords =     "3D; 3D grid resolution; discrete ray tracing voxel
+                 spaces; Discrete ray tracing voxel spaces; discrete
+                 traversal; Discrete traversal; discrete traversal; grid
+                 resolution; Huge voxel spaces; huge voxel spaces;
+                 memory problem; Memory problem; octree; Octree;
+                 octrees; optimal times; Optimal times; optimal times;
+                 performance evaluation; Practical visualization
+                 algorithm; practical visualization algorithm; raster;
+                 Raster ray tracing; ray tracing; three dimensional DDA;
+                 Three dimensional DDA; three dimensional DDA",
+  thesaurus =    "Octrees; Performance evaluation; Ray tracing",
+  treatment =    "P Practical",
+  who  = "Havran Vlastimil: RT-0023",
+}
+
+
+@InProceedings{kay86a,
+        author =       "Timothy L. Kay and James T. Kajiya",
+        title =        "Ray Tracing Complex Scenes",
+        pages =        "269--278",
+        booktitle =    "SIGGRAPH '86 Proceedings)",
+        journal =      "Computer Graphics (SIGGRAPH '86 Proceedings)",
+        volume =       "20",
+        number =       "4",
+        year =         "1986",
+        month =        aug,
+        editor =       "David C. Evans and Rusell J. Athay",
+        conference =   "held in Dallas, Texas, August 18--22, 1986",
+        keywords =     "I37 ray tracing, cull, bounding volume",
+        annote =       "A new algorithm for speeding up ray-object
+                       intersection calculations is presented. Objects are
+                       bounded by a new type of extent, which can be made to
+                       fit convex hulls arbitrarily tightly. The objects are
+                       placed into a hierarchy. A new hierarchy traversal
+                       algorithm is presented which is efficient in the sense
+                       that objects along the ray are queried in an efficient
+                       order. \\ Results are presented which demonstrate that
+                       our technique is several times faster than other
+                       published algorithms. Furthermore, it is demonstrated
+                       that it is currently possible to ray trace scenes
+                       containing hundreds of thousands of objects.",
+  who  = "Havran Vlastimil: RT-0022",
+}
+
+@Article{Glassner:1984:SSF,
+        author =       "Andrew S. Glassner",
+        title =        "Space Subdivision For Fast Ray Tracing",
+        pages =        "15--22",
+        journal =      "IEEE Computer Graphics and Applications",
+        volume =       "4",
+        number =       "10",
+        year =         "1984",
+        month =        oct,
+        keywords =     "I35 Ray Tracing, culling, parallel processing,
+                       bounding volume, octree",
+        annote =       "use of octrees to speed intersection testing `If we
+                       want to reduce the time spent on ray-object
+                       intersections, we have at least two choices. We can
+                       speed up the intersection process itself, possibly with
+                       specialized hardware. Alternately, we can reduce the
+                       number of ray-object intersections that must be made to
+                       fully trace a given ray.''Goes onto to describe how to
+                       use octrees to reduce the number of intersection tests.
+                       Glassner proposes an octree as structure to partition
+                       space for faster ray tracing. The solution is
+                       interesting, but non-intuitive. It also has the problem
+                       of splitting objects among many octree nodes. Hence,
+                       the same object may be intersected multiple times per
+                       ray. Bleh!",
+  who  = "Havran Vlastimil: RT-0021",
+}
+
+@Article{Hsiung92,
+        author =       "Ping-Kang Hsiung and Robert H. Thibadeau",
+        title =        "Accelerating {ARTS}",
+        journal =      "The Visual Computer",
+        volume =       "8",
+        number =       "3",
+        pages =        "181--190",
+        month =        mar,
+        year =         "1992",
+        keywords =     "grid subdivision, hierarchical subdivision",
+        note =         "nested grid subdivision structures",
+  who  = "Havran Vlastimil: RT-0020",
+}
+
+@Article{fujimoto86a,
+        author =       "Akira Fujimoto and Takayuki Tanaka and Kansei Iwata",
+        title =        "{ARTS}: Accelerated Ray Tracing System",
+        pages =        "16--26",
+        journal =      "IEEE Computer Graphics and Applications",
+        volume =       "6",
+        number =       "4",
+        year =         "1986",
+        keywords =     "ray tracing cull, parallel processing, octree",
+        annote =       "Describes an encoding format, similar to octrees,
+                       which allows ray tracing to become as fast as other
+                       rendering methods for large databases. Good review of
+                       other techniques used to speed up ray tracing. Their
+                       method, SEADS (Spatially Enumerated Auxiliary Data
+                       Structures), {provides an environment for ray tracing
+                       that outpaces the hybrid octree approaches ... by an
+                       order of magnitude. Various experimental results have
+                       shown that the rendering time is virtually independent
+                       of the number of objects in the scene. When the number
+                       of objects is very large, ray tracing --- despite its
+                       reputation for ineffiency --- actually becomes faster
+                       than other rendering methods.} \\ In this paper, we
+                       propose algorithms that address the two basic problems
+                       encountered in generating continuous-tone images by ray
+                       tracing: speed and aliasing. We examine previous
+                       approaches to the problem and propose a scheme based on
+                       the coherency of an auxiliary data structure imposed on
+                       the original object domain. After investigating both
+                       simple spatial enumeration and a hybrid octree
+                       approach, we develop the 3DDDA, a 3D line generator,
+                       for efficient traversing of both structures. \\ 3DDDA
+                       provides an order of magnitude improvement in
+                       processing speed compared to other known ray-tracing
+                       methods. Processing time is found to be virtually
+                       independent of the number of objects involved in the
+                       scene. For large numbers of objects, this method
+                       actually becomes faster than scan-line methods. To
+                       remove jags from edges, a scheme for identifying edge
+                       orientation and distance from pixel center to true edge
+                       has been implemented. The time required for
+                       antialiasing depends on the total length of the edges
+                       encountered, but it is normally only a fractional
+                       addition to the time needed to produce the scene
+                       without antialiasing.",
+  who  = "Havran Vlastimil: RT-0019",
+}
+
+@InProceedings{bouatouch87a,
+        author =       "Kadi Bouatouch and M. O. Madani and Thierry Priol and
+                       Bruno Arnaldi",
+        title =        "A New Algorithm of Space Tracing Using a {CSG} Model",
+        pages =        "65--78",
+        booktitle =    "Eurographics '87",
+        year =         "1987",
+        month =        aug,
+        editor =       "G. Marechal",
+        publisher =    "North-Holland",
+        conference =   "European Computer Graphics Conference and Exhibition;
+                       held in Amsterdam, The Netherlands; 24 -- 28 August
+                       1987",
+        annote =       "This paper describes a new algorithm of space tracing.
+                       Scenes are modeled by a CSG tree. Space is subdivided
+                       regularly into 3D regions called boxes. With each box
+                       is associated a subtree which is the restriction of the
+                       whole scene CSG tree to primitives belonging to this
+                       box. A 3D grid is ued to access boxes.",
+  who  = "Havran Vlastimil: RT-0018",
+}
+
+@Article{Bouville:1985:GHQ,
+  author =       "C. Bouville and R. Brusq and J. L. Dubois and I.
+                 Marchal",
+  title =        "Generating High Quality Pictures by Ray-Tracing",
+  journal =      "Com{\-}pu{\-}ter Graphics Forum",
+  volume =       "4",
+  number =       "2",
+  pages =        "87--99",
+  month =        jun,
+  year =         "1985",
+  coden =        "CGFODY",
+  ISSN =         "0167-7055",
+  bibdate =      "Mon Apr 14 10:23:20 MDT 1997",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Cent Commun d'Etudes de Telediffusion et
+                 Telecommunications, Cesson-Sevigne, Fr",
+  affiliationaddress = "Cent Commun d'Etudes de Telediffusion et
+                 Telecommunications, Cesson-Sevigne, Fr",
+  classification = "723; 741; 921; A4210D (Wave-front and ray tracing in
+                 homogeneous media); C6130B (Graphics techniques)",
+  corpsource =   "Centre Commun d'Etudes de Telediffusion et
+                 Telecommun., Cesson-Sevigne, France",
+  keywords =     "algebraic surfaces; bodies of revolution --- Surfaces;
+                 casting; computational geometry; computer graphics;
+                 computer graphics --- Imaging Techniques; full lighting
+                 model; geometrical; high quality pictures developing;
+                 illumination model; image processing; lighting models;
+                 Mathematical Models; mathematical surface
+                 representation, design; optics; parallel; picture
+                 generation; processors; ray-; ray-casting technique;
+                 ray-tracing; surface of revolution; theoretical
+                 approach",
+  subject =      "J.6 Computer Applications, COMPUTER-AIDED ENGINEERING,
+                 Computer-aided design (CAD) \\ I.3.5 Computing
+                 Methodologies, COMPUTER GRAPHICS, Computational
+                 Geometry and Object Modeling, Curve, surface, solid,
+                 and object representations",
+  treatment =    "P Practical; T Theoretical or Mathematical",
+  who  = "Havran Vlastimil: RT-0017",
+}
+
+@Article{thomas89a,
+  author =       "D. Thomas and Arun N. Netravali and D. S. Fox",
+  title =        "Anti-aliased ray tracing with covers",
+  pages =        "325--336",
+  journal =      "Computer Graphics Forum",
+  volume =       "8",
+  number =       "4",
+  month =        dec,
+  year =         "1989",
+  publisher =    "North-Holland",
+  keywords =     "antialiasing",
+  annote =       "A fast and effective object space method for
+                 anti-aliasing ray-traced pictures is introduced.
+                 Traditionally, anti-aliasing has been done using
+                 super-sampling. However, this is costly since it
+                 requires casting large numbers of rays to obtain sample
+                 densities above the displayed pixel density. It is also
+                 wasteful since much of the information in these samples
+                 is discarded when they are filtered to yield the
+                 anti-aliasing pixels. We avoid these problems by
+                 performing the filtering in the object space using the
+                 geometry of ray-surface intersections rather than by
+                 casting extra rays. In addition, we only perform
+                 filtering at a pixel if edges are nearby. We detect
+                 these edges by observing the order in which the pixel's
+                 rays pass through cover surfaces constructed just
+                 inside and outside the surface of each object. Shadows,
+                 reflections and refractions can be anti-aliased using
+                 this method and a variety of object types can be
+                 handled including ellipsoids, polyhedra, and objects
+                 formed using set operations. \\ Our anti-aliasing gives
+                 high image quality that can only be approached by using
+                 super-sampling densities at least four times the
+                 display pixel density. Moreover, since the overhead of
+                 our method is small, it would take three to four times
+                 as long to render an anti-aliased image using
+                 super-sampling than it would with our method.
+                 Furthermore, covers allow sampling densities less than
+                 the displayed pixel density. When this is done,
+                 anti-aliased images can be rendered twice as fast as
+                 with no anti-aliasing and six to eight times as fast as
+                 when super-sampling is used for anti-aliasing.",
+  who  = "Havran Vlastimil: RT-0016",
+}
+
+@Article{Campagna:1997:RTS,
+  author =       "Swen Campagna and Philipp Slusallek and {Hans-Peter}
+                 Seidel",
+  title =        "Ray tracing of spline surfaces: {B}{\'{e}}zier
+                 clipping, {C}hebyshev boxing, and bounding volume
+                 hierarchy - a critical comparison with new results",
+  journal =      "The Visual Computer",
+  year =         "1997",
+  volume =       "13",
+  number =       "6",
+  pages =        "265--282",
+  publisher =    "Springer-Verlag",
+  note =         "ISSN 0178-2789",
+  keywords =     "ray tracing, spline surfaces, surface rendering",
+  annote =       "Ray tracing is a well-known rendering technique for
+                 producing high-quality and photorealistic pictures.
+                 Spline surfaces are also well known and widely used.
+                 Thus, there is the need for fast and robust methods for
+                 computing the intersections of rays with these
+                 surfaces. In this paper, we discuss and compare three
+                 recent geometric algorithms for solving the ray-patch
+                 intersection problem and present new results that are
+                 helpful in dealing with this problem.",
+  who  = "Havran Vlastimil: RT-0015",
+}
+
+@Article{Weghorst:1984:ICM,
+  author =       "Hank Weghorst and Gary Hooper and Donald P.
+                 Greenberg",
+  title =        "Improved Computational Methods for Ray Tracing",
+  journal =      "ACM Transactions on Graphics",
+  volume =       "3",
+  number =       "1",
+  pages =        "52--69",
+  month =        jan,
+  year =         "1984",
+  coden =        "ATGRDF",
+  ISSN =         "0730-0301",
+  annote =       "discussion of bounding volumes, hierarchical
+                 structures and the `item buffer'' \\ This paper
+                 describes algorithmic procedures that have been
+                 implemented to reduce the computational expense of
+                 producing ray-traced images. The selection of bounding
+                 volumes is examined to reduce the computational cost of
+                 the ray-intersection test. The use of object coherence,
+                 which relies on a hierarchical description of the
+                 environment, is then presented. Finally, since the
+                 building of the ray-intersection trees is such a large
+                 portion of the computation, a method using image
+                 coherence is described. This visible-surface
+                 preprocessing method, which is dependent upon the
+                 creation of an `item buffer,'' takes advantage of {\em
+                 a priori} image formation. Examples that indicate the
+                 efficiency of these techniques for a variety of
+                 representative environments are presented.",
+  keywords =     "bounding volume; I35 Ray Tracing",
+  who  = "Havran Vlastimil: RT-0014",
+}
+
+@InCollection{Kaplan:1987:USC,
+  author =       "Michael R. Kaplan",
+  title =        "The Use of Spatial Coherence in Ray Tracing",
+  booktitle =    "Techniques for Computer Graphics",
+  pages =        "173--193",
+  year =         "1987",
+  editor =       "David E. Rogers and Ray A. Earnshaw",
+  publisher =    "Springer Verlag",
+  keywords =     "octree",
+  annote =       "improved version of course notes article \\ Although
+                 ray tracing has proven to be a valuable technique in
+                 realistic image synthesis and a variety of other
+                 disciplines, it traditionally has not been viable in
+                 highly complex, unstructured environments. Spatial
+                 coherence algorithms for ray tracing are proposed as a
+                 solution to this problem, and the tradeoffs between
+                 various spatial coherence schemes are discussed.",
+  who  = "Havran Vlastimil: RT-0013",
+}
+
+@InProceedings{Zwaan95,
+        author =       "Maurice van der Zwaan and Erik Reinhard and Frederik
+                       W. Jansen",
+        title =        "Pyramid Clipping for Efficient Ray Traversal",
+        booktitle =    "Proceedings of the Sixth Eurographics Rendering
+                       Workshop",
+        address =      "Dublin, Ireland",
+        year =         "1995",
+  who  = "Havran Vlastimil: RT-0012",
+}
+
+@Article{badt88a,
+        author =       "Sig Badt Jr.",
+        title =        "Two Algorithms for Taking Advantage of Temporal
+                       Coherence in Ray Tracing",
+        pages =        "123--132",
+        journal =      "The Visual Computer",
+        volume =       "4",
+        number =       "3",
+        year =         "1988",
+        month =        sep,
+        annote =       "The basic ray-tracing algorithm is adapted to make
+                       ray-tracing faster for the production of motion
+                       pictures. Two algorithms are presented. The image space
+                       temporal coherence algorithm takes advantage of the
+                       fact that motion picture images do not change very much
+                       from frame to frame. The reprojection algorithm uses
+                       information about the object space saved from the
+                       previous frame to accelerate the processing of the
+                       current frame. The reprojection algorithm is used when
+                       the viewpoint of the current frame is changed by a
+                       small amount from the viewpoint of the previous
+                       frame.",
+  who  = "Havran Vlastimil: RT-0011",
+}
+
+@InProceedings{amanatides87b,
+        author =       "John Amanatides and Andrew Woo",
+        title =        "A fast voxel traversal algorithm for ray tracing",
+        pages =        "3--10",
+        booktitle =    "Eurographics '87",
+        year =         "1987",
+        month =        aug,
+        editor =       "G. Marechal",
+        publisher =    "North-Holland",
+        conference =   "European Computer Graphics Conference and Exhibition;
+                       held in Amsterdam, The Netherlands; 24 -- 28 August
+                       1987",
+        annote =       "uniform grid space subdivision \\ This paper discusses
+                       a fast and simple voxel traversal algorithm through a
+                       3D space partition. Going from one voxel to its
+                       neighbor requires only two floating point comparisons
+                       and one floating point addition. Also, multiple ray
+                       intersections with objects that are in more than one
+                       voxel are eliminated.",
+  who  = "Havran Vlastimil: RT-0010",
+}
+
+InProceedings{Kirk:1988:RTK,
+  author =       "David Kirk and James Arvo",
+  title =        "The Ray Tracing Kernel",
+  pages =        "75--82",
+  booktitle =    "Proceedings of Ausgraph '88",
+  year =         "1988",
+  annote =       "We describe a methodology for implementing a ray
+                 tracer which provides both a convenient testbed for
+                 developing new algorithms and a way to exploit the
+                 growing number of acceleration techniques. These
+                 benefits are a natural consequence of a collection of
+                 data abstractions called the ``ray tracing kernel.'' By
+                 defining an ``object'' in a broad sense, the kernel
+                 allows a single abstraction to encapsulate a wide
+                 spectrum of concepts including geometric primitives,
+                 acceleration techniques, CSG operators, and object
+                 transformations. Through hierarchical nesting of
+                 instances of these objects we are able to construct and
+                 efficiently render complex environments.",
+  who  = "Havran Vlastimil: RT-0009",
+}
+
+
+@InProceedings{Fournier:1993:RTA,
+  author =       "Alain Fournier and Pierre Poulin",
+  title =        "A Ray Tracing Accelerator Based on a Hierarchy of 1{D}
+                 Sorted Lists",
+  year =         "1993",
+  month =        may,
+  booktitle =    "Proceedings of Graphics Interface '93",
+  publisher =    "Canadian Information Processing Society",
+  pages =        "53--61",
+  address =      "Toronto, Ontario",
+  keywords =     "efficiency",
+  who  = "Havran Vlastimil: RT-0008",
+}
+
+@InProceedings{Thirion:1990:TDS,
+  author =       "Jean-Philippe Thirion",
+  title =        "{TRIES}: Data Structures Based on Binary
+                 Representation for Ray Tracing",
+  pages =        "531--541",
+  booktitle =    "Eurographics '90",
+  year =         "1990",
+  month =        sep,
+  editor =       "C. E. Vandoni and D. A. Duce",
+  publisher =    "North-Holland",
+  conference =   "European Computer Graphics Conference and Exhibition;
+                 held in Montreux, Switzerland; 3 -- 7 September 1990",
+  keywords =     "ray tracing, data structure, binary tree, boolean
+		 operation, trie",
+ who  = "Havran Vlastimil: RT-0007",
+}
+
+@InProceedings{Subramanian:1991:ATC, 
+ author       =         "K. R. Subramanian and Donald S. Fussell", 
+ title        =         "Automatic Termination Criteria for Ray Tracing  Hierarchies",
+ pages        =         "93--100", 
+ booktitle    =         "Proceedings of Graphics Interface '91", 
+ year         =         "1991", 
+ month        =         jun, 
+ conference   =         "held in Calgary, Alberta; 3-7 June 1991", 
+ keywords     =         "ray tracing, bounding volume, extent, partitioning plane, search structure, traversal", 
+ who  = "Havran Vlastimil: RT-0006",
+}
+
+
+@InProceedings{Formella94a,
+    author = "A. Formella and C. Gill and V. Hofmeyer",
+    title = "Fast Ray Tracing of Sequences by Ray History Evaluation",
+    booktitle = "Proceedings of Computer Animation '94",
+    conference = "Computer Animation '94",
+    pages = "184--191",
+    year = 1994,
+    month = may,
+    publisher = "IEEE Computer Society Press",
+    who  = "Havran Vlastimil: RT-0005",
+}
+
+@InProceedings{dauenhauer90a,
+        author =       "David Elliott Dauenhauer and Sudhanshu Kumar Semwal",
+        title =        "Approximate Ray Tracing",
+        pages =        "75--82",
+        booktitle =      "Proceedings of Graphics Interface '90",
+        year =         "1990",
+        month =        may,
+        conference =   "held in Halifax, Nova Scotia; 14-18 May 1990",
+        keywords =     "shading, rendering algorithm",
+        who  = "Havran Vlastimil: RT-0004",
+}
+
+@Article{Formella97a,
+  author =       "F. Aguado and F.P. Fontan and A. Formella",
+  title =      "Indoor and Outdoor Channel Simulator Based on Ray Tracing",
+  journal =      "IEEE Transactions on Magnetics",
+  year =         "1997",
+  volume =       "33",
+  number =       "2",
+  publisher =    "",
+  pages =        "1484--1487",
+  who  = "Havran Vlastimil: RT-0003",
+}
+
+@Article{Formella:1995:RTQ,
+  author =       "A. Formella and C. Gill",
+  title =        "Ray tracing: a quantitative analysis and a new
+                 practical algorithm",
+  journal =      "The Visual Computer",
+  year =         "1995",
+  volume =       "11",
+  number =       "9",
+  publisher =    "Springer-Verlag",
+  pages =        "465--476",
+  note =         "ISSN 0178-2789",
+  who  = "Havran Vlastimil: RT-0002",
+}
+
+@Article{Klimaszewski:1997:FRT,
+ author= 	"Kryzsztof S. Klimaszewski and Thomas W. Sederberg",
+ title = 	"Faster Ray Tracing Using Adaptive Grids",
+ journal= 	"IEEE Computer Graphics and Applications",
+ volume=        "17",
+ number =       "1",
+ pages  =       "42--51",
+ month  =       jan # "\slash " # feb,
+ year   =       "1997",
+ coden  =       "ICGADZ",
+ ISSN   =       "0272-1716",
+ bibdate=       "Sat Jan 25 10:55:04 MST 1997",
+ acknowledgement=ack-nhfb,
+ who  = "Havran Vlastimil: RT-0001",
+}
+
+@Article{Kwon98,
+  author = "Bomjun Kwon and Dae Seoung Kim and Kyung-Yong Chwa and
+            Sung Yong Shin",
+  title =        "Memory-Efficient Ray Classification for Visibility
+                  Operations",
+  journal =      "IEEE Transactions on Visualization and Computer Graphics",
+  volume =       "4",
+  number =       "3",
+  month =        {jul--sep},
+  year =         "1998",
+  pages =        "193--201",
+  abstract =     "",
+  keywords =     "ray shooting, ray classification, ray tracing, rendering",
+  who = "Havran Vlastimil: RT-0197",
+}
+
+
+
+
+
+
+
+
+
Index: trunk/VUT/doc/SciReport/Bib/shadow.bib
===================================================================
--- trunk/VUT/doc/SciReport/Bib/shadow.bib	(revision 243)
+++ trunk/VUT/doc/SciReport/Bib/shadow.bib	(revision 243)
@@ -0,0 +1,1484 @@
+% shadow.bib: bibliography on shadow algorithms,
+%     direct illumination,
+%     area light sources,
+%     soft shadows,
+%     texture mapping on graphics workstations,
+% and related topics including hemicubes and form factor calculation.
+%
+% Paul Heckbert, January 1997
+%
+% many entries copied from the CS bibliography at
+% http://liinwww.ira.uka.de/bibliography/index.html
+
+@INPROCEEDINGS{Herf96sketch,
+AUTHOR={Michael Herf and Paul S. Heckbert},
+TITLE={Fast Soft Shadows},
+BOOKTITLE={Visual Proceedings, SIGGRAPH 96},
+MONTH={Aug.},
+YEAR={1996},
+PAGES={145},
+KEYWORDS={penumbra, graphics workstation, accumulation buffer, texture mapping},
+}
+
+@TECHREPORT{Heckbert97shadow,
+AUTHOR={Paul S. Heckbert and Michael Herf},
+TITLE={Simulating Soft Shadows with Graphics Hardware},
+INSTITUTION={CS Dept., Carnegie Mellon U.},
+MONTH={Jan.},
+YEAR=1997,
+NOTE={CMU-CS-97-104, http://www.cs.cmu.edu/~ph},
+KEYWORDS={penumbra, texture mapping, graphics workstation,
+interaction, real-time, SGI Reality Engine},
+}
+
+@MISC{Herf97shadow,
+AUTHOR={Michael Herf and Paul S. Heckbert},
+TITLE={Soft Shadow Textures},
+NOTE={Submitted for publication},
+YEAR=1997,
+}
+
+@INPROCEEDINGS{Nishita83,
+AUTHOR={Tomoyuki Nishita and Eihachiro Nakamae},
+TITLE={Half-Tone Representation of 3-{D} Objects Illuminated by Area Sources
+or Polyhedron Sources},
+BOOKTITLE={COMPSAC '83, Proc. IEEE 7th Intl. Comp. Soft.
+and Applications Conf.},
+MONTH={Nov.},
+YEAR={1983},
+PAGES={237-242},
+KEYWORDS={shading, shadow, penumbra},
+}
+
+@INPROCEEDINGS{Nakamae84,
+AUTHOR={Eihachiro Nakamae and Hideo Yamashita and Kohichi Harada and Tomoyuki Nishita},
+TITLE={Computer Graphics for Visualizing Simulation Results},
+BOOKTITLE={Eurographics '84},
+MONTH={Sept.},
+YEAR={1984},
+PAGES={419-432},
+KEYWORDS={shadow, penumbra},
+}
+
+@ARTICLE{Nishita85,
+AUTHOR={Tomoyuki Nishita and Eihachiro Nakamae},
+TITLE={Continuous Tone Representation of 3-{D} Objects Taking Account of
+Shadows and Interreflection},
+JOURNAL={Computer Graphics
+(SIGGRAPH '85 Proceedings)},
+VOLUME={19},
+NUMBER={3},
+MONTH={July},
+YEAR={1985},
+PAGES={23-30},
+KEYWORDS={shading, penumbra, radiosity},
+}
+
+@TECHREPORT{Campbell91tr1,
+AUTHOR={Campbell, III, A. T. and Donald S. Fussell},
+TITLE={Analytic Illumination with Polygonal Light Sources},
+NOTE={TR-91-15},
+INSTITUTION={CS Dept, U of Texas at Austin},
+MONTH={April},
+YEAR={1991},
+KEYWORDS={shadow},
+ANNOTE={object space shadow algorithm, like Nishita83},
+}
+
+@TECHREPORT{Campbell91tr2,
+AUTHOR={Campbell, III, A. T. and Donald S. Fussell},
+TITLE={An Analytic Approach to Illumination with Area Light Sources},
+NOTE={TR-91-25},
+INSTITUTION={CS Dept, U of Texas at Austin},
+MONTH={August},
+YEAR={1991},
+KEYWORDS={shadow},
+ANNOTE={An early draft of chapters 5 and 6 of his dissertation},
+}
+
+@MastersThesis{Woo89,
+       author =       "Andrew C. H. Woo",
+       title =        "Accelerators for Shadow Determination in Ray Tracing",
+       pages =        "136",
+       month =        feb,
+       year =         "1989",
+       school =       "Department of Computer Science, University of
+                      Toronto",
+       keywords =     "ray tracing, regular grid subdivision, voxel, shadow,
+	efficiency, cull",
+     }
+
+@InProceedings{Woo90voxel,
+author =       "Andrew Woo and John Amanatides",
+title =        "Voxel Occlusion Testing: {A} Shadow Determination
+Accelerator for Ray Tracing",
+pages =        "213--220",
+booktitle =      "Proceedings of Graphics Interface '90",
+year =         "1990",
+month =        may,
+conference =   "Halifax, Canada",
+keywords =     "grid, intersection culling, occlusion, penumbra, ray
+tracing, shadows, umbra, voxel traversal",
+abstract =       "
+A shadow determination accelerator for ray tracing is
+presented. It is built on top of the uniform voxel
+traversal grid structure. The accelerator proves to be
+rather efficient, requires little additional memory and
+the worst case scenario per shadow determination just
+reduces down to traditional voxel traversal. It can
+also be extended to model linear, area lights, as well
+as atmospheric shadows.
+",
+}
+
+@ARTICLE{Woo90survey,
+AUTHOR={Andrew Woo and Pierre Poulin and Alain Fournier},
+TITLE={A Survey of Shadow Algorithms},
+JOURNAL={IEEE Computer Graphics and Applications},
+VOLUME={10},
+NUMBER={6},
+MONTH={Nov.},
+YEAR={1990},
+PAGES={13-32},
+ABSTRACT={
+Essential to realistic and visually appealing images,
+shadows are difficult to compute in most display
+environments. This survey characterizes the various
+types of shadows. It also describes most existing
+shadow algorithms and discusses their complexities,
+advantages, and shortcomings. We examine hard shadows,
+soft shadows, shadows of transparent objects, and
+shadows for complex modeling primitives. For each type,
+we examine shadow algorithms within various rendering
+techniques. This survey attempts to provide readers
+with enough background and insight on the various
+methods to allow them to choose the algorithm best
+suited to their needs. We also hope that our analysis
+will help identify the areas that need more research
+and point to possible solutions.
+},
+}
+
+@INCOLLECTION{Woo92,
+AUTHOR={Andrew Woo},
+TITLE={The Shadow Depth Map Revisited},
+BOOKTITLE={Graphics Gems III},
+EDITOR={David Kirk},
+PUBLISHER={Academic Press},
+ADDRESS={Boston, MA},
+YEAR={1992},
+PAGES={338-342, 582},
+KEYWORDS={z-buffer shadow, aliasing},
+annote =         "includes code",
+}
+
+@Article{Woo93,
+       author =       "Andrew Woo",
+       title =        "Efficient shadow computations in ray tracing",
+       journal =      "IEEE Computer Graphics and Applications",
+       pages =        "78--83",
+       volume =       "13",
+       number =       "5",
+       month =        sep,
+       year =         "1993",
+       annote =       "Two simple techniques speed up shadows in ray tracing.
+                      Both require little memory and easily extend to other
+                      ray types. One can also benefit radiosity-related
+                      computations.",
+     }
+
+@InProceedings{Poulin90shadow,
+       author =       "Pierre Poulin and John Amanatides",
+       title =        "Shading and Shadowing with Linear Light Sources",
+       pages =        "377--386",
+       booktitle =    "Eurographics '90",
+       year =         "1990",
+       month =        sep,
+       publisher =    "North-Holland",
+       keywords =     "soft shadow",
+     }
+
+
+@ARTICLE{Bao93,
+AUTHOR={Hujun Bao and Qunsheng Peng},
+TITLE={Shading Models for Linear and Area Light Sources},
+JOURNAL={Computers and Graphics},
+VOLUME={17},
+NUMBER={2},
+YEAR={1993},
+PAGES={137-145},
+KEYWORDS={shadow, penumbra},
+}
+
+@INPROCEEDINGS{Vedel93,
+AUTHOR={Christophe Vedel},
+TITLE={Computing Illumination from Area Light Sources by Approximate Contour
+Integration},
+BOOKTITLE={Proc. Graphics Interface '93},
+PUBLISHER={Canadian Inf. Proc. Soc.},
+ADDRESS={Toronto, Ontario},
+MONTH={May},
+YEAR={1993},
+PAGES={237-244},
+KEYWORDS={shadow, penumbra},
+}
+
+@InProceedings{Chin90,
+AUTHOR={Norman Chin and Steven Feiner},
+TITLE={Near Real-Time Shadow Generation Using {BSP} Trees},
+booktitle={Proceedings of SIGGRAPH '90},
+MONTH={Aug.},
+YEAR={1990},
+PAGES={99-106},
+}
+
+@INPROCEEDINGS{Chin92,
+AUTHOR={Norman Chin and Steven Feiner},
+TITLE={Fast Object-Precision Shadow Generation for Area Light Sources using
+{BSP} Trees},
+BOOKTITLE={1992 Symp. on Interactive 3D Graphics},
+PUBLISHER={ACM SIGGRAPH},
+MONTH={Mar.},
+YEAR={1992},
+PAGES={21-30},
+}
+
+@TechReport{Chin90t,
+       author =       "Norman Chin",
+       title =        "Near Real-Time Object-Precision Shadow Generation
+                      Using {BSP} Trees---Master Thesis",
+       institution =  "University of Columbia",
+       number =       "CUCS-068-90",
+       year =         "1990",
+       abstract =     "This master's thesis describes an object-precision
+                      shadow generation algorithm for static polygonal
+                      environments illuminated by movable point light
+                      sources. The algorithm can be easily implemented on any
+                      graphics system that provides fast polygon
+                      scan-conversion and achieves near real-time performance
+                      for environments of modest size. It combines elements
+                      of two kinds of current shadow generation algorithms:
+                      two-pass object-precision approaches and shadow volume
+                      approaches. This algorithm is an example of a new
+                      paradigm for shadow generation. Previously, the
+                      shadowing the problem can be viewed as solving the
+                      visible-surface problem from the point of view of a
+                      point light source. Another way to look at them, is
+                      from a geometric modeling point of view. By creating
+                      shadow volumes and then classifying polygons
+                      analytically against it, shadows can also be computed.
+                      Several optimizations are discussed. A way of reducing
+                      the amount of polygon fragmentation is shown by
+                      coalescing the fragments on the fly. Two methods of
+                      parallelizing the algorithm is presented. One method
+                      determines shadow fragments in parallel for a given
+                      light source. And more importantly, a method to handle
+                      shadowing from multiple point light sources independent
+                      of the number of light sources on workstations with
+                      alpha blending capabilities is described. Finally this
+                      algorithm has been extended to generate soft shadows by
+                      modeling area light sources. By initially meshing the
+                      scene into penumbra/umbra regions, and by adaptively
+                      meshing the penumbra regions with concentric contours
+                      similiar in shape to the outer penumbra region and by
+                      applying the point light source shadow algorithm to
+                      compute what fraction of an area light source is seen
+                      by a point to be rendered in the interior of the
+                      penumbra region and finally, by smooth shading the
+                      results, fuzzy shadows can be rendered. The future work
+                      section talks about combining all of the above to
+                      produce higher quality shadows in radiosity
+                      environments through adaptive meshing of the scene
+                      along penumbra/umbra boundaries via the area light
+                      source shadow algorithm and through analytically
+                      computing form-factors via the point light source
+                      shadow algorithm. Pseudocode is provided along with
+                      pictures and timings from an interactive
+                      implementation.",
+     }
+
+@InProceedings{Fuchs80,
+AUTHOR={Henry Fuchs and Zvi M. Kedem and Bruce F. Naylor},
+TITLE={On Visible Surface Generation by A Priori Tree Structures},
+booktitle={Proceedings of SIGGRAPH '80},
+MONTH={July},
+YEAR={1980},
+PAGES={124-133},
+KEYWORDS={hidden surface, BSP tree},
+}
+
+@ARTICLE{Brotman84,
+AUTHOR={Lynne Shapiro Brotman and Norman I. Badler},
+TITLE={Generating Soft Shadows with a Depth Buffer Algorithm},
+JOURNAL={IEEE Computer Graphics and Applications},
+VOLUME={4},
+NUMBER={10},
+MONTH={Oct.},
+YEAR={1984},
+PAGES={5-24},
+}
+
+@ARTICLE{Crow77,
+AUTHOR={Franklin C. Crow},
+TITLE={Shadow Algorithms for Computer Graphics},
+JOURNAL={Computer Graphics
+(SIGGRAPH '77 Proceedings)},
+VOLUME={11},
+NUMBER={2},
+MONTH={Summer},
+YEAR={1977},
+}
+
+@INPROCEEDINGS{Meyer90,
+AUTHOR={U. Meyer},
+TITLE={Hemi-Cube Ray Tracing: A Method for Generating Soft Shadows},
+BOOKTITLE={Eurographics '90},
+PAGES={365-376},
+}
+
+@ARTICLE{Williams78,
+AUTHOR={Lance Williams},
+TITLE={Casting Curved Shadows on Curved Surfaces},
+JOURNAL={Computer Graphics
+(SIGGRAPH '78 Proceedings)},
+VOLUME={12},
+NUMBER={3},
+MONTH={Aug.},
+YEAR={1978},
+PAGES={270-274},
+}
+
+@ARTICLE{Reeves87,
+AUTHOR={William T. Reeves and David H. Salesin and Robert L. Cook},
+TITLE={Rendering Antialiased Shadows with Depth Maps},
+JOURNAL={Computer Graphics
+(SIGGRAPH '87 Proceedings)},
+VOLUME={21},
+NUMBER={4},
+MONTH={July},
+YEAR={1987},
+PAGES={283-291},
+}
+
+@ARTICLE{Atherton78,
+AUTHOR={Peter R. Atherton and Kevin Weiler and Donald P. Greenberg},
+TITLE={Polygon Shadow Generation},
+JOURNAL={Computer Graphics
+(SIGGRAPH '78 Proceedings)},
+VOLUME={12},
+NUMBER={3},
+MONTH={Aug.},
+YEAR={1978},
+PAGES={275-281},
+KEYWORDS={hidden surface},
+}
+
+@ARTICLE{Heckbert86,
+AUTHOR={Paul S. Heckbert},
+TITLE={Survey of Texture Mapping},
+JOURNAL={IEEE Computer Graphics and Applications},
+VOLUME={6},
+NUMBER={11},
+MONTH={Nov.},
+YEAR={1986},
+PAGES={56-67},
+}
+
+@ARTICLE{Heckbert90,
+AUTHOR={Paul S. Heckbert},
+TITLE={Adaptive Radiosity Textures for Bidirectional Ray Tracing},
+JOURNAL={Computer Graphics
+(SIGGRAPH '90 Proceedings)},
+VOLUME={24},
+NUMBER={4},
+MONTH={Aug.},
+YEAR={1990},
+PAGES={145-154},
+KEYWORDS={global illumination},
+}
+
+@PHDTHESIS{Heckbert91,
+AUTHOR={Paul S. Heckbert},
+TITLE={Simulating Global Illumination Using Adaptive Meshing},
+SCHOOL={CS Division, UC Berkeley},
+MONTH={June},
+YEAR={1991},
+NOTE={Tech. Report UCB/CSD 91/636},
+KEYWORDS={radiosity, ray tracing, adaptive mesh, integral equation,
+thermal radiation, visibility},
+}
+
+@ARTICLE{Diefenbach94,
+AUTHOR={Paul J. Diefenbach and Norman I. Badler},
+TITLE={Pipeline Rendering: Interactive Refractions, Reflections, and Shadows},
+JOURNAL={Displays},
+ANNOTE={Special issue on Interactive Computer Graphics},
+NOTE={http://www.cis.upenn.edu/~diefenba/home.html},
+VOLUME={15},
+NUMBER={3},
+YEAR={1994},
+PAGES={173-180},
+KEYWORDS={beam tracing, hardware, real time},
+}
+
+@PHDTHESIS{Diefenbach96,
+AUTHOR={Paul J. Diefenbach},
+TITLE={Pipeline Rendering: Interaction and Realism through Hardware-Based
+Multi-Pass Rendering},
+SCHOOL={U. of Pennsylvania},
+YEAR=1996,
+KEYWORDS={beam tracing, hardware, real time, Phong illumination},
+NOTE={http://www.cis.upenn.edu/~diefenba/home.html},
+}
+
+@INPROCEEDINGS{Diefenbach97inter,
+AUTHOR={Paul J. Diefenbach and Norman I. Badler},
+title={Multi-pass Pipeline Rendering: Realism for Dynamic Environments},
+BOOKTITLE={1997 Symposium on Interactive 3D Graphics},
+publisher={ACM SIGGRAPH},
+YEAR=1997,
+KEYWORDS={texture mapping},
+NOTE={To appear},
+}
+
+@InProceedings{Cohen85,
+AUTHOR={Michael F. Cohen and Donald P. Greenberg},
+TITLE={The Hemi-Cube: A Radiosity Solution for Complex Environments},
+JOURNAL={Computer Graphics (SIGGRAPH '85 Proceedings)},
+MONTH={July},
+YEAR={1985},
+PAGES={31-40},
+KEYWORDS={shading, diffuse reflection},
+}
+
+@ARTICLE{Cohen88,
+AUTHOR={Michael F. Cohen and Shenchang Eric Chen and John R. Wallace and Donald P. Greenberg},
+TITLE={A Progressive Refinement Approach to Fast Radiosity Image Generation},
+JOURNAL={Computer Graphics
+(SIGGRAPH '88 Proceedings)},
+VOLUME={22},
+NUMBER={4},
+MONTH={Aug.},
+YEAR={1988},
+PAGES={75-84},
+ANNOTE={progressive radiosity},
+}
+
+@BOOK{Cohen93,
+AUTHOR={Michael F. Cohen and John R. Wallace},
+TITLE={Radiosity and Realistic Image Synthesis},
+PUBLISHER={Academic Press},
+ADDRESS={Boston},
+YEAR={1993},
+}
+
+@ARTICLE{Cook86,
+AUTHOR={Robert L. Cook},
+TITLE={Stochastic Sampling in Computer Graphics},
+JOURNAL={ACM Trans. on Graphics},
+VOLUME={5},
+NUMBER={1},
+MONTH={Jan.},
+YEAR={1986},
+PAGES={51-72},
+KEYWORDS={ray tracing, antialiasing, motion blur},
+ANNOTE={came out 1987},
+}
+
+@ARTICLE{Baum91,
+AUTHOR={Daniel R. Baum and Stephen Mann and Kevin P. Smith and James M. Winget},
+TITLE={Making Radiosity Usable: Automatic Preprocessing and Meshing Techniques
+for the Generation of Accurate Radiosity Solutions},
+MONTH={July},
+YEAR={1991},
+JOURNAL={Computer Graphics
+(SIGGRAPH '91 Proceedings)},
+VOLUME={25},
+NUMBER={4},
+PAGES={51-60},
+KEYWORDS={mesh generation},
+}
+
+@ARTICLE{Hanrahan91,
+AUTHOR={Pat Hanrahan and David Salzman and Larry Aupperle},
+TITLE={A Rapid Hierarchical Radiosity Algorithm},
+MONTH={July},
+YEAR={1991},
+JOURNAL={Computer Graphics
+(SIGGRAPH '91 Proceedings)},
+VOLUME={25},
+NUMBER={4},
+PAGES={197-206},
+ANNOTE={adaptive sampling of kernel in quadtree-like fashion
+motivated by Greengard's fast n-body algorithm},
+}
+
+@INPROCEEDINGS{Heckbert92discon,
+AUTHOR={Paul S. Heckbert},
+TITLE={Discontinuity Meshing for Radiosity},
+BOOKTITLE={Third Eurographics Workshop on Rendering},
+MONTH={May},
+YEAR={1992},
+ADDRESS={Bristol, UK},
+PAGES={203-216},
+KEYWORDS={radiosity, adaptive mesh, visibility},
+}
+
+@ARTICLE{Lischinski92,
+AUTHOR={Dani Lischinski and Filippo Tampieri and Donald P. Greenberg},
+TITLE={Discontinuity Meshing for Accurate Radiosity},
+JOURNAL={IEEE Computer Graphics and Applications},
+VOLUME={12},
+NUMBER={6},
+MONTH={November},
+YEAR={1992},
+PAGES={25-39},
+}
+
+@PHDTHESIS{Campbell91,
+	AUTHOR = {Campbell, III, A. T.},
+	TITLE = "Modeling Global Diffuse Illumination for Image Synthesis",
+	SCHOOL = "CS Dept, University of Texas at Austin",
+	YEAR = 1991,
+	MONTH = {Dec.},
+	NOTE = {Tech. Report TR-91-39},
+	keywords = {mesh generation, radiosity, penumbra, shadow},
+       pages =        "155",
+       keywords =     "Computational geometry data structure diffuse global
+                      illumination mesh generation optimization penumbra
+                      radiosity sampling shadow.",
+       abstract =     "Rapid developments in the design of algorithms for
+                      rendering globally illuminated scenes have taken place
+                      in the past five years. Net energy methods such as
+                      radiosity algorithms have become effective at
+                      computing the energy balance for scenes containing
+                      diffusely reflecting objects. Such methods first break
+                      up a scene description into a large set of elements, or
+                      possibly several levels of elements. Energy transfers
+                      among these elements are then determined using a
+                      variety of means. While much progress has been made in
+                      the design of energy transfer algorithms, little or no
+                      attention has been paid to the proper generation of the
+                      mesh of surface elements. This dissertation presents a
+                      technique for adaptively creating a mesh of surface
+                      elements as the energy transfers are computed. The
+                      method allows large numbers of small elements to be
+                      placed at parts of the scene where the most active
+                      energy transfers occur without requiring that other
+                      parts of the scene be subdivided needlessly to the same
+                      degree. As a result, the computational effort in the
+                      energy transfer computations can be concentrated where
+                      it has the most effect. Since the sources of direct and
+                      indirect illumination in the scene are polygonal
+                      elements, the effects of light sources with finite area
+                      must be computed. Most methods simplify the problem by
+                      approximating the area source with a collection of
+                      point sources. We present an object space algorithm to
+                      model illumination from polygonal light sources
+                      analytically. The result is a collection of
+                      smooth-shaded polygonal facets that may be rendered
+                      from any viewing position. Binary Space Partitioning
+                      trees are used to compute umbra and penumbra boundaries
+                      efficiently. Fast analytic techniques are developed
+                      for illumination calculations. Numerical optimization
+                      methods ensure that the shading function is sampled
+                      finely enough to find all significant illumination
+                      gradations. Illumination calculations are optimized to
+                      concentrate computational effort on parts of the scene
+                      where they are most needed.",
+       note =         "price (\$5.00)",
+     }
+
+
+
+@ARTICLE{Ward88,
+AUTHOR={Gregory J. Ward and Francis M. Rubinstein and Robert D. Clear},
+TITLE={A Ray Tracing Solution for Diffuse Interreflection},
+JOURNAL={Computer Graphics
+(SIGGRAPH '88 Proceedings)},
+VOLUME={22},
+NUMBER={4},
+MONTH={Aug.},
+YEAR={1988},
+PAGES={85-92},
+ANNOTE={cache diffuse samples},
+}
+
+@InProceedings{ward91a,
+       author =       "Gregory Ward",
+       title =        "Adaptive shadow testing for ray tracing",
+       booktitle =    "Eurographics Workshop on Rendering",
+       month = "May",
+       year =         "1991",
+       conference =   "Barcelona",
+       pages =        "11--20",
+       keywords =     "efficiency",
+       abstract =       "Method for reducing the number of shadow rays for
+                      scenes with a large number of light sources. The
+                      sources are sorted on their contribution, and only for
+                      the most important sources rays are cast. The influence
+                      of the other sources is estimated statistically. Tests
+                      are done with different tolerances (threshold to
+                      determine whether sources are important) and
+                      certainties (rate of accuracy). The method gives good
+                      reduction and is able to find the most important
+                      shadows because it selects contrast as criterion.",
+       annote =         "avoid shooting rays at lights determined to not affect
+                      perception of image",
+     }
+
+@TECHREPORT{Garland95tr,
+AUTHOR={Michael Garland and Paul S. Heckbert},
+TITLE={Fast Polygonal Approximation of Terrains and Height Fields},
+INSTITUTION={CS Dept., Carnegie Mellon U.},
+MONTH={Sept.},
+YEAR={1995},
+NOTE={CMU-CS-95-181, http://www.cs.cmu.edu/~garland/scape},
+KEYWORDS={surface simplification, Delaunay triangulation,
+data-dependent triangulation, triangulated irregular network, TIN,
+multiresolution modeling, greedy insertion},
+}
+
+@ARTICLE{Blinn88,
+AUTHOR={James F. Blinn},
+TITLE={Me and My (Fake) Shadow},
+JOURNAL={IEEE Computer Graphics and Applications},
+VOLUME={8},
+NUMBER={1},
+MONTH={Jan.},
+YEAR={1988},
+PAGES={82-86},
+KEYWORDS={projection, homogeneous matrix},
+}
+
+@ARTICLE{Heidmann91,
+AUTHOR={Tim Heidmann},
+TITLE={Real Shadows, Real Time},
+JOURNAL={Iris Universe},
+NOTE={Silicon Graphics, Inc.},
+VOLUME={18},
+YEAR={1991},
+PAGES={28-31},
+KEYWORDS={soft shadow, SGI Reality Engine, stencil buffer, shadow volume},
+ANNOTE={includes C, GL code},
+}
+
+@PHDTHESIS{Grant92,
+AUTHOR={Charles W. Grant},
+TITLE={Visibility Algorithms in Image Synthesis},
+SCHOOL={U. of California, Davis},
+YEAR={1992},
+KEYWORDS={z buffer, ray tracing, shadow, taxonomy},
+annote={partial electronic version available from grant1@llnl.gov,
+A successor to Sutherland-Sproull-Schumacker, Comput. Surv. 74},
+}
+
+@ARTICLE{Tessman89,
+AUTHOR={Thant Tessman},
+TITLE={Casting Shadows on Flat Surfaces},
+JOURNAL={Iris Universe},
+NOTE={Silicon Graphics, Inc.},
+MONTH={Winter},
+YEAR={1989},
+PAGES={16-19},
+KEYWORDS={projection, homogeneous matrix},
+ANNOTE={includes C, GL code},
+}
+
+@BOOK{Neider93,
+AUTHOR={Jackie Neider and Tom Davis and Mason Woo},
+TITLE={{OpenGL} Programming Guide},
+PUBLISHER={Addison-Wesley},
+ADDRESS={Reading MA},
+YEAR={1993},
+KEYWORDS={computer graphics, graphics workstation, SGI},
+ANNOTE={shadows on a plane p. 401},
+}
+
+@BOOK{McReynolds96,
+editor={Tom McReynolds},
+title={Programming with {OpenGL}: Advanced Rendering},
+note={SIGGRAPH '96 course notes},
+year=1996,
+keywords={Silicon Graphics, graphics workstation,
+texture mapping, stencil buffer, accumulation buffer, shadow},
+annote={article and code at
+http://www.sgi.com/Technology/openGL/advanced_sig96.html},
+}
+
+@INPROCEEDINGS{Akeley93,
+AUTHOR={Kurt Akeley},
+TITLE={{RealityEngine} Graphics},
+BOOKTITLE={SIGGRAPH '93 Proc.},
+MONTH={Aug.},
+YEAR={1993},
+PAGES={109-116},
+KEYWORDS={hardware, texture mapping, graphics workstation, SGI},
+}
+
+@ARTICLE{Clark76,
+AUTHOR={James H. Clark},
+TITLE={Hierarchical Geometric Models for Visible Surface Algorithms},
+JOURNAL={CACM},
+VOLUME={19},
+NUMBER={10},
+MONTH={Oct.},
+YEAR={1976},
+PAGES={547-554},
+KEYWORDS={bounding volume, spatial data structure},
+}
+
+@ARTICLE{Haeberli90accum,
+AUTHOR={Paul Haeberli and Kurt Akeley},
+TITLE={The Accumulation Buffer: Hardware Support for High-Quality Rendering},
+JOURNAL={Computer Graphics (SIGGRAPH '90 Proceedings)},
+VOLUME={24},
+NUMBER={4},
+MONTH={Aug.},
+YEAR={1990},
+PAGES={309-318},
+KEYWORDS={antialiasing, motion blur, depth of field,
+soft shadows, stochastic sampling},
+}
+
+@ARTICLE{Segal92,
+AUTHOR={Mark Segal and Carl Korobkin and Rolf van Widenfelt and Jim Foran
+and Paul Haeberli},
+TITLE={Fast Shadows and Lighting Effects using Texture Mapping},
+JOURNAL={Computer Graphics (SIGGRAPH '92 Proceedings)},
+VOLUME={26},
+NUMBER={2},
+MONTH={July},
+YEAR={1992},
+PAGES={249-252},
+KEYWORDS={perspective, scan conversion},
+}
+
+@ARTICLE{Chen90,
+   author = "Shenchang Eric Chen",
+   title = "Incremental Radiosity: An Extension of Progressive 
+          Radiosity to an Interactive Image Synthesis System",
+   pages = "135-144",
+   journal = "Computer Graphics (SIGGRAPH '90 Proceedings)",
+   volume = "24",
+   number = "4",
+   year = "1990",
+   month = "August",
+   keywords = "animation",
+}
+
+@InCollection{Chen91prograd,
+       author =       "Shenchang Eric Chen",
+       editor =       "James Arvo",
+       title =        "Implementing Progressive Radiosity with User-Provided
+                      Polygon Display Routines",
+       booktitle =    "Graphics Gems II",
+       pages =        "295-298, 583-597",
+       publisher =    "Academic Press Professional",
+       address =      "Boston, MA",
+       year =         "1991",
+       note =         "includes code",
+     }
+
+@Article{george90a,
+       author =       "David W. George and Francois X. Sillion and Donald P.
+                      Greenberg",
+       title =        "Radiosity Redistribution for Dynamic Environments",
+       journal =      "IEEE Computer Graphics and Applications",
+       pages =        "26--34",
+       volume =       "10",
+       number =       "4",
+       month =        jul,
+       year =         "1990",
+       keywords =     "radiosity, animation, interaction, shadow, negative
+                      radiosity",
+       annote =       "They present a modification to the progressive
+                      radiosity to allow faster radiosity computation for
+                      animation sequences where objects can be added, moved,
+                      removed or their surface changed properties. When an
+                      object is added, radiosity is shot onto these new
+                      patches. A shadow volume is determined and a negative
+                      radiosity is shot to the patches in shadow. When an
+                      object is moved, it is removed from the scene and added
+                      to the new position, the radiosity being recomputed at
+                      each step. The radiosity recomputed is based on two
+                      strategies: redistribute first or interleave
+                      redistribution and propagation. Some heuristics are
+                      presented to choose the most important patches. This
+                      solution is good when just a few objects are involved
+                      but as the complexity of the scenes and mostly moving
+                      objects increases, the algorithm lost of its
+                      interest.",
+     }
+
+@INCOLLECTION{Sillion91shadow,
+AUTHOR={Francois Sillion},
+TITLE={Detection of Shadow Boundaries for Adaptive Meshing in Radiosity},
+EDITOR={James Arvo},
+BOOKTITLE={Graphics Gems II},
+PAGES={311-315},
+PUBLISHER={Academic Press},
+ADDRESS={Boston MA},
+YEAR={1991},
+KEYWORDS={discontinuity meshing},
+}
+
+@Article{haines86a,
+       author =       "Eric A. Haines and Donald P. Greenberg",
+       title =        "The Light Buffer: {A} Ray Tracer Shadow Testing
+                      Accelerator",
+       pages =        "6--16",
+       journal =      "IEEE Computer Graphics and Applications",
+       volume =       "6",
+       number =       "9",
+       year =         "1986",
+       month =        sep,
+       keywords =     "shading, ray tracing, shadows, ray tracing shadow
+                      cull",
+       abstract =       "In one area of computer graphics, realistic image
+                      synthesis, the ultimate goal is to produce a picture
+                      indistinguishable from a photograph of a real
+                      environment. A particularly powerful technique for
+                      simulating light reflection---an important element in
+                      creating this realism---is called ray tracing. This
+                      method produces images of excellent quality, but
+                      suffers from lengthy computation time that limits its
+                      practical use. \\ This article presents a new method to
+                      reduce shadow testing time during ray tracing. The
+                      technique involves generating light buffers, each of
+                      which partition the environment with respect to an
+                      individual light source. These partition descriptions
+                      are then used during shadow testing to quickly
+                      determine a small subset of objects that may have to be
+                      tested for intersection. \\ The results of timing tests
+                      illustrate the beneficial performance of these
+                      techniques. The tests compare the standard ray-tracing
+                      algorithm to light buffers of varying resolution.",
+     }
+
+
+@InProceedings{bouville88a,
+       author =       "C. Bouville and J. L. Dubois and I. Marchal and M. L.
+                      Viaud",
+       title =        "Monte-Carlo integration applied to an illumination
+                      model",
+       pages =        "483--498",
+       booktitle =    "Eurographics '88",
+       year =         "1988",
+       month =        sep,
+       editor =       "D. A. Duce and P. Jancene",
+       publisher =    "North-Holland",
+       conference =   "European Computer Graphics Conference and Exhibition;
+                      held in Nice, France; 12 -- 16 September 1988",
+       keywords =     "illumination model",
+       abstract =       "The use of Monte-Carlo integration together with
+                      stochastic sampling is very useful for dealing with the
+                      scattering phenomena that occur in the propagation and
+                      reflection of light. In this paper, these techniques
+                      have been applied to the implementation of a
+                      physics-based global illumination model. The
+                      theoretical basis of this approach is presented briefly
+                      and various applications to realistic image are then
+                      described. This concerns the rendering of penumbra and
+                      scattered reflection effects, antialiasing and accurate
+                      color modelling through spectral integration. For all
+                      these applications, both theoretical and implementation
+                      aspects are developed and it is shown that stochastic
+                      techiques can provide very simple and efficient
+                      algorithms.",
+     }
+
+@InProceedings{Drettakis94,
+       author =       "George Drettakis and Eugene Fiume",
+       title =        "A Fast Shadow Algorithm for Area Light Sources Using
+                      Backprojection",
+       booktitle =    "SIGGRAPH '94 Proc.",
+       pages =        "223--230",
+       year =         "1994",
+       keywords =     "shadows, umbra, penumbra, discontinuity meshing,
+                      global illumination, backprojection",
+       note =
+"http://safran.imag.fr/Membres/George.Drettakis/pub.html",
+     }
+
+@InProceedings{Stewart94,
+       author =       "A. James Stewart and Sherif Ghali",
+       title =        "Fast Computation of Shadow Boundaries using Spatial
+                      Coherence and Backprojection",
+       booktitle =    "Proceedings of SIGGRAPH '94",
+       pages =        "231--238",
+       month =        jul,
+       year =         "1994",
+       keywords =     "shadows, backprojection, discontinuity mesh, aspect
+                      graphs, radiosity, visual events, efficient surface
+                      enumeration, spatial coherence",
+     }
+
+@InProceedings{Stewart93,
+       author =       "A. James Stewart and Sherif Ghali",
+       title =        "An Output Sensitive Algorithm for the Computation of
+                      Shadow Boundaries",
+       booktitle =    "Canadian Conference on Computational Geometry",
+       pages =        "291--296",
+       month =        aug,
+       year =         "1993",
+     }
+
+@InProceedings{haines91shaft,
+author =       "Eric Haines and John Wallace",
+title =        "Shaft culling for efficient ray-traced radiosity",
+booktitle =    "Eurographics Workshop on Rendering",
+month = "may",
+year =         "1991",
+conference =   "Barcelona",
+keywords =     "radiosity, ray tracing, bounding volumes",
+abstract =       "
+A shaft is a volume between an emitter and receiver. A
+list of enclosing boxes, c.q. patches that are in that
+volume is generated. The ray casting to determine
+visibility between emitter and receiver can be reduced
+by only testing the rays against the patches in the
+shaft. Methods to make the shafts, and to determine
+which object are in the shaft are given.
+",
+}
+
+@InProceedings{shirley91direct,
+       author =       "Peter Shirley and Changyaw Wang",
+       title =        "Direct lighting calculation by Monte Carlo
+                      integration",
+       booktitle =    "Eurographics Workshop on Rendering",
+       year =         "1991",
+       conference =   "held in Barcelona, Spain; 13-15 May 1991",
+       keywords =     "monte carlo, illumination",
+       abstract =       "Application of Monte Carlo techniques for rendering
+                      scenes with multiple light sources. Only one shadow ray
+                      per viewing ray is used. Some issues for the design of
+                      probability densities for light sources are given.",
+     }
+
+@InProceedings{kok91a,
+       author =       "Arjan Kok and Frederik Jansen",
+       title =        "Source selection for the direct lighting component in
+                      global illumination",
+       booktitle =    "Eurographics Workshop on Rendering",
+       year =         "1991",
+       conference =   "held in Barcelona, Spain; 13-15 May 1991",
+       keywords =     "two pass",
+       abstract =       "Describes criteria for deciding which patches should
+                      be considered to be light sources in a two pass method
+                      in which direct lighting component is calculated
+                      separately in the second pass.",
+     }
+
+@InCollection{Zimmerman95,
+       author =       "Kurt Zimmerman",
+       editor =       "Alan W. Paeth",
+       title =        "Direct Lighting Models for Ray Tracing with
+                      Cylindrical Lamps",
+       booktitle =    "Graphics Gems V",
+       pages =        "285--289",
+       publisher =    "Academic Press Professional",
+       address =      "Boston, MA",
+       year =         "1995",
+     }
+
+@INCOLLECTION{Zimmerman95twopass,
+AUTHOR={Kurt Zimmerman and Peter Shirley},
+TITLE={A Two-Pass Realistic Image Synthesis Method for Complex Scenes},
+BOOKTITLE={Rendering Techniques '95 (Proceedings of the Sixth Eurographics
+Workshop on Rendering)},
+PUBLISHER={Springer-Verlag},
+ADDRESS={NY},
+PAGES={284-295},
+YEAR=1995,
+NOTE={Also ftp://ftp.cs.indiana.edu/pub/techreports/TR434.ps.Z},
+KEYWORDS={shadow},
+}
+
+@InCollection{Wang92,
+       author =       "Changyaw Wang",
+       editor =       "David Kirk",
+       title =        "Physically Correct Direct Lighting for Distribution
+                      Ray Tracing",
+       booktitle =    "Graphics Gems III",
+       pages =        "307-313, 562-568",
+       publisher =    "Academic Press",
+       address =      "Boston, MA",
+       year =         "1992",
+       keywords =     "monte carlo, area light source, soft shadows",
+       annote =         "includes code",
+     }
+
+@InProceedings{rossignac89b,
+       author =       "J. Rossignac and J. Wu",
+       title =        "Depth-interval buffer for hardware-assisted shading
+                      from {CSG}: Accurate treatment of coincident faces and
+                      shadows",
+       booktitle =    "Fifth Eurographics Workshop on Graphics Hardware",
+       year =         "1989",
+       editor =       "D. Grimsdale and A. Kaufman",
+       conference =   "held in Lausanne, Switzerland; 2-3 September 1989",
+       keywords =     "hardware",
+       annote =       "Discuss the role of a depth interval buffer using a
+                      new version of the Trickle algorithm for handling
+                      coincident faces and shadows with CSG
+                      representations.",
+     }
+
+
+@article{Fuchs85sig,
+       author =       "Henry Fuchs and Jack Goldfeather and Jeff P. Hultquist
+and Susan Spach and John D. Austin and Brooks, Jr., Frederick P.
+and John G. Eyles and John Poulton",
+       title =        "Fast Spheres, Shadows, Textures, Transparencies, and
+                      Image Enhancements in {Pixel-Planes}",
+       pages =        "111--120",
+       journal =      "Computer Graphics (SIGGRAPH '85 Proceedings)",
+       volume =       "19",
+       number =       "3",
+       year =         "1985",
+       month =        jul,
+       keywords =     "pixel planes, parallel processing",
+       annote =       "Fuchs' Pixel-Planes machine is explained in general.
+                      See [Eyles 87] for a final report. Explanation of how
+                      the machine can process linear equations, and gives
+                      several algorithms for display. Also published in
+                      Advances in Computer Graphics I, EUROGRAPHICS 86.",
+     }
+
+@Article{eyles87a,
+       author =       "John Eyles and John Austin and Henry Fuchs and Trey
+                      Greer and John Poulton",
+       title =        "{Pixel-Planes} 4: {A} Summary",
+       pages =        "183--207",
+       journal =      "Advances in Computer Graphics Hardware II, Record of
+                      Second Eurographics Workshop on Graphics Hardware",
+       year =         "1987",
+       keywords =     "parallel processing",
+       annote =       "A final report on the Pixel-Planes system. See also
+                      [Fuchs 85].",
+     }
+
+@InProceedings{amanatides84a,
+       author =       "John Amanatides",
+       title =        "Ray Tracing with Cones",
+       pages =        "129--135",
+       journal =      "Computer Graphics (SIGGRAPH '84 Proceedings)",
+       volume =       "18",
+       number =       "3",
+       year =         "1984",
+       month =        jul,
+       conference =   "held in Minneapolis, Minnesota; 23--27 July 1984",
+       keywords =     "cone tracing, antialiasing, I35 Ray Tracing",
+       annote =       "ray tracing spheres and polygons with circular conical
+                      rays A technique for antialiasing in ray tracing is
+                      presented which utilizes cones instead of rays. Cones
+                      prevent problems generally associated with point
+                      sampling, and therefore allow for more natural images.
+                      The mathematics involved seem only ``pretty'' for
+                      spherical objects, so an acid test has yet to be
+                      performed. \\ A new approach to ray tracing is
+                      introduced. The definition of a ``ray'' is extended
+                      into a cone by including information on the spread
+                      angle and the virtual origin. The advantages of this
+                      approach, which tries to model light propagation with
+                      more fidelity, include a better method of antialiasing,
+                      a way of calculating fuzzy shadows and dull
+                      reflections, a method of calculating the correct level
+                      of detail in a procedural model and texture map, and
+                      finally, a procedure for faster intersection
+                      calculation.",
+     }
+
+@InProceedings{salesin89a,
+       author =       "David Salesin and Jorge Stolfi",
+       title =        "The {ZZ}-Buffer: a Simple and Efficient Rendering
+                      Algorithm with Reliable Antialiasing",
+       pages =        "451--466",
+       journal =      "Proceedings of the PIXIM '89",
+       year =         "1989",
+       annote =       "The ZZ-buffer is a new rendering algorithm that is
+                      simple, efficient, and produces high-quality images.
+                      The algorithm correctly renders transparent surfaces,
+                      shadows with real penumbrae, and depth of field
+                      effects. The ZZ-buffer algorithm is substantially
+                      faster than ray tracing an nearly as versatile. While
+                      the ZZ-buffer is somewhat slower than the Z-buffer or
+                      A-buffer, it avoids the aliasing and other artifacts of
+                      these algorithms. The algorithm's efficiency comes from
+                      a screen-space object indexing scheme, and from the use
+                      of lazy evaluation for visibility tests. It achieves
+                      reliable antialiasing by employing an adaptive form of
+                      stochastic supersampling. The algorithm is simple
+                      enough that we give most of its code here in this
+                      paper. The algorithm has been implemented as part of a
+                      commercial production system and has proved robust over
+                      a large variety of images.",
+     }
+
+@InProceedings{Muller:1994:FRR,
+       author =       "Stefan Muller and Frank Schoffel",
+       booktitle =    "Fifth Eurographics Workshop on Rendering",
+       title =        "Fast Radiosity Repropagation for Interactive Virtual
+                      Environments Using a Shadow-Form-Factor-List",
+       address =      "Darmstadt, Germany",
+       pages =        "325--342",
+       month =        jun,
+       year =         "1994",
+       keywords =     "dynamic environments, shadow-form-factor-list, scene
+                      coherence, radiosity repropagation, progressive
+                      refinement radiosity",
+       bibsource =    "sig-11-1994",
+     }
+
+
+@TechReport{Seales89,
+       author =       "W. Brent Seales and Charles R. Dyer",
+       title =        "Using the {ASP} for the Interactive Viewing of
+                      Polyhedral Scenes",
+       institution =  "University of Wisconsin",
+       number =       "TR 903",
+       month =        dec,
+       year =         "1989",
+       abstract =     "In this paper we discuss an approach for solving the
+                      problem of interactively viewing a polyhedral scene.
+                      Interactive viewing is the computation and display of
+                      an interactively controlled sequence of views of a
+                      scene corresponding to a viewer's movement along a
+                      continuous viewpath. We present an algorithm for
+                      generating such views with hidden-lines removed, and
+                      consider extensions to solve the problem of generating
+                      views with hidden-surfaces removed. The method relies
+                      on a precomputation phase which constructs the {\it
+                      aspect representation}, or asp. This representation can
+                      be used to interactively view a polyhedral scene at
+                      video rates with hidden-lines or surfaces removed. The
+                      method exploits {\it viewpath coherence}, a form of
+                      frame-to-frame coherence present in such a sequence of
+                      views. The display of polyhedral line drawings with
+                      hidden lines removed makes use of the topology of the
+                      image line drawing and the pre-ordering of visual
+                      events which change that topology. This approach is
+                      extended to interactive viewing with hidden-surfaces
+                      removed and with shading, shadows, and multiple light
+                      sources. The set of object resolution polygons
+                      representing the visible faces and the shadow polygons
+                      for a single frame can be computed efficiently from the
+                      previous frame using the asp. The hidden-line and
+                      hidden-surface algorithms are closely related via the
+                      asp. Interactive viewing with hidden-lines removed is
+                      shown to be about as fast as the interactive display of
+                      a wire-frame scene. The primary on-line cost of
+                      hidden-surface interactive viewing is the cost
+                      associated with scan converting the visible surfaces
+                      and shadow polygons.",
+     }
+
+@InProceedings{seales90a,
+       author =       "W. Brent Seales and Charles R. Dyer",
+       title =        "Shaded Rendering and Shadow Computation for Polyhedral
+                      Animation",
+       pages =        "175--182",
+       journal =      "Proceedings of Graphics Interface '90",
+       year =         "1990",
+       month =        may,
+       conference =   "held in Halifax, Nova Scotia; 14-18 May 1990",
+       keywords =     "animation, aspect representation, hidden-surface
+                      computation, interactive viewing, viewpath coherence",
+     }
+
+@InProceedings{wanger92a,
+       author =       "Leonard Wanger",
+       title =        "The effect of shadow quality on the perception of
+                      spatial relationships in computer generated imagery",
+       pages =        "39--42",
+       journal =      "Computer Graphics (1992 Symposium on Interactive 3D
+                      Graphics)",
+       volume =       "25",
+       number =       "2",
+       year =         "1992",
+       month =        mar,
+       editor =       "David Zeltzer",
+       conference =   "held in Boston; 29 March - 1 April 1992",
+       keywords =     "interactive tasks, spatial relations, cue theory",
+     }
+
+@TechReport{QMW-DCS-521-1990a,
+       author =       "M. Slater",
+       title =        "Dynamic Modification Of Objects In 3{D} Scenes Using
+                      Tiling And {A} {Z} -Buffer",
+       institution =  "Queen Mary College, Department of Computer Science",
+       year =         "1990",
+       month =        nov,
+       number =       "QMW-DCS-1990-521",
+       scope =        "ace",
+       abstract-url = "http://www.dcs.qmw.ac.uk/publications/report_abstracts/1990/521",
+       keywords =     "Interactive 3D Graphics, Z-Buffer, Tiling, Shadows,
+                      Graphica Objects, Segments.",
+     }
+
+     @InProceedings{Chrysantho1995a,
+	 author =       "Yiorgos Chrysanthou and Mel Slater",
+
+       booktitle =    "ACM SIGGRAPH Symposium on Interactive 3D Graphics,
+                      Monterey, CA",
+       title =        "Shadow Volume {BSP} Trees for Computation of Shadows
+                      in Dynamic Scenes",
+       year =         "1995",
+       month =        apr,
+	 pages =        "45--50",
+
+     }
+
+@Incollection{arvo89survey,
+       author =       "James Arvo and David Kirk",
+       title =        "A survey of ray tracing acceleration techniques",
+       pages =        "201--262",
+       booktitle =    "An introduction to ray tracing",
+       year =         "1989",
+       editor =       "Andrew S. Glassner",
+       publisher =    "Academic Press",
+     }
+
+@InProceedings{Arvo95irrad,
+  author =       "James Arvo",
+  title =        "Applications of Irradiance Tensors to the Simulation
+                 of Non-Lambertian Phenomena",
+  pages =        "335--342",
+  booktitle =    "SIGGRAPH 95 Proceedings",
+  year =         "1995",
+  month =        aug,
+  keywords={shadow, shading},
+}
+
+@Article{Hourcade85,
+       author =       "J. C. Hourcade and A. Nicolas",
+       title =        "Algorithms for Antialiased Cast Shadows",
+       pages =        "259--265",
+       journal =      "Computers and Graphics",
+       volume =       "9",
+       number =       "3",
+       year =         "1985",
+       keywords =     "z-buffer shadow",
+     }
+
+@InProceedings{Tanaka90,
+       author =       "Toshimitsu Tanaka and Tokiichiro Takahashi",
+       title =        "Cross Scanline Algorithm",
+       pages =        "63--74",
+       booktitle =    "Eurographics '90",
+       year =         "1990",
+       month =        sep,
+       publisher =    "North-Holland",
+     }
+
+@inproceedings{Tanaka91,
+       author =       "Toshimitsu Tanaka and Tokiichiro Takahashi",
+       title =        "Shading with Area Light Sources",
+       booktitle =    "Eurographics '91",
+       publisher =    "North-Holland",
+       pages =        "235--246, 535--537",
+       month =        sep,
+       year =         "1991",
+       annote = "no shadows",
+     }
+
+@ARTICLE{Tanaka94,
+       author =       "Toshimitsu Tanaka and Tokiichiro Takahashi",
+       journal =      "Computer Graphics Forum",
+       title =        "Cross Scan Buffer and its Applications",
+       volume =       "13",
+       number =       "3",
+       publisher =    "Basil Blackwell Ltd",
+       pages =        "467--376",
+       year =         "1994",
+       note =         "Eurographics '94 Conference issue",
+     }
+
+@ARTICLE{Tanaka95,
+       title =        "Fast Shadowing Algorithm for Linear Light Sources",
+       author =       "Toshimitsu Tanaka and Tokiichiro Takahashi",
+       journal =      "Computer Graphics Forum",
+       volume =       "14",
+       number =       "3",
+       pages =        "205--216",
+       year =         "1995",
+       note =         "Eurographics '95 Conference issue",
+     }
+
+@ARTICLE{Tanaka96,
+title={Fast Analytic Shading and Shadowing for Area Light Sources},
+author={Toshimitsu Tanaka and Tokiichiro Takahashi},
+note={Submitted for publication},
+year=1996,
+annote={diffuse and specular surfaces},
+}
+
+@ARTICLE{Max95,
+AUTHOR={Nelson Max},
+TITLE={Optimal Sampling for Hemicubes},
+JOURNAL={IEEE Trans. on Visualization and Computer Graphics},
+VOLUME={1},
+NUMBER={1},
+YEAR={1995},
+KEYWORDS={hemicube, radiosity, form factor, sampling, variance, optimization},
+ABSTRACT={
+The hemicube estimates of form factors are based on a finite set of
+sample directions. We obtain several optimal arrangements of sample
+directions, which minimize the variance of these estimates. They are
+based on changing the size or shape of the pixels or the shape of the
+hemicube, or using non-uniform pixel grids. The best reduces the
+variance by 43%.
+
+The variance calculation is based on the assumption that the errors in
+the estimate are caused by the projections of single polygon edges, and
+that the positions and orientations of these edges are random. This
+replaces the infinite dimensional space of possible environments by the
+two dimensional space of great circles on the unit sphere, making the
+numerical variance minimization possible.
+},
+}
+
+@InProceedings{Myszkowski94,
+       title =        "Texture Mapping as an Alternative for Meshing During
+                      Walkthrough Animation",
+       author =       "Karol Myszkowski and Tosiyasu L. Kunii",
+       booktitle =    "Fifth Eurographics Workshop on Rendering",
+       pages =        "375--388",
+       month =        jun,
+       year =         "1994",
+       keywords =     "texture mapping, Gouraud shading, meshing, radiosity",
+}
+
+@INPROCEEDINGS{Ayatsuka96,
+TITLE={Penumbrae for 3D Interactions},
+AUTHOR={Yuji Ayatsuka and Satoshi Matsuoka and Jun Rekimoto},
+BOOKTITLE={9th Annl. Symp. for User Interface Software and Technology (UIST96)},
+MONTH={Nov.},
+YEAR=1996,
+PAGES={165-166},
+ABSTRACT={
+We propose a new feedback technique for 3D interaction in augmented
+reality using penumbrae which the objects cast. Rather than generating
+a real penumbra, which is computationally expensive, a fast, simplified
+algorithm is employed, which also is better suited for position
+feedback purposes. User studies show that 1) compared to orthographic
+shadow projections, 3D spatial recognition and placement tasks are
+substantially faster with our penumbrae, and 2) the users feel the
+feedback to be more natural, which is especially important in augmented
+reality.
+from http://www-masuda.is.s.u-tokyo.ac.jp/~aya/works/penumbra.html
+},
+}
+
+@TECHREPORT{Goslin95,
+author={Michael Goslin},
+title={Illumination as Texture Maps for Faster Rendering},
+SCHOOL={Dept. of CS, U. of North Carolina, Chapel Hill},
+year=1995,
+note={TR 95-042},
+keywords={texture mapping, radiosity, walkthrough, graphics workstation},
+note={ftp://ftp.cs.unc.edu/pub/publications/techreports/95.html},
+}
+
+@TECHREPORT{Bastos96,
+AUTHOR={Rui Bastos and Michael Goslin and Hansong Zhang},
+TITLE={Efficient Rendering of Radiosity Using Textures and Bicubic
+Reconstruction},
+NOTE={TR 96-025},
+INSTITUTION={Dept. of CS, U. of North Carolina at Chapel Hill},
+YEAR=1996,
+KEYWORDS={texture mapping},
+NOTE={http://www.cs.unc.edu/~bastos/radiosity.html},
+annote={also available at
+ftp://ftp.cs.unc.edu/pub/publications/techreports/96.html},
+}
+
+@INPROCEEDINGS{Bastos97,
+AUTHOR={Rui Bastos and Michael Goslin and Hansong Zhang},
+TITLE={Efficient Radiosity Rendering using Textures and Bicubic Reconstruction},
+BOOKTITLE={1997 Symposium on Interactive 3D Graphics},
+publisher={ACM SIGGRAPH},
+YEAR=1997,
+KEYWORDS={texture mapping},
+NOTE={To appear.
+http://www.cs.unc.edu/~bastos/radiosity.html},
+}
+
+@Article{Appel67qi,
+author =       "Arthur Appel",
+title =        "The Notion of Quantitative Invisibility and the
+Machine Rendering of Solids",
+year =         "1967",
+journal =      "Proc. ACM Natl. Mtg.",
+pages =        "387-393",
+keywords =     "hidden line",
+}
+
+@ARTICLE{Ackland81edge,
+  author =       "Bryan D. Ackland and Neil H. Weste",
+  title =        "The edge flag algorithm - a fill method for raster
+                 scan displays",
+  journal =      "IEEE Trans. on Comp.",
+  volume =       "C-30",
+  year =         "1981",
+  pages =        "41--47",
+  descriptors =  "Method; display; realization; two-dimensional plot;
+                 three-dimensional plot; graphics; frame store; polygon
+                 fill; raster scan; computer animation;",
+  annote =       "Contour (polygon) filling is a primitive required in
+                 many application areas of raster scan graphics. The
+                 bit-map memory in a frame-store display is
+                 computationally well suited to this task, as it
+                 provides a large scratch pad working space. In this
+                 paper, a number of contour filling algorithms based on
+                 the read/write properties of the frame-store memory are
+                 compared with the classical {"}ordered-edge-list{"}
+                 approach.",
+}
+
+@INPROCEEDINGS{Hardt96,
+author={Stephen Hardt and Seth Teller},
+title={High-Fidelity Radiosity Rendering at Interactive Rates},
+booktitle={Rendering Techniques '96},
+publisher={Springer-Verlag},
+year=1996,
+note={(Proc. Eurographics Workshop on Rendering)},
+pages={71-80,283},
+keywords={real time},
+}
+
+@TECHREPORT{Moller95ms,
+author={Tomas M\"oller},
+title={Virtual Radiosity},
+month={Sept.},
+year=1995,
+institution={Dept. of Computer Engineering, Lund Inst. of Tech., Sweden},
+keywords={texture mapping, graphics workstation, level of detail,
+virtual reality},
+note={Master's thesis, http://www.clarus.se/People/tompa/reports.html},
+annote={radiosity algorithm for graphics workstations that uses
+hardware texture mapping and multiple LODs},
+}
+
+@TECHREPORT{Moller96lic,
+author={Tomas M\"oller},
+title={Speed-Up Techniques for Computer Graphics},
+month={Dec.},
+year=1996,
+institution={Dept. of Computer Engineering, Chalmers U. of Tech., Sweden},
+note={Technical Report No. 250L, Licenciate thesis,
+http://www.clarus.se/People/tompa/reports.html},
+annote={66 pp.,
+contains four papers:
+(1) image resampling (Fast Bitmap Stretching, Gems III),
+(2) ray-surface intersection optimization (Faster Ray Tracing Using Scanline
+    Rejection, Gems V),
+(3) texturing for radiosity in VR (Radiosity Techniques for Virtual Reality,
+    Plzen, Czech, 1996),
+(4) faster soft shadows (Speed-Up Techniques for Soft Shadow Generation,
+    submitted 1996).
+},
+}
+
Index: trunk/VUT/doc/SciReport/Bib/visibility.bib
===================================================================
--- trunk/VUT/doc/SciReport/Bib/visibility.bib	(revision 243)
+++ trunk/VUT/doc/SciReport/Bib/visibility.bib	(revision 243)
@@ -0,0 +1,2 @@
+
+
Index: trunk/VUT/doc/SciReport/Bib/new.bib
===================================================================
--- trunk/VUT/doc/SciReport/Bib/new.bib	(revision 243)
+++ trunk/VUT/doc/SciReport/Bib/new.bib	(revision 243)
@@ -0,0 +1,2089 @@
+@TechReport{Hillesland02,
+  author =       "Karl Hillesland and Brian Salomon and Anselmo Lastra
+                 and Dinesh Manocha",
+  title =        "Fast and Simple Occlusion Culling Using Hardware-Based
+                 Depth Queries",
+  institution =  "Department of Computer Science, University of North
+                 Carolina - Chapel Hill",
+  number =       "TR02-039",
+  month =        sep # " 12",
+  year =         "2002",
+  URL =          "ftp://ftp.cs.unc.edu/pub/publications/techreports/02-039.pdf",
+}
+
+@Article{Staneker:2004:OCO,
+  author =       "Dirk Staneker and Dirk Bartz and Wolfgang
+                 Stra{\ss}er",
+  title =        "Occlusion Culling in {OpenSG PLUS}",
+  journal =      "Computers and Graphics",
+  volume =       "28",
+  number =       "1",
+  pages =        "87--92",
+  month =        feb,
+  year =         "2004",
+  CODEN =        "COGRD2",
+  ISSN =         "0097-8493",
+  bibdate =      "Tue Jan 27 12:04:28 MST 2004",
+  acknowledgement = ack-nhfb,
+}
+
+
+@InProceedings{Meissner01,
+  author =       "Michael Meissner and Dirk Bartz and Gordon Mueller and
+                 Tobias Huettner and Jens Einighammer",
+  title =        "Generation of Decomposition Hierarchies for Efficient
+                 Occlusion Culling of Large Polygonal Models",
+  pages =        "225--232",
+  booktitle =    "Proceedings of the Vision Modeling and Visualization
+                 Conference 2001",
+  month =        nov # " ~21--23",
+  year =         "2001",
+}
+
+
+@Article{Scott:1998:OVF,
+  author =       "N. D. Scott and D. M. Olsen and E. W. Gannett",
+  title =        "An Overview of the {VISUALIZE fx} Graphics Accelerator
+                 Hardware",
+  journal =      "Hew\-lett-Pack\-ard Journal: technical information
+                 from the laboratories of Hew\-lett-Pack\-ard Company",
+  volume =       "49",
+  number =       "2",
+  pages =        "28--34",
+  month =        may,
+  year =         "1998",
+  CODEN =        "HPJOAX",
+  ISSN =         "0018-1153",
+  bibdate =      "Thu Nov 5 16:08:50 MST 1998",
+  URL =          "http://www.hp.com/hpj/98may/tc-05-98.htm",
+  acknowledgement = ack-nhfb,
+}
+
+@Article{Leyvand:2003:RSF,
+  author =       "Tommer Leyvand and Olga Sorkine and Daniel Cohen-Or",
+  title =        "Ray space factorization for from-region visibility",
+  journal =      "ACM Transactions on Graphics (Proceedings of SIGGRAPH '03)",
+  volume =       "22",
+  number =       "3",
+  pages =        "595--604",
+  month =        jul,
+  year =         "2003",
+}
+
+@InProceedings{Chrysanthou:97,
+  author =       "M. Slater and Y. Chrysanthou",
+  title =        "View Volume Culling Using a Probabilistic Caching
+                 Scheme",
+  pages =        "71--78",
+  booktitle =    "Proceedings of the {ACM} Symposium on Virtual Reality
+                 Software and Technology ({VRST}'97)",
+  optmonth =        sep # "15--17~",
+  publisher =    "ACM Press",
+  optaddress =      "New York",
+  year =         "1997",
+}
+
+@InProceedings{stamminger02,
+  pages =        "557--562",
+  year =         "2002",
+  title =        "Perspective Shadow Maps",
+  author =       "Marc Stamminger and George Drettakis",
+  abstract =     "Shadow maps are probably the most widely used means
+                 for the generation of shadows, despite their well known
+                 aliasing problems. In this paper we introduce
+                 perspective shadow maps, which are generated in
+                 normalized device coordinate space, i.e., after
+                 perspective transformation. This results in important
+                 reduction of shadow map aliasing with almost no
+                 overhead. We correctly treat light source
+                 transformations and show how to include all objects
+                 which cast shadows in the transformed space.
+                 Perspective shadow maps can directly replace standard
+                 shadow maps for interactive hardware accelerated
+                 rendering as well as in high-quality, offline
+                 renderers.",
+  keywords =     "Frame Buffer Algorithms, Graphics Hardware,
+                 Illumination, Level of Detail Algorithms, Rendering,
+                 Shadow Algorithms",
+  booktitle =    "SIGGRAPH 2002 Conference Proceedings",
+  publisher =    "ACM Press/ ACM SIGGRAPH",
+}
+
+
+@Article{vazquez99,
+  author =       "C. Saona-V{\'a}zquez and I. Navazo and P. Brunet",
+  title =        "The visibility octree: a data structure for {$3$D}
+                 navigation",
+  journal =      "Computers and Graphics",
+  volume =       "23",
+  number =       "5",
+  pages =        "635--643",
+  month =        oct,
+  year =         "1999",
+  coden =        "COGRD2",
+  ISSN =         "0097-8493",
+  bibdate =      "Sat Oct 21 14:27:20 MDT 2000",
+  url =          "http://www.elsevier.nl/gej-ng/10/13/20/24/34/28/abstract.html;
+                 http://www.elsevier.nl/gej-ng/10/13/20/24/32/28/article.pdf",
+  acknowledgement = ack-nhfb,
+}
+
+@inproceedings{lloyd02,
+ author = {Brandon Lloyd and Parris Egbert},
+ title = {Horizon occlusion culling for real-time rendering of hierarchical terrains},
+ booktitle = {Proceedings of the conference on Visualization '02},
+ year = {2002},
+ isbn = {0-7803-7498-3},
+ pages = {403--410},
+ location = {Boston, Massachusetts},
+ publisher = {IEEE Press},
+ }
+
+
+@InCollection{wald01_eg,
+  pages =        "153--164",
+  year =         "2001",
+  title =        "Interactive Rendering with Coherent Ray Tracing",
+  url =          "http://visinfo.zib.de/EVlib/Show?EVL-2001-174",
+  author =       "Ingo Wald and Philipp Slusallek and Carsten Benthin
+                 and Markus Wagner",
+  abstract =     "For almost two decades researchers have argued that
+                 ray tracing will eventually become faster than the
+                 rasterization technique that completely dominates
+                 todays graphics hardware. However, this has not
+                 happened yet. Ray tracing is still exclusively being
+                 used for off-line rendering of photorealistic images
+                 and it is commonly believed that ray tracing is simply
+                 too costly to ever challenge rasterization-based
+                 algorithms for interactive use. However, there is
+                 hardly any scientific analysis that supports either
+                 point of view. In particular there is no evidence of
+                 where the crossover point might be, at which ray
+                 tracing would eventually become faster, or if such a
+                 point does exist at all. This paper provides several
+                 contributions to this discussion: We first present a
+                 highly optimized implementation of a ray tracer that
+                 improves performance by more than an order of magnitude
+                 compared to currently available ray tracers. The new
+                 algorithm make better use of computational resources
+                 such as caches and SIMD instructions and better
+                 exploits image and object space coherence. Secondly, we
+                 show that this software implementation can challenge
+                 and even outperform high-end graphics hardware in
+                 interactive rendering performance for complex
+                 environments. We also provide an brief overview of the
+                 benefits of ray tracing over rasterization algorithms
+                 and point out the potential of interactive ray tracing
+                 both in hardware and software.",
+  editor =       "A. Chalmers and T.-M. Rhyne",
+  volume =       "20(3)",
+  series =       "Computer Graphics Forum",
+  booktitle =    "EG 2001 Proceedings",
+  publisher =    "Blackwell Publishing",
+}
+
+
+@InProceedings{purcell02,
+  pages =        "703--712",
+  year =         "2002",
+  title =        "Ray Tracing on Programmable Graphics Hardware",
+  url =          "http://visinfo.zib.de/EVlib/Show?EVL-2002-222",
+  author =       "Timothy J. Purcell and Ian Buck and William R. Mark
+                 and Pat Hanrahan",
+  abstract =     "Recently a breakthrough has occurred in graphics
+                 hardware: fixed function pipelines have been replaced
+                 with programmable vertex and fragment processors. In
+                 the near future, the graphics pipeline is likely to
+                 evolve into a general programmable stream processor
+                 capable of more than simply feed-forward triangle
+                 rendering. In this paper, we evaluate these trends in
+                 programmability of the graphics pipeline and explain
+                 how ray tracing can be mapped to graphics hardware.
+                 Using our simulator, we analyze the performance of a
+                 ray casting implementation on next generation
+                 programmable graphics hardware. In addition, we compare
+                 the performance difference between non-branching
+                 programmable hardware using a multipass implementation
+                 and an architecture that supports branching. We also
+                 show how this approach is applicable to other ray
+                 tracing algorithms such as Whitted ray tracing, path
+                 tracing, and hybrid rendering algorithms. Finally, we
+                 demonstrate that ray tracing on graphics hardware could
+                 prove to be faster than CPU based implementations as
+                 well as competitive with traditional hardware
+                 accelerated feed-forward triangle rendering.",
+  keywords =     "Programmable Graphics Hardware, Ray Tracing",
+  booktitle =    "Computer Graphics (SIGGRAPH '02 Proceedings)",
+}
+
+
+@InProceedings{Gortler:1996:L,
+  author =       "Steven J. Gortler and Radek Grzeszczuk and Richard
+                 Szeliski and Michael F. Cohen",
+  title =        "The Lumigraph",
+  series =       "Annual Conference Series",
+  pages =        "43--54",
+  booktitle =    "Computer Graphics (SIGGRAPH '96 Proceedings)",
+  year =         "1996",
+  publisher =    "Addison Wesley",
+  month =        aug,
+  annote =       "This paper discusses a new method for capturing the
+                 complete appearance of both synthetic and real world
+                 objects and scenes, representing this information, and
+                 then using this representation to render images of the
+                 object from new camera positions. Unlike the shape
+                 capture process traditionally used in computer vision
+                 and the rendering process traditionally used in
+                 computer graphics, our approach does not rely on
+                 geometric representations. Instead we sample and
+                 reconstruct a 4D function, which we call a Lumigraph.
+                 The Lumigraph is a subset of the complete plenoptic
+                 function that describes the flow of light at all
+                 positions in all directions. With the Lumigraph, new
+                 images of the object can be generated very quickly,
+                 independent of the geometric or illumination complexity
+                 of the scene or object. The paper discusses a complete
+                 working system including the capture of samples, the
+                 construction of the Lumigraph, and the subsequent
+                 rendering of images from this new representation.",
+}
+
+
+@Article{Gotsman:1999:OOC,
+  author =       "Craig Gotsman and Oded Sudarsky and Jeffrey A.
+                 Fayman",
+  title =        "Optimized occlusion culling using five-dimensional
+                 subdivision",
+  journal =      "Computers and Graphics",
+  volume =       "23",
+  number =       "5",
+  pages =        "645--654",
+  month =        oct,
+  year =         "1999",
+  coden =        "COGRD2",
+  ISSN =         "0097-8493",
+  bibdate =      "Sat Oct 21 14:27:20 MDT 2000",
+  url =          "http://www.elsevier.nl/gej-ng/10/13/20/24/34/29/abstract.html;
+                 http://www.elsevier.nl/gej-ng/10/13/20/24/32/29/article.pdf",
+  acknowledgement = ack-nhfb,
+}
+
+@article{Pag94,
+ author = {David W. Paglieroni and Sidney M. Petersen},
+ title = {Height distributional distance transform methods for height field ray tracing},
+ journal = {ACM Transactions on Graphics (TOG)},
+ volume = {13},
+ number = {4},
+ year = {1994},
+ issn = {0730-0301},
+ pages = {376--399},
+ doi = {http://doi.acm.org/10.1145/195826.197312},
+ publisher = {ACM Press},
+ }
+
+@article{lee97,
+    author = "Cheol-Hi Lee and Yeong Gil Shin",
+    title = "A Terrain Rendering Method using Vertical Ray Coherence",
+    journal = "The Journal of Visualization and Computer Animation",
+    volume = "8",
+    number = "2",
+    pages = "97--114",
+    year = "1997",
+}
+
+
+@TechReport{mcmillan:97:phd,
+  type =         "Ph.D. Thesis",
+  number =       "TR97-013",
+  institution =  "University of North Carolina, Chapel Hill",
+  title =        "An Image-Based Approach to Three-Dimensional Computer
+                 Graphics",
+  month =        may,
+  year =         "1997",
+  bibdate =      "June 9, 1997",
+  url =          "ftp://ftp.cs.unc.edu/pub/publications/techreports/97-013.pdf.Z",
+  author =       "Leonard McMillan",
+}
+
+
+@MastersThesis{aila:00:msc,
+  author = 	 {Timo Aila},
+  title = 	 {SurRender Umbra: A Visibility Determination Framework
+for Dynamic Environments},
+  school = 	 {Helsinki University of Technology},
+  year = 	 {2000},
+}
+
+
+@Article{duguet:02:sig,
+  year =         "2002",
+  title =        "Robust Epsilon Visibility",
+  author =       "Florent Duguet and George Drettakis",
+  journal =    "To appear in Computer Graphics (SIGGRAPH'02 Proceedings)",
+  publisher =    "ACM SIGGRAPH",
+}
+
+
+@InProceedings{wand:01:sig,
+  pages =        "361--370",
+  year =         "2001",
+  title =        "The Randomized z-Buffer Algorithm: Interactive
+                 Rendering of Highly Complex Scenes",
+  url =          "http://visinfo.zib.de/EVlib/Show?EVL-2001-125",
+  author =       "Michael Wand and Matthias Fischer and Ingmar Peter and
+                 Friedhelm Meyer auf der Heide and Wolfgang
+                 Stra{\ss{}}er",
+  abstract =     "We present a new output-sensitive rendering algorithm,
+                 the randomized z-buffer algorithm. It renders an image
+                 of an arbitrary three-dimensional scene consisting of
+                 triangular primitives by reconstruction from a
+                 dynamically chosen set of random surface sample points.
+                 This approach is independent of mesh connectivity and
+                 topology. The resulting rendering time grows only
+                 logarithmically with the numbers of triangles in the
+                 scene. We were able to render walkthroughs of scenes of
+                 up to 1014 triangles at interactive frame rates.
+                 Automatic identification of low detail scene components
+                 ensures that the rendering speed of the randomized
+                 z-buffer cannot drop below that of conventional
+                 z-buffer rendering. Experimental and analytical
+                 evidence is given that the image quality is comparable
+                 to that of common approaches like z-buffer rendering.
+                 The precomputed data structures employed by the
+                 randomized z-buffer allow for interactive dynamic
+                 updates of the scene. Their memory requirements grow
+                 only linearly with the number of triangles and allow
+                 for a scene graph based instantiation scheme to further
+                 reduce memory consumption.",
+  keywords =     "Rendering Systems, Level of Detail Algorithms, Monte
+                 Carlo Techniques",
+  booktitle =    "Computer Graphics  (Proceedings of SIGGRAPH 2001)",
+  publisher =    "ACM SIGGRAPH",
+}
+
+@Book{berg:97,
+  year =         "1997",
+  title =        "Computational Geometry: Algorithms and Applications",
+  author =       "{Mark de} Berg and {Marc van} Kreveld and Mark
+                 Overmars and Otfried Schwarzkopf",
+  url =          "http://visinfo.zib.de/EVlib/Show?EVL-1997-230",
+  language =     "en",
+  abstract =     "Computational geometry emerged from the field of
+                 algorithms design and analysis in the late 1970s. It
+                 has grown into a recognized discipline with its own
+                 journals, conferences, and a large community of active
+                 researchers. The success of the field as a research
+                 discipline can on the one hand be explained from the
+                 beauty of the problems studied and the solutions
+                 obtained, and, on the other hand, by the many
+                 application domains---computer graphics, geographic
+                 information systems (GIS), robotics, and others---in
+                 which geometric algorithms play a fundamental role. For
+                 many geometric problems the early algorithmic solutions
+                 were either slow or difficult to understand and
+                 implement. In recent years a number of new algorithmic
+                 techniques have been developed that improved and
+                 simplified many of the previous approaches. In this
+                 textbook we have tried to make these modern algorithmic
+                 solutions accessible to a large audience. The book has
+                 been written as a textbook for a course in
+                 computational geometry, but it can also be used for
+                 self study. Each of the sixteen chapters, except the
+                 introductory chapter, starts with a problem arising in
+                 one of the application domains. This problem is then
+                 transformed into a purely geometric one, which is
+                 solved using techniques from computational geometry.
+                 The geometric problem and the concepts and techniques
+                 needed to solve it are the real topic of each chapter.
+                 The choice of the applications was guided by the topics
+                 in computational geometry we wanted to cover; they are
+                 not meant to provide a good coverage of the application
+                 domains. The purpose of the applications is to motivate
+                 the reader; the goal of the chapters is not to provide
+                 ready-to-use solutions for them. Having said this, we
+                 believe that knowledge of computational geometry is
+                 important to solve geometric problems in application
+                 areas efficiently. We hope that our book will not only
+                 raise the interest of people from the algorithms
+                 community, but also from people in the application
+                 areas. For most geometric problems treated we give just
+                 one solution, even when a number of different solutions
+                 exist. In general we have chosen the solution that is
+                 most easy to understand and implement. This is not
+                 necessarily the most efficient solution. We also took
+                 care that the book contains a good mixture of
+                 techniques like divide-and-conquer, plane sweep, and
+                 randomized algorithms. We decided not to treat all
+                 sorts of variations to the problems; we felt it is more
+                 important to introduce all main topics in computational
+                 geometry than to give more detailed information about a
+                 smaller number of topics.",
+  address =      "Berlin, Heidelberg, New York",
+  copyright =    "Springer-Verlag",
+  publisher =    "Springer-Verlag",
+}
+
+
+@InProceedings{Appel:1968:STS,
+  author =       "Arthur Appel",
+  title =        "Some Techniques for Shading Machine Renderings of
+                 Solids",
+  booktitle =    "AFIPS 1968 Spring Joint Computer Conf.",
+  pages =        "37--45",
+  volume =       "32",
+  year =         "1968",
+  keywords =     "visible",
+  annote =       "first ray tracing paper, light ray tracing, black and
+                 white pictures on Calcomp plotter This paper presents
+                 some recent experimental results in the automatic
+                 shading of line drawings. The purpose of these
+                 experiments was to generate pictures of objects
+                 consisting of flat surfaces on a digital plotter and to
+                 evaluate the cost of generating such pictures and the
+                 resultant graphical quality.",
+}
+
+
+@Article{floriani:95:vc,
+  author =       "L. De Floriani and P. Magillo",
+  title =        "Horizon Computation on a Hierarchical Terrain Model",
+  journal =      "The Visual Computer: An International Journal of
+                 Computer Graphics",
+  volume =       "11",
+  year =         "1995",
+  publisher =    "Springer Verlag, New York",
+  pages =        "134--149",
+  topic =        "visibility",
+}
+
+@InProceedings{nirenstein:02:egwr,
+  year =         "2002",
+  title =        "Exact {From-Region} Visibility Culling",
+  author =       "Shaun Nirenstein and Edwin Blake and James Gain",
+  booktitle =    "Proceedings of EUROGRAPHICS Workshop on Rendering",
+  pages =        "199--210",
+
+}
+
+@InCollection{Klosowski:2000:PLP,
+  pages =        "108--123",
+  year =         "2000",
+  title =        "The Prioritized-Layered Projection Algorithm for
+                 Visible Set Estimation",
+  url =          "http://visinfo.zib.de/EVlib/Show?EVL-2000-206",
+  author =       "J. T. Klosowski and C. T. Silva",
+  abstract =     "Prioritized-Layered Projection (PLP) is a technique
+                 for fast rendering of high depth complexity scenes. It
+                 works by estimating the visible polygons of a scene
+                 from a given viewpoint incrementally, one primitive at
+                 a time. It is not a conservative technique, instead PLP
+                 is suitable for the computation of partially correct
+                 images for use as part of time-critical rendering
+                 systems. From a very high level, PLP amounts to a
+                 modification of a simple view-frustum culling
+                 algorithm, however, it requires the computation of a
+                 special occupancy-based tessellation and the assignment
+                 to each cell of the tessellation a solidity value,
+                 which is used to compute a special ordering on how
+                 primitives get projected. In this paper, we detail the
+                 PLP algorithm, its main components, and implementation.
+                 We also provide experimental evidence of its
+                 performance, including results on two types of spatial
+                 tessellation (using octree- and Delaunay-based
+                 tessellations), and several datasets. We also discuss
+                 several extensions of our technique.",
+  editor =       "Hans Hagen and David S. Ebert",
+  keywords =     "Visibility, time-critical rendering, occlusion
+                 culling, visible set, spatial tessellation",
+  volume =       "6 (2)",
+  booktitle =    "IEEE Transactions on Visualization and Computer
+                 Graphics",
+  publisher =    "IEEE Computer Society",
+}
+
+@Article{Klosowski:2001:ECV,
+  author =       "James T. Klosowski and Cl{\'a}udio T. Silva.",
+  title =        "Efficient Conservative Visibility Culling Using the
+                 Prioritized-Layered Projection Algorithm",
+  journal =      "IEEE Transactions on Visualization and Computer
+                 Graphics",
+  volume =       "7",
+  number =       "4",
+  pages =        "365--379",
+  month =        oct,
+  year =         "2001",
+  coden =        "ITVGEA",
+  ISSN =         "1077-2626",
+  bibdate =      "Sat Feb 23 09:10:10 MST 2002",
+  url =          "http://www.computer.org/tvcg/tg2001/v0365abs.htm;
+                 http://dlib.computer.org/tg/books/tg2001/pdf/v0365.pdf",
+  acknowledgement = ack-nhfb,
+}
+
+
+@InProceedings{hey:01:egwr,
+  author =       "Heinrich Hey and Robert F. Tobler and Werner
+                 Purgathofer",
+  title =        "{Real-Time} Occlusion Culling with a Lazy Occlusion
+                 Grid",
+  pages =        "217--222",
+  year= "2001",
+  booktitle =    "Proceedings of EUROGRAPHICS Workshop on Rendering",
+}
+
+@InProceedings{wonka:01:eg,
+  pages =        "411--421",
+  year =         "2001",
+  title =        "Instant Visibility",
+  author =       "Peter Wonka and Michael Wimmer and Fran{\c{c}}ois X.
+                 Sillion",
+  url =          "http://visinfo.zib.de/EVlib/Show?EVL-2001-201",
+  abstract =     "We present an online occlusion culling system which
+                 computes visibility in parallel to the rendering
+                 pipeline. We show how to use point visibility
+                 algorithms to quickly calculate a tight potentially
+                 visible set (PVS) which is valid for several frames, by
+                 shrinking the occluders used in visibility calculations
+                 by an adequate amount. These visibility calculations
+                 can be performed on a visibility server, possibly a
+                 distinct computer communicating with the display host
+                 over a local network. The resulting system essentially
+                 combines the advantages of online visibility processing
+                 and region-based visibility calculations, allowing
+                 asynchronous processing of visibility and display
+                 operations. We analyze two different types of
+                 hardware-based point visibility algorithms and address
+                 the problem of bounded calculation time which is the
+                 basis for true real-time behavior. Our results show
+                 reliable, sustained 60 Hz performance in a walkthrough
+                 with an urban environment of nearly 2 million polygons,
+                 and a terrain flyover.",
+  booktitle =    "Computer Graphics Forum (Proceedings of EUROGRAPHICS '01)",
+  optpublisher =    "Blackwell Publishing",
+}
+
+@InProceedings{fernando:01:sig,
+  pages =        "387--390",
+  year =         "2001",
+  title =        "Adaptive Shadow Maps",
+  url =          "http://visinfo.zib.de/EVlib/Show?EVL-2001-128",
+  author =       "Randima Fernando and Sebastian Fernandez and Kavita
+                 Bala and Donald P. Greenberg",
+  abstract =     "Shadow maps provide a fast and convenient method of
+                 identifying shadows in scenes but can introduce
+                 aliasing. This paper introduces the Adaptive Shadow Map
+                 (ASM) as a solution to this problem. An ASM removes
+                 aliasing by resolving pixel size mismatches between the
+                 eye view and the light source view. It achieves this
+                 goal by storing the light source view (i.e., the shadow
+                 map for the light source) as a hierarchical grid
+                 structure as opposed to the conventional flat
+                 structure. As pixels are transformed from the eye view
+                 to the light source view, the ASM is refined to create
+                 higher-resolution pieces of the shadow map when needed.
+                 This is done by evaluating the contributions of shadow
+                 map pixels to the overall image quality. The
+                 improvement process is view-driven, progressive, and
+                 confined to a user-specifiable memory footprint. We
+                 show that ASMs enable dramatic improvements in shadow
+                 quality while maintaining interactive rates.",
+  keywords =     "Rendering, Shadow Algorithms",
+  booktitle =    "Computer Graphics  (Proceedings of SIGGRAPH '01)",
+  publisher =    "ACM SIGGRAPH",
+}
+
+
+@InProceedings{rusinkiewicz:00:sig,
+  pages =        "343--352",
+  year =         "2000",
+  title =        "{QS}plat: {A} Multiresolution Point Rendering System
+                 for Large Meshes",
+  url =          "http://visinfo.zib.de/EVlib/Show?EVL-2000-73",
+  author =       "Szymon Rusinkiewicz and Marc Levoy",
+  abstract =     "Advances in 3D scanning technologies have enabled the
+                 practical creation of meshes with hundreds of millions
+                 of polygons. Traditional algorithms for display,
+                 simplification, and progressive transmission of meshes
+                 are impractical for data sets of this size. We describe
+                 a system for representing and progressively displaying
+                 these meshes that combines a multiresolution hierarchy
+                 based on bounding spheres with a rendering system based
+                 on points. A single data structure is used for view
+                 frustum culling, backface culling, level-of-detail
+                 selection, and rendering. The representation is compact
+                 and can be computed quickly, making it suitable for
+                 large data sets. Our implementation, written for use in
+                 a large-scale 3D digitization project, launches
+                 quickly, maintains a user-settable interactive frame
+                 rate regardless of object complexity or camera
+                 position, yields reasonable image quality during
+                 motion, and refines progressively when idle to a high
+                 final image quality. We have demonstrated the system on
+                 scanned models containing hundreds of millions of
+                 samples.",
+  keywords =     "Rendering systems, Spatial data structures, Level of
+                 detail algorithms, Compression algorithms",
+  booktitle =    "Computer Graphics  (Proceedings of SIGGRAPH 2000)",
+  publisher =    "ACM SIGGRAPH / Addison Wesley Longman",
+}
+
+@InProceedings{pfister:00:sig,
+  pages =        "335--342",
+  year =         "2000",
+  title =        "Surfels: Surface Elements as Rendering Primitives",
+  url =          "http://visinfo.zib.de/EVlib/Show?EVL-2000-69",
+  author =       "Hanspeter Pfister and Matthias Zwicker and Jeroen van
+                 Baar and Markus Gross",
+  abstract =     "Surface elements (surfels) are a powerful paradigm to
+                 efficiently render complex geometric objects at
+                 interactive frame rates. Unlike classical surface
+                 discretizations, i.e., triangles or quadrilateral
+                 meshes, surfels are point primitives without explicit
+                 connectivity. Surfel attributes comprise depth, texture
+                 color, normal, and others. As a pre-process, an
+                 octree-based surfel representation of a geometric
+                 object is computed. During sampling, surfel positions
+                 and normals are optionally perturbed, and different
+                 levels of texture colors are prefiltered and stored per
+                 surfel. During rendering, a hierarchical forward
+                 warping algorithm projects surfels to a z-buffer. A
+                 novel method called visibility splatting determines
+                 visible surfels and holes in the z-buffer. Visible
+                 surfels are shaded using texture filtering, Phong
+                 illumination, and environment mapping using per-surfel
+                 normals. Several methods of image reconstruction,
+                 including supersampling, offer flexible speed-quality
+                 tradeoffs. Due to the simplicity of the operations, the
+                 surfel rendering pipeline is amenable for hardware
+                 implementation. Surfel objects offer complex shape, low
+                 rendering cost and high image quality, which makes them
+                 specifically suited for low-cost, real-time graphics,
+                 such as games.",
+  keywords =     "Rendering Systems, Texture Mapping",
+  booktitle =    "Computer Graphics (Proceedings of SIGGRAPH 2001)",
+  publisher =    "ACM SIGGRAPH / Addison Wesley Longman",
+}
+
+
+@InProceedings{Grossman:rend98-181,
+  booktitle =    "Rendering Techniques '98 (Proceedings of Eurographics Rendering Workshop)",
+  year =         "1998",
+  publisher =    "Springer-Verlag Wien New York",
+  author =       "J. P. Grossman and William J. Dally",
+  title =        "Point Sample Rendering",
+  pages =        "181--192",
+  abstract =     "We present an algorithm suitable for real-time, high
+                 quality rendering of complex objects. Objects are
+                 represented as a dense set of surface point samples
+                 which contain colour, depth and normal infocmation.
+                 These point samples are obtained by sampling
+                 orthographic views on an equilateral triangle lattice.
+                 They are rendered directly and independently without
+                 any knowledge of surface topology. We introduce a novel
+                 solution to the problem of surface reconstruction using
+                 a hierarchy of Z-buffers to detect tears. Our algorithm
+                 is fast and requires only modest resources.",
+}
+
+
+
+@Article{Bartz:1999:OAO,
+  author =       "Dirk Bartz and Michael Mei{\ss}ner and Tobias
+                 H{\"u}ttner",
+  title =        "Open{GL}-assisted occlusion culling for large
+                 polygonal models",
+  journal =      "Computers and Graphics",
+  volume =       "23",
+  number =       "5",
+  pages =        "667--679",
+  month =        oct,
+  year =         "1999",
+  coden =        "COGRD2",
+  ISSN =         "0097-8493",
+  bibdate =      "Sat Oct 21 14:27:20 MDT 2000",
+  url =          "http://www.elsevier.nl/gej-ng/10/13/20/24/34/31/abstract.html;
+                 http://www.elsevier.nl/gej-ng/10/13/20/24/32/31/article.pdf",
+  acknowledgement = ack-nhfb,
+}
+
+
+@InProceedings{popescu:98:viz,
+  author =       "V. Popescu and A. Lastra and D. Aliaga and M. de
+                 Oliveira Neto",
+  title =        "Efficient warping for architectural walkthroughs using
+                 layered depth images",
+  pages =        "211--216",
+  booktitle =    "{IEEE} Visualization '98 ({VIS} '98)",
+  ISBN =         "0-8186-9176-X",
+  month =        oct,
+  publisher =    "IEEE",
+  address =      "Washington - Brussels - Tokyo",
+  year =         "1998",
+}
+
+
+@InProceedings{aliaga:99:sig,
+  author =       "Daniel G. Aliaga and Anselmo Lastra",
+  title =        "Automatic Image Placement to Provide a Guaranteed
+                 Frame Rate",
+  pages =        "307--316",
+  ISBN =         "0-201-48560-5",
+  editor =       "Alyn Rockwood",
+  booktitle =    "Proceedings of the Conference on Computer Graphics
+                 (Siggraph99)",
+  month =        aug # "8--13",
+  publisher =    "ACM Press",
+  address =      "N.Y.",
+  year =         "1999",
+}
+
+@InProceedings{aliaga:99:i3dg,
+  author =       "Daniel Aliaga and Jon Cohen and Andrew Wilson and Eric
+                 Baker and Hansong Zhang and Carl Erikson and Keny Hoff
+                 and Tom Hudson and Wolfgang St{\"u}rzlinger and Rui
+                 Bastos and Mary Whitton and Fred Brooks and Dinesh
+                 Manoclia",
+  title =        "{MMR}: An Interactive Massive Model Rendering System
+                 Using Geometric and Image-Based Acceleration (Color
+                 Plate {S}. 237)",
+  pages =        "199--206",
+  ISBN =         "1-58113-082-1",
+  editor =       "Stephen N. Spencer",
+  booktitle =    "Proceedings of the Conference on the 1999 Symposium on
+                 interactive {3D} Graphics",
+  month =        apr # " ~26--28",
+  publisher =    "ACM Press",
+  address =      "New York",
+  year =         "1999",
+}
+
+
+
+@InProceedings{wimmer:01:egwr,
+  author =       "Michael Wimmer and Peter Wonka and Francois Sillion",
+  title =        "{Point-Based} Impostors for {Real-Time}
+                 Visualization",
+  pages =        "163--176",
+  crossref =     "RENDERING TECHNIQUES`01",
+}
+
+@InProceedings{Jeschke:LEM:2002,
+  title =        "{Layered Environment-Map Impostors for Arbitrary
+                 Scenes}",
+  author =       "Stefan Jeschke and Michael Wimmer and Heidrun
+                 Schuman",
+  booktitle =    "Proc. Graphics Interface",
+  year =         "2002",
+  month =        may,
+  location =     "Calgary, Alberta",
+  pages =        "1--8",
+}
+
+@Book{Neider93,
+  author =       "Jackie Neider and Tom Davis and Mason Woo",
+  title =        "{OpenGL} Programming Guide",
+  publisher =    "Addison-Wesley",
+  address =      "Reading MA",
+  year =         "1993",
+  keywords =     "computer graphics, graphics workstation, SGI",
+  annote =       "shadows on a plane p. 401",
+}
+
+@PhdThesis{Havran2000:PhD,
+ author = "Vlastimil Havran",
+ title  = "Heuristic Ray Shooting Algorithms",
+ school = "Department of Computer Science and Engineering,
+           Faculty of Electrical Engineering,
+           Czech Technical University in Prague",
+ type   = "Ph.D. Thesis",
+ year   = "2000",
+ month  = "November",
+ url    = "http://www.cgg.cvut.cz/~havran/phdthesis.html",
+ annote = "Global illumination research aiming at the photo-realistic
+    image synthesis pushes forward research in computer graphics as a
+    whole. The computation of visually plausible images is
+    time-consuming and far from being realtime at present. A significant
+    part of computation in global illumination algorithms involves
+    repetitive computing of visibility queries.
+      In the thesis, we describe our results in ray shooting, which is
+    a well-known problem in the field of visibility. The problem is
+    difficult in spite of its simple definition: For a given oriented
+    half-line and a set of objects, find out the first object
+    intersected by the half-line if such an object exists. A
+    naive algorithm has the time complexity O(N), where N
+    is the number of objects. The naive algorithm is practically
+    inapplicable in global illumination applications for a scene with
+    a high number of objects, due its huge time requirements. In this
+    thesis we deal with heuristic ray shooting algorithms that use
+    additional spatial data structures. We put stress on average-case
+    complexity and we particularly investigate the ray shooting
+    algorithms based on spatial hierarchies. In the thesis we deal
+    with two major topics.
+      In the first part of the thesis, we introduce a ray shooting
+    computation model and performance model. Based on these two models
+    we develop a methodology for comparing various ray shooting
+    algorithms for a set of experiments performed on a set of
+    scenes. Consecutively, we compare common heuristic ray shooting
+    algorithms based on BSP trees, kd-trees, octrees, bounding volume
+    hierarchies, uniform grids, and three types of hierarchical grids
+    using a set of 30 scenes from Standard Procedural Database. We
+    show that for this set of scenes the ray shooting algorithm based
+    on the kd-tree is the winning candidate among all tested ray
+    shooting algorithms.
+      The second and major part of the thesis presents several
+    techniques for decreasing the time and space complexity for ray
+    shooting algorithms based on kd-tree. We deal with both kd-tree
+    construction and ray traversal algorithms. In the context of kd-tree
+    construction, we present new methods for adaptive construction of
+    the kd-tree using empty spatial regions in the scene, termination
+    criteria, general cost model for the kd-tree, and modified surface
+    area heuristics for a restricted set of rays. Further, we describe
+    a new version of the recursive ray traversal algorithm. In context
+    of the recursive ray traversal algorithm based on the kd-tree, we
+    develop the concept of the largest common traversal sequence. This
+    reduces the number of hierarchical traversal steps in the kd-tree
+    for certain ray sets. We also describe one technique closely related
+    to computer architecture, namely mapping kd-tree nodes to memory to
+    increase the cache hit ratio for processors with a large cache
+    line. Most of the techniques proposed in the thesis can be used in
+    combination. In practice, the average time complexity of the ray
+    shooting algorithms based on the kd-tree, as presented in this thesis,
+    is about $O(log N)$, where the hidden multiplicative factor
+    depends on the input data. However, at present it is not known
+    to have been proved theoretically for scenes with general
+    distribution of objects. For these reasons our findings are
+    supported by a set of experiments for the above-mentioned set of
+    30 scenes.",
+}
+
+
+@InProceedings{goral84a,
+  author =       "Cindy M. Goral and Kenneth K. Torrance and Donald P.
+                 Greenberg and Bennett Battaile",
+  title =        "Modelling the Interaction of Light Between Diffuse
+                 Surfaces",
+  pages =        "213--222",
+  booktitle =      "Computer Graphics (SIGGRAPH '84 Proceedings)",
+  volume =       "18",
+  number =       "3",
+  year =         "1984",
+  month =        jul,
+  conference =   "held in Minneapolis, Minnesota; 23--27 July 1984",
+  keywords =     "radiosity method, diffuse surfaces, I37 Lighting
+                 Interaction",
+  annote =       "The classic reference on radiosity. Early work on
+                 radiosity method. See Hemi Cube paper for more in depth
+                 description of implementation.",
+}
+
+@InProceedings{Heidrich:00:EGWR,
+  author =       "Wolfgang Heidrich and Stefan Brabec and {Hans-Peter}
+                 Seidel",
+  title =        "Soft Shadow Maps for Linear Lights",
+  pages =        "269--280",
+  year = "2000",
+  booktitle =    "Proceedings of EUROGRAPHICS Workshop on Rendering",
+}
+
+@Article{Heidmann91,
+  author =       "Tim Heidmann",
+  title =        "Real Shadows, Real Time",
+  journal =      "Iris Universe",
+  note =         "Silicon Graphics, Inc.",
+  volume =       "18",
+  year =         "1991",
+  pages =        "28--31",
+  keywords =     "soft shadow, SGI Reality Engine, stencil buffer,
+                 shadow volume",
+  annote =       "includes C, GL code",
+}
+
+@InProceedings{Heidrich:99:IDG,
+  year =         "1999",
+  title =        "Applications of Pixel Textures in Visualization and
+                 Realistic Image Synthesis",
+  author =       "W. Heidrich and R. Westermann and H.-P. Seidel and T.
+                 Ertl",
+  url =          "http://visinfo.zib.de/EVlib/Show?EVL-1999-121",
+  organization = "ACM/Siggraph",
+  booktitle =    "ACM Symposium on Interactive 3D Graphics",
+}
+
+
+@Article{Segal92,
+  author =       "Mark Segal and Carl Korobkin and Rolf van Widenfelt
+                 and Jim Foran and Paul Haeberli",
+  title =        "Fast Shadows and Lighting Effects using Texture
+                 Mapping",
+  journal =      "Computer Graphics (SIGGRAPH '92 Proceedings)",
+  volume =       "26",
+  number =       "2",
+  month =        jul,
+  year =         "1992",
+  pages =        "249--252",
+  keywords =     "perspective, scan conversion",
+}
+
+
+@InProceedings{Williams78,
+AUTHOR={Lance Williams},
+TITLE={Casting Curved Shadows on Curved Surfaces},
+booktitle={Computer Graphics (SIGGRAPH '78 Proceedings)},
+MONTH={Aug.},
+YEAR={1978},
+PAGES={270-274},
+}
+
+@InProceedings{Hoppe:98:LOD,
+  pages =        "35--42",
+  year =         "1998",
+  title =        "Smooth View-Dependent Level-Of-Detail Control and its
+                 Application to Terrain Rendering",
+  url =          "http://visinfo.zib.de/EVlib/Show?EVL-1998-124",
+  author =       "Hugues Hoppe",
+  language =     "en",
+  abstract =     "The key to real-time rendering of large-scale surfaces
+                 is to locally adapt surface geometric complexity to
+                 changing view parameters. Several schemes have been
+                 developed to address this problem of view-dependent
+                 level-of-detail control. Among these, the
+                 view-dependent progressive mesh (VDPM) framework
+                 represents an arbitrary triangle mesh as a hierarchy of
+                 geometrically optimized refinement transformations,
+                 from which accurate approximating meshes can be
+                 efficiently retrieved. In this paper we extend the
+                 general VDPM framework to provide temporal coherence
+                 through the runtime creation of geomorphs. These
+                 geomorphs eliminate {"}popping{"} artifacts by smoothly
+                 interpolating geometry. Their implementation requires
+                 new output-sensitive data structures, which have the
+                 added benefit of reducing memory use. We specialize the
+                 VDPM framework to the important case of terrain
+                 rendering. To handle huge terrain grids, we introduce a
+                 block-based simplification scheme that constructs a
+                 progressive mesh as a hierarchy of block refinements.
+                 We demonstrate the need for an accurate approximation
+                 metric during simplification. Our contributions are
+                 highlighted in a real-time flyover of a large, rugged
+                 terrain. Notably, the use of geomorphs results in
+                 visually smooth rendering even at 72 frames/sec on a
+                 graphics workstation.",
+  organization = "IEEE",
+  copyright =    "IEEE",
+  booktitle =    "Proceedings IEEE Visualization'98",
+}
+
+@InProceedings{Hoppe:1997:VDR,
+  author =       "Hugues Hoppe",
+  title =        "View-Dependent Refinement of Progressive Meshes",
+  booktitle =    "SIGGRAPH 97 Conference Proceedings",
+  editor =       "Turner Whitted",
+  series =       "Annual Conference Series",
+  year =         "1997",
+  organization = "ACM SIGGRAPH",
+  publisher =    "Addison Wesley",
+  month =        aug,
+  pages =        "189--198",
+  note =         "ISBN 0-89791-896-7",
+  keywords =     "mesh simplification, level-of-detail, multiresolution
+                 representations, dynamic tessellation, shape
+                 interpolation",
+  annote =       "Level-of-detail (LOD) representations are an important
+                 tool for real-time rendering of complex geometric
+                 environments. The previously introduced progressive
+                 mesh representation defines for an arbitrary triangle
+                 mesh a sequence of approximating meshes optimized for
+                 view-independent LOD. In this paper, we introduce a
+                 framework for selectively refining an arbitrary
+                 progressive mesh according to changing view parameters.
+                 We define efficient refinement criteria based on the
+                 view frustum, surface orientation, and screen-space
+                 geometric error, and develop a real-time algorithmfor
+                 incrementally refining and coarsening the mesh
+                 according to these criteria. The algorithm exploits
+                 view coherence, supports frame rate regulation, and is
+                 found to require less than 15% of total frame time on a
+                 graphics workstation. Moreover, for continuous motions
+                 this work can be amortized over consecutive frames. In
+                 addition, smooth visual transitions (geomorphs) can be
+                 constructed between any two selectively refined meshes.
+                 A number of previous schemes create view-dependent LOD
+                 meshes for height fields (e.g. terrains) and parametric
+                 surfaces (e.g. NURBS). Our framework also performs well
+                 for these special cases. Notably, the absence of a
+                 rigid subdivision structure allows more accurate
+                 approximations than with existing schemes. We include
+                 results for these cases as well as for general
+                 meshes.",
+}
+
+@InProceedings{Hoppe:1996:PM,
+  author =       "Hugues Hoppe",
+  title =        "Progressive Meshes",
+  editor =       "Holly Rushmeier",
+  series =       "Annual Conference Series",
+  pages =        "99--108",
+  booktitle =    "SIGGRAPH 96 Conference Proceedings",
+  year =         "1996",
+  organization = "ACM SIGGRAPH",
+  publisher =    "Addison Wesley",
+  month =        aug,
+  note =         "held in New Orleans, Louisiana, 04-09 August 1996",
+  annote =       "Highly detailed geometric models are rapidly becoming
+                 commonplace in computer graphics. These models, often
+                 represented as complex triangle meshes, challenge
+                 rendering performance, transmission bandwidth, and
+                 storage capacities. This paper introduces the
+                 progressive mesh (PM) representation, a new scheme for
+                 storing and transmitting arbitrary triangle meshes.
+                 This efficient, lossless, continuous-resolution
+                 representation addresses several practical problems in
+                 graphics: smooth geomorphing of level-of-detail
+                 approximations, progressive transmission, mesh
+                 compression, and selective refinement. In addition, we
+                 present a new mesh simplification procedure for
+                 constructing a PM representation from an arbitrary
+                 mesh. The goal of this optimization procedure is to
+                 preserve not just the geometry of the original mesh,
+                 but more importantly its overall appearance as defined
+                 by its discrete and scalar appearance attributes such
+                 as material identifiers, color values, normals, and
+                 texture coordinates. We demonstrate construction of the
+                 PM representation and its applications using several
+                 practical models.",
+}
+
+
+@InProceedings{andujar:2000:HVS,
+  author = 	 {Carlos And\'ujar, Carlos Saona-V\'azquez, Isabel Navazo and Pere Brunet},
+  title = 	 {Integrating Occlusion Culling with Levels of Detail through Hardly-Visible Sets},
+  booktitle = {Computer Graphics Forum (Proceedings of Eurographics 2000)},
+  year = 	 {2000},
+  volume = "19",
+number="3",
+pages="499--506",
+}
+
+@InProceedings{downs:2001:I3DG,
+  author =       "Laura Downs and Tomas M{\"o}ller and Carlo H.
+                 S{\'e}quin",
+  title =        "Occlusion Horizons for Driving through Urban Scenes",
+  booktitle =    "Symposium on Interactive {3D} Graphics",
+  year = "2001",
+  organization = "ACM SIGGRAPH",
+  pages =        "121--124",
+}
+
+
+@PhdThesis{zhang_phd,
+  author = 	 {Hansong Zhang},
+  title = 	 {Effective Occlusion Culling for the Interactive Display of Arbitrary Models},
+  school = 	 {Department of Computer Science, UNC-Chapel Hill},
+  year = 	 {1998},
+}
+
+@PhdThesis{wonka_phd,
+  author = 	 {Peter Wonka},
+  title = 	 {Occlusion Culling for Real-Time Rendering of Urban Environments},
+  school = 	 {Institute of Computer Graphics, Vienna University of Technology},
+  year = 	 {2001},
+}
+
+@TechReport{Schumacker69,
+  author =       "R. A. Schumacker and R. Brand and M. Gilliland and W.
+                 Sharp",
+  title =        "Study for Applying Computer-Generated Images to Visual
+                 Simulation",
+  institution =  "U.S. Air Force Human Resources Laboratory",
+  year =         "1969",
+  number =       "AFHRL--TR--69--14",
+}
+
+
+@InProceedings{Carpenter:1984:BAH,
+  author =       "Loren Carpenter",
+  title =        "The {A}-buffer, an Antialiased Hidden Surface Method",
+  pages =        "103--108",
+  booktitle =    "Computer Graphics (SIGGRAPH '84 Proceedings)",
+  volume =       "18",
+  year =         "1984",
+  month =        jul,
+  editor =       "Hank Christiansen",
+  conference =   "held in Minneapolis, Minnesota; 23--27 July 1984",
+  keywords =     "z-buffer, a-buffer, antialiasing, I33 Anti-Aliasing,
+                 I37 Hidden-Surface Removal",
+  annote =       "Carpenter presents a method of constructing
+                 antialiased images in a method which allows
+                 transparency. If flavor, it is very similar to
+                 z-buffer, but subsamples pixels and maintains coverage
+                 masks to allow effective antialiasing.",
+}
+
+
+@InProceedings{Newell:1972:SHS,
+  author =       "Martin E. Newell and R. G. Newell and T. L. Sancha",
+  title =        "A Solution to the Hidden Surface Problem",
+  year =         "1972",
+  booktitle =    "Proceedings of ACM National Conference",
+  keywords =     "hidden surface",
+}
+
+@TechReport{Warnock:1969:HSA,
+  author =       "J. Warnock",
+  title =        "A Hidden-Surface Algorithm for Computer Generated
+                 Half-Tone Pictures",
+  number =       "TR 4--15, NTIS AD-733 671",
+  year =         "1969",
+  institution =  "University of Utah, Computer Science Department",
+  keywords =     "visible",
+}
+
+@InProceedings{Weiler:1977:HSR,
+  author =       "Kevin Weiler and Peter Atherton",
+  title =        "Hidden Surface Removal Using Polygon Area Sorting",
+  booktitle =      "Computer Graphics (SIGGRAPH '77 Proceedings)",
+  conference =   "held in San Jose, California; 20 -- 22 July 1977",
+  month =        jul,
+  year =         "1977",
+  pages =        "214--222",
+  keywords =     "hidden surface removal, hidden line removal",
+}
+
+
+@InProceedings{iones:1998:CGI,
+  author =       "A. Iones and S. Zhukov and A. Krupkin",
+  title =        "On Optimality of {OBBs} for Visibility Tests for
+                 Frustum Culling, Ray Shooting and Collision Detection",
+  pages =        "256--263",
+  ISBN =         "0-8186-8445-3",
+  editor =       "Franz-Erich Wolter and Nicholas M. Patrikalakis",
+  booktitle =    "Proceedings of the Conference on Computer Graphics
+                 International 1998 ({CGI}-98)",
+  month =        jun # " ~22--26",
+  publisher =    "IEEE Computer Society",
+  address =      "Los Alamitos, California",
+  year =         "1998",
+}
+
+
+@Article{Assarsson:2000:OVF,
+  author =       "Ulf Assarsson and Tomas M{\"o}ller",
+  title =        "Optimized View Frustum Culling Algorithms for Bounding
+                 Boxes",
+  journal =      "Journal of Graphics Tools: JGT",
+  volume =       "5",
+  number =       "1",
+  pages =        "9--22",
+  year =         "2000",
+  coden =        "JGTOFD",
+  ISSN =         "1086-7651",
+  bibdate =      "Thu Oct 12 17:08:13 2000",
+  url =          "http://www.acm.org/jgt/papers/AssarssonMoller00/",
+  abstract =     "This paper presents optimizations for faster view
+                 frustum culling (VFC) for axis-aligned bounding box
+                 (AABB) and oriented bounding box (OBB) hierarchies. We
+                 exploit frame-to-frame coherency by caching and by
+                 comparing against previous distances and rotation
+                 angles. By using an octant test, we potentially halve
+                 the number of plane tests needed, and we also evaluate
+                 masking, which is a well-known technique. The
+                 optimizations can be used for arbitrary bounding
+                 volumes, but we present only results for ABBs and OBBs.
+                 In particular, we provide solutions which are 2-11
+                 times faster than other VFC algorithms for AABBs and
+                 OBBs, depending on the circumstances.",
+  acknowledgement = ack-nhfb,
+}
+
+@InProceedings{Wonka:1999:OSF,
+  author =       "Peter Wonka and Dieter Schmalstieg",
+  title =        "Occluder Shadows for Fast Walkthroughs of Urban
+                 Environments",
+  booktitle =      "Computer Graphics Forum (Proceedings of EUROGRAPHICS '99)",
+  month =        sep,
+  year =         "1999",
+  optpublisher =    "Blackwell Publishers",
+  pages =        "51--60",
+  annote =       "This paper describes a new algorithm that employs
+                 image-based rendering for fast occlusion culling in
+                 complex urban environments. It exploits graphics
+                 hardware to render and automatically combine a
+                 relatively large set of occluders. The algorithm is
+                 fast to calculate and therefore also useful for scenes
+                 of moderate complexity and walkthroughs with over 20
+                 frames per second. Occlusion is calculated dynamically
+                 and does not rely on any visibility precalculation or
+                 occluder preselection. Speed-ups of one order of
+                 magnitude can be obtained.",
+}
+
+@Book{Moller99-RTR,
+  author =       "Tomas M{\"o}ller and Eric Haines",
+  year =         "1999",
+  title =        "Real-Time Rendering",
+  publisher =    "A. K. Peters Limited",
+}
+
+@InProceedings{Chrysanthou:1995:SVB,
+  author =       "Yiorgos Chrysanthou and Mel Slater",
+  title =        "Shadow Volume {BSP} Trees for Computation of Shadows
+                 in Dynamic Scenes",
+  editor =       "Pat Hanrahan and Jim Winget",
+  pages =        "45--50",  
+  booktitle =    "1995 Symposium on Interactive {3D} Graphics",
+  year =         "1995",
+  organization = "ACM SIGGRAPH",
+  month =        apr,
+  note =         "ISBN 0-89791-736-7",
+}
+
+@ARTICLE{Crow77,
+AUTHOR={Franklin C. Crow},
+TITLE={Shadow Algorithms for Computer Graphics},
+JOURNAL={Computer Graphics
+(SIGGRAPH '77 Proceedings)},
+VOLUME={11},
+NUMBER={2},
+MONTH={Summer},
+YEAR={1977},
+}
+
+
+@InProceedings{GTHP99,
+  author ="J\'erome Grasset and Olivier Terraz and Jean-Marc Hasenfratz and Dimitri Plemenos",
+  title ="Accurate Scene Display by Using Visibility Maps",
+  booktitle ="Spring Conference on Computer Graphics and its Applications",
+  year ="1999",
+  url ="http://www-imagis.imag.fr/Publications/1999/GTHP99"
+}
+
+
+@Unpublished{cdd_site,
+  author = 	 {Komei Fukuda},
+  title = 	 {Cdd home page},
+  note = 	 {http://www.ifor.math.ethz.ch},
+}
+
+%  note = 	 "http://www.ifor.math.ethz.ch/fukuda/cdd_home/cdd.html",
+
+@Unpublished{nvidia_site,
+  author = 	 {NVIDIA corp.},
+  title = 	 {Graphics hardware specifications.},
+  note = 	 {http://www.nvidia.com},
+}
+
+@Unpublished{ati_site,
+  author = 	 {ATI corp.},
+  title = 	 {Graphics hardware specifications.},
+  note = 	 {http://www.ati.com},
+}
+
+
+%See remarks \cite{Pavlidis:1990:RCS,Wold:1990:RCS}.
+@Article{Cook:1986:SSC,
+  author =       "Robert L. Cook",
+  title =        "Stochastic Sampling in Computer Graphics",
+  journal =      "ACM Transactions on Graphics",
+  volume =       "5",
+  number =       "1",
+  pages =        "51--72",
+  month =        jan,
+  year =         "1986",
+  coden =        "ATGRDF",
+  ISSN =         "0730-0301",
+  bibdate =      "Thu Aug 25 23:39:28 1994",
+  note =         "
+                 Also in Tutorial: Computer Graphics: Image Synthesis,
+                 Computer Society Press, Washington, 1988, pp.
+                 283--304.",
+  url =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/8927.html",
+  acknowledgement = ack-nhfb,
+  keywords =     "algorithms; antialiasing; depth of field; filtering;
+                 image synthesis; Monte Carlo integration; motion blur;
+                 raster graphics; ray tracing; stochastic sampling",
+  review =       "ACM CR 8709-0784",
+  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
+                 GRAPHICS, Picture/Image Generation, Viewing algorithms.
+                 {\bf G.3}: Mathematics of Computing, PROBABILITY AND
+                 STATISTICS, Probabilistic algorithms (including Monte
+                 Carlo).",
+}
+
+
+@ARTICLE{Cohen85,
+AUTHOR={Michael F. Cohen and Donald P. Greenberg},
+TITLE={The Hemi-Cube: A Radiosity Solution for Complex Environments},
+JOURNAL={Computer Graphics
+(SIGGRAPH '85 Proceedings)},
+VOLUME={19},
+NUMBER={3},
+MONTH={July},
+YEAR={1985},
+PAGES={31-40},
+KEYWORDS={shading, diffuse reflection},
+}
+
+@Article{Sutherland:1974:CTH,
+  author =       "Ivan E. Sutherland and Robert F. Sproull and Robert A.
+                 Schumacker",
+  title =        "A Characterization of Ten Hidden-Surface Algorithms",
+  journal =      "ACM Computing Surveys",
+  volume =       "6",
+  number =       "1",
+  pages =        "1--55",
+  month =        mar,
+  year =         "1974",
+  coden =        "CMSVAN",
+  ISSN =         "0010-4892",
+  bibdate =      "Mon Sep 26 21:02:43 1994",
+  annote =       "A classic paper; describes all the major hidden
+                 surface algorithms of the time, and gives a
+                 classification scheme.",
+  keywords =     "parallel processing; survey; visible surfaces",
+}
+
+
+@Article{Cohen:2002:survey,
+  author =       "D. Cohen-Or and Y. Chrysanthou and C. Silva and F. Durand",
+  title =        " A Survey of Visibility for Walkthrough Applications",
+  year =         "2003",
+  journal =      "IEEE Transactions on Visualization and Computer Graphics",
+  volume = "9",
+  number = "3",
+  pages = "412--431"
+}
+%  note = "Also available as http://www.cs.ucy.ac.cy/\~yiorgos/publications/survey_draft.pdf",
+
+@InProceedings{Whitted:1979:IIM,
+  author =       "T. Whitted",
+  title =        "An improved illumination model for shaded display",
+  pages =        "1--14",
+  booktitle =      "Computer Graphics (Special SIGGRAPH '79 Issue)",
+  volume =       "13",
+  number =       "3",
+  year =         "1979",
+  month =        aug,
+  keywords =     "algorithmic aspects, shading, animation/dynamic
+                 graphics, shaded images, raster graphics",
+}
+
+
+@Book{Szirmay-Kalos:1995a,
+  author =       "L{\'a}szl{\'o} {Szirmay-Kalos ed.} and G{\'a}bor
+                 M{\'a}rton and B. Dobos and T. Horv{\'a}th and P.
+                 Risztics and E. Kov{\'a}cs",
+  title =        "Theory of Three-Dimensional Computer Graphics",
+  note =         "English revision by Ian A. Stroud",
+  publisher =    "Akad{\'e}miai Kiad{\'o}",
+  address =      "Budapest, Hungary",
+  month =        sep,
+  year =         "1995",
+  series =       "Technical Sciences: Advances in Electronics",
+  volume =       "13",
+  ISBN =         "963-05-6911-6",
+  library =      "Uni of Newcastle, Auchmuty Library - 006.6 SZIR",
+  citedby =      "\cite{00000192}",
+}
+
+
+@InProceedings{Catmull:1975:CDC,
+  author =       "Edwin E. Catmull",
+  title =        "Computer Display of Curved Surfaces",
+  booktitle =    "Proceedings of the IEEE Conference on Computer
+                 Graphics, Pattern Recognition, and Data Structure",
+  pages =        "11--17",
+  year =         "1975",
+  month =        may,
+  conference =   "held in Los Angeles; 14-16 May 1975",
+  keywords =     "curves and surfaces, design and modeling, graphics,
+                 algorithms",
+}
+
+@Book{Weisstein:1999:CCE,
+  author =       "Eric W. Weisstein",
+  title =        "The {CRC} Concise Encyclopedia of Mathematics",
+  publisher =    "CRC Press",
+  address =      "2000 N.W. Corporate Blvd., Boca Raton, FL 33431-9868,
+                 USA",
+  pages =        "1969",
+  year =         "1999",
+  ISBN =         "0-8493-9640-9",
+  LCCN =         "QA5.W45 1999",
+  bibdate =      "Tue Apr 13 06:58:01 1999",
+  price =        "US\$79.95",
+  acknowledgement = ack-mg,
+  annote =       "From Michel Goossens: ``This is a marvelous book for
+                 all (of us) who like mathematics. It might be
+                 interesting to note the quote from the start of the
+                 Acknowledgements, where the author spends a whole
+                 paragraph thanking Knuth for inventing \TeX{} (he
+                 started his book some ten years ago in Word \ldots{}),
+                 without which he could never have published his book.
+                 He also thanks Trevorrow (for Oz\TeX) and Drakos and
+                 Ross (for \LaTeX2HTML). His whole book is on the Web
+                 (with {\tt l2h})
+                 \path=http://www.astro.virginia.edu/~eww6n/math/=
+                 (Eric's Treasure Troves of Science), although often the
+                 site is unavailable due to the many downlaod
+                 requests.''",
+}
+
+@InProceedings{EVL-2001-66,
+  year =         "2001",
+  title =        "Searching Triangle Strips Guided by Simplification
+                 Criterion",
+  author =       "O. Belmonte and J. Ribelles and I. Remolar and M.
+                 Chover",
+  url =          "http://visinfo.zib.de/EVlib/Show?EVL-2001-66",
+  abstract =     "Triangle strips are widely used as a method to
+                 accelerate the visualisation process of polygon models
+                 in interactive graphics applications. Another widely
+                 used method to improve drawing speed is the utilisation
+                 of multiresolution models. These models are constructed
+                 based on simplification algorithms. None of the current
+                 algorithms for searching strips contemplates the
+                 posterior simplification of the initial model. In this
+                 paper an algorithm for searching strips is presented.
+                 The triangles forming a strip are selected based on a
+                 simplification criterion according to the average
+                 quadratic error associated with the contraction of
+                 edges so that the model is simplified. In this manner
+                 the strips encountered are conserved as the model is
+                 being simplified. The strips generated in this way may
+                 be used to draw the polygon model in an incremental
+                 form or to transmit it progressively within a computer
+                 network.",
+  editor =       "V. Skala",
+  keywords =     "Triangle strip searching, interactive visualisation,
+                 simplification algorithms, multiresolution models.",
+  booktitle =    "WSCG 2001 Conference Proceedings",
+}
+
+
+@InProceedings{EVL-2001-262,
+  pages =        "91--100",
+  year =         "2001",
+  title =        "Tunneling for Triangle Strips in Continuous
+                 Level-of-Detail Meshes",
+  author =       "A. James Stewart",
+  url =          "http://visinfo.zib.de/EVlib/Show?EVL-2001-262",
+  abstract =     "This paper describes a method of building and
+                 maintaining a good set of triangle strips for both
+                 static and continuous level-of-detail (CLOD) meshes.
+                 For static meshes, the strips are better than those
+                 computed by the classic SGI and STRIPE algorithms. For
+                 CLOD meshes, the strips are maintained incrementally as
+                 the mesh topology changes. The incremental changes are
+                 fast and the number of strips is kept very small.",
+  editor =       "B. Watson and J. W. Buchanan",
+  booktitle =    "Proceedings of Graphics Interface",
+}
+
+
+@InProceedings{EVL-1996-290,
+  pages =        "319--326",
+  year =         "1996",
+  title =        "Optimizing Triangle Strips for Fast Rendering",
+  author =       "Francine Evans and Steven S. Skiena and Amitabh
+                 Varshney",
+  url =          "http://visinfo.zib.de/EVlib/Show?EVL-1996-290",
+  abstract =     "Almost all scientific visualization involving surfaces
+                 is currently do ne via triangles. The speed at which
+                 such triangulated surfaces can be displayed is crucial
+                 to interactive visualization and is bounded by the rate
+                 at which triangulated data can be sent to the graphics
+                 subsystem for rendering. Partitioning polygonal models
+                 into triangle strips can significantly reduce rendering
+                 times over transmitting each triangle individually. In
+                 this paper, we present new and efficient algorithms for
+                 constructing triangle strips from partially
+                 triangulated models, and experimental results showing
+                 these strips are 10--30\% better than those from
+                 previous codes. Further, we study the impact of larger
+                 buffer sizes and various queuing disciplines on the
+                 effectiveness of triangle strips.",
+  organization = "IEEE",
+  editor =       "Roni Yagel and Gregory M. Nielson",
+  booktitle =    "IEEE Visualization '96",
+}
+
+
+@TechReport{ESV_triangle96,
+  author = 	 {F. Evans and S. Skiena and A. Varshney},
+  title = 	 {Completing sequential triangulations is hard},
+  institution =  {Dept. of Computer Science, State University of New York at Stony Brook},
+  year = 	 {1996},
+}
+
+
+
+@Article{Jones:1971:NAL,
+  author =       "C. B. Jones",
+  title =        "A New Approach to the `Hidden Line' Problem",
+  year =         "1971",
+  month =        aug,
+  journal =      "Computer Journal",
+  volume =       "14",
+  number =       "3",
+  pages =        "232--237",
+  keywords =     "hidden surface",
+}
+
+@InProceedings{Durand_CVPUEP2000,
+  author =       "Fr{\Ž{e}}do Durand and George Drettakis and Jo{\"e}lle
+                 Thollot and Claude Puech",
+  title =        "Conservative Visibility Preprocessing Using Extended
+                 Projections",
+  pages =        "239--248",
+  editor =       "Sheila Hoffmeyer",
+  booktitle =    "Proceedings of the Computer Graphics Conference 2000
+                 ({SIGGRAPH}-00)",
+  month =        jul # " ~23--28",
+  publisher =    "ACMPress",
+  address =      "New York",
+  year =         "2000",
+}
+
+
+@InProceedings{Hudson97,
+author =       "T. Hudson and D. Manocha and J. Cohen and M. Lin and K. Hoff and H. Zhang",
+title =        "Accelerated Occlusion Culling using Shadow Frusta",
+year =         "1997",
+booktitle =    "Proceedings of the Thirteenth ACM Symposium on
+                  Computational Geometry",
+ pages =        "1--10",
+ publisher =    "ACM Press"
+
+}
+
+
+
+@InProceedings{Greene:1996:HPT,
+author =       "Ned Greene",
+title =        "Hierarchical Polygon Tiling with Coverage Masks",
+pages =        "65--74",
+booktitle =    "Proceedings of SIGGRAPH '96",
+year =         "1996",
+month =        aug,
+abstract =     "We present a novel polygon tiling algorithm in which
+recursive subdivision of image space is driven by
+coverage masks that classify a convex
+polygon as
+inside, outside, or intersecting cells in an image
+hierarchy. This approach permits Warnock-style
+subdivision with its
+logarithmic search properties to
+be driven very efficiently by bit-mask operations. The
+resulting hierarchical polygon tiling algorithm
+performs subdivision and
+visibility computations very
+rapidly while only visiting cells in the image
+hierarchy that are crossed by visible
+edges in the
+output image. Visible samples are never overwritten. At
+512x512 resolution, the algorithm tiles as
+rapidly as
+traditional incremental scan conversion, and at high
+resolution (e.g. 4096x4096) it is much
+faster, making
+it well suited to antialiasing by oversampling and
+filtering. For densely occluded scenes, we combine
+hierarchical tiling with
+the {\"h}ierarchical
+visibility{\" }algorithm to enable hierarchical
+object-space culling. When we tested this combination
+on a densely occluded
+model, it computed visibility on
+a 4096x4096 grid as rapidly as hierarchical z-buffering
+tiled a 512x512 grid, and it effectively antialiased
+scenes containing
+hundreds of thousands of visible
+polygons. The algorithm requires strict front-to-back
+traversal of polygons, so we represent a
+scene as a BSP
+tree or as an octree of BSP trees. When maintaining
+depth order of polygons is not convenient,
+we combine
+hierarchical tiling with hierarchical z-buffering,
+resorting to z-buffering only in regions
+of the screen
+where the closest object is not encountered first.",
+}
+
+@InProceedings{thibault87a,
+author =       "William C. Thibault and Bruce F. Naylor",
+title =        "Set Operations on Polyhedra Using Binary Space
+Partitioning Trees",
+pages =        "153--162",
+booktitle =      "Proceedings of SIGGRAPH '87",
+volume =       "21",
+year =         "1987",
+month =        jul,
+keywords =     "polyhedra, set operations, geometric modeling,
+geometric search, point location",
+}
+
+
+
+
+
+@Article{Plantinga85,
+author =       "W. H. Plantinga and C. R. Dyer",
+title =        "An Algorithm for Constructing the Aspect Graph",
+journal =      "CS TR",
+volume =       "627",
+publisher =    "UNIV of Wisconsin --- Madison",
+month =        dec,
+year =         "1985",
+}
+
+@InProceedings{Crawford85,
+author =       "C. G. Crawford",
+title =        "Aspect Graphs and Robot Vision",
+year =         "1985",
+booktitle =    "Proceedings, {CVPR} '85 ({IEEE} Computer Society
+Conference on Computer Vision and Pattern Recognition,
+San Francisco, {CA},
+June 10--13, 1985)",
+publisher =    "IEEE",
+organization = "IEEE",
+series =       "IEEE Publ. 85CH2145-1.",
+institution =  "USNA",
+pages =        "382--384",
+keywords =     "IMAGE PART FORM, LARGE DIMENSIONALITY",
+}
+
+@Article{PLA90,
+author =       "H. Plantinga and C. Dyer",
+title =        "Visibility, Occlusion, and the Aspect Graph",
+journal =      "International Journal of Computer Vision",
+volume =       "5",
+number =       "2",
+year =         "1990",
+pages =        "137--160",
+}
+
+@InProceedings{FOCS86*123,
+author =       "W. H. Plantinga and C. R. Dyer",
+title =        "An Algorithm for Constructing the Aspect Graph",
+pages =        "123--131",
+booktitle =    "27th Annual Symposium on Foundations of Computer
+Science",
+ISBN =         "0-8186-0740-8",
+month =        oct,
+publisher =    "IEEE Computer Society Press",
+address =      "Los Angeles, Ca., USA",
+year =         "1986",
+}
+
+@InProceedings{egger92,
+title =        "The scale space aspect graph",
+author =       "D. W. Eggert and K. W.
+Bowyer and C. R. Dyer and H. I.
+Christensen and D. B. Goldgof",
+booktitle =    "Proceedings. 1992 IEEE Computer Society
+Conference on
+Computer Vision and Pattern Recognition (Cat.
+No.92CH3168-2)",
+pages =        "335--40",
+publisher =    "IEEE Comput. Soc.
+Press Los Alamitos, CA, USA",
+year =         "1992",
+organization = "IEEE",
+}
+
+@Article{EggertDavi1993a,
+author =       "David W. Eggert and Kevin W. Bowyer and Charles R.
+Dyer and Henrik I. Christensen and Dmitry B. Goldgof",
+journal =      "Pattern Analysis and Machine Intelligence",
+title =        "The Scale Space Aspect Graph",
+year =         "1993",
+document-size = "359.5 kbytes",
+url =
+"ftp://ftp.cs.wisc.edu/computer-vision/pami93-eggert.ps.Z",
+month =        nov,
+number =       "11",
+pages =        "1114--1130",
+volume =       "15",
+scope =        "model",
+}
+
+@TechReport{MIT-LCS//MIT/LCS/TR-612,
+author =       "S. Teng",
+title =        "Combinational Aspects of Geometric Graphs",
+institution =  "Massachusetts Institute of Technology,
+Laboratory for
+Computer Science",
+type =         "Technical Report",
+number =       "MIT-LCS//MIT/LCS/TR-612",
+pages =        "13",
+month =        may,
+year =         "1994",
+abstract =     "As a special case of our main
+result, we show that for
+all L$>$0, each k-nearest neighborhood graph in d
+dimensions excludes Kh as a depth in L
+minor if h=W
+(Ld-1). More generally, we prove that the overlap
+graphs defined by Miller, Teng, Thurston
+and Vavais
+[18] have this combinatorial property. By a
+construction of Plotkin, Rao and Smith
+[23], our result
+implies that overlap graphs have {"}good{"} cut-covers,
+answering an open question of Kaklamanis,
+Krizanc and
+Rao [12]. Consequently, overlap graphs can be emulated
+on hypercube graphs with a constant factor
+of slow down
+and on butterfly graphs with a factor of O(log*n) slow
+down. Therefore, computations on overlap
+graphs, such
+as finite-element and finite-difference methods on
+{"}well-conditioned{"} meshes and image
+processing on
+k- nearest neighborhood graphs, can be performed on
+hypercubic parallel machines with linear
+speed-up. Our
+result, in conjunction with a result of Plotkin, Rao
+and Smith, also yields a combinatorial
+proof to that
+overlap graphs have separators of sublinear size. We
+also show that with high probability, the Delaunay
+diagram, the relative
+neighborhood graph and the
+k-nearest neighborhood graph of a random point set
+exclude Kh as a depth L minor if h=W(L d/2
+log n).",
+note =         "Cost is \$12.",
+}
+
+@InProceedings{Sojka:1995:AGT,
+author =       "E. Sojka",
+title =        "Aspect Graphs of Three Dimensional Scenes",
+booktitle =    "Winter School of Computer Graphics 1995",
+year =         "1995",
+month =        feb,
+note =         "held at University of West Bohemia, Plzen, Czech
+Republic, 14-18 February 1995",
+}
+
+
+
+@Book{Heckbert94-GGF,
+  editor =       "Paul Heckbert",
+  year =         "1994",
+  title =        "Graphics {Gems} {IV}",
+  publisher =    "Academic Press Professional",
+  address =      "Boston, MA",
+  keywords =     "Delaunay triangulation, finite elements, meshing,
+                 pixel luminance scaling",
+  comments =     "includes useful C and C++ code related to radiosity
+                 algorithms (Delaunay triangulation and pixel luminance
+                 scaling)",
+}
+
+
+@InCollection{Greene:1994:DIR,
+  author =       "Ned Greene",
+  booktitle =    "Graphics Gems IV",
+  title =        "Detecting Intersection of a Rectangular Solid and a
+                 Convex Polyhedron",
+  publisher =    "Academic Press",
+  address =      "Boston",
+  pages =        "74--82",
+  year =         "1994",
+  keywords =     "collision detection, octree, computational geometry",
+  summary =      "Presents an optimized technique to test for
+                 intersection between a convex polyhedron and a box.
+                 This is useful when comparing bounding boxes against a
+                 viewing frustum in a rendering program, for instance.
+                 Contains pseudocode.",
+}
+
+@InProceedings{Chen:1996:FPA,
+  author =       "{Han-Ming} Chen and {Wen-Teng} Wang",
+  title =        "The Feudal Priority Algorithm on Hidden-Surface
+                 Removal",
+  pages =        "55--64",
+  booktitle =    "Proceedings of SIGGRAPH '96",
+  year =         "1996",
+  month =        aug,
+  abstract =     "Development of a real-time shaded rendering approach
+                 for a frequently changing viewpoint or view vector is
+                 very important in the simulation of 3-D objects in
+                 Computer-Aided Design. A new approach is proposed in
+                 this paper to meet this demand in a very efficient
+                 manner. A pre-processing phase, in which a feudal
+                 priority tree is established for all polygons of an
+                 object, and a post-processing phase, in which a
+                 rendering priority list is searched for from the feudal
+                 priority tree for a new viewpoint or view vector, are
+                 included in our approach. The most time-consuming work
+                 is finished in the pre-processing phase which only has
+                 to be executed once for an object, and the relatively
+                 simple task is left to the post-processing phase, which
+                 is repeated when the viewpoint or view vector is
+                 changed. For the pre-processing phase, a static version
+                 and a dynamic version are proposed in this paper. The
+                 one-way priority relations of all polygons are computed
+                 in the former part of the dynamic pre-processing in a
+                 more efficient way than that in the static
+                 pre-processing, but the latter part of the dynamic
+                 pre-processing is still based on the static
+                 pre-processing. A new concept of {\"a}bsolute
+                 priority{\" }is introduced to systematically reduce the
+                 polygons in which a separating plane is to be searched
+                 for so the probability of finding the separating plane
+                 is much increased. This is the basis to implement
+                 another important concept of {\"s}eparating before
+                 splitting{\" }by which the polygon splittings are much
+                 reduced. Hence the efficiency in the pre-processing and
+                 the post-processing phases is highly increased.",
+}
+
+
+
+
+
+
+@InProceedings{Zhang97,
+  title =        "Visibility Culling Using Hierarchical Occlusion Maps",
+  language =     "en",
+  month =        aug,
+  editor =       "Turner Whitted",
+  series =       "Annual Conference Series",
+  booktitle =    "SIGGRAPH 97 Conference Proceedings",
+  publisher =    "Addison Wesley",
+  pages =        "77--88",
+  year =         "1997",
+  url =          "http://visinfo.zib.de/EVlib/Show?EVL-1997-147",
+  author =       "Hansong Zhang and Dinesh Manocha and Thomas Hudson and
+                 Kenneth E. {Hoff III}",
+  abstract =     "We present hierarchical occlusion maps (HOM) for
+                 visibility culling on complex models with high depth
+                 complexity. The culling algorithm uses an object space
+                 bounding volume hierarchy and a hierarchy of image
+                 space occlusion maps. Occlusion maps represent the
+                 aggregate of projections of the occluders onto the
+                 image plane. For each frame, the algorithm selects a
+                 small set of objects from the model as occluders and
+                 renders them to form an initial occlusion map, from
+                 which a hierarchy of occlusion maps is built. The
+                 occlusion maps are used to cull away a portion of the
+                 model not visible from the current viewpoint. The
+                 algorithm is applicable to all models and makes no
+                 assumptions about the size, shape, or type of
+                 occluders. It supports approximate culling in which
+                 small holes in or among occluders can be ignored. The
+                 algorithm has been implemented on current graphics
+                 systems and has been applied to large models composed
+                 of hundreds of thousands of polygons. In practice, it
+                 achieves significant speedup in interactive
+                 walkthroughs of models with high depth complexity.",
+  organization = "ACM SIGGRAPH",
+  note =         "ISBN 0-89791-896-7",
+  keywords =     "visibility culling, interactive display, image
+                 pyramid, occlusion culling, hierarchical data
+                 structures",
+}
+
+
+@PhdThesis{Durand99-phd,
+  author =       "Fr{\'{e}}do Durand",
+  month =        jul,
+  year =         "1999",
+  title =        "3{D} Visibility: Analytical Study and Applications",
+  address =      "Grenoble, France",
+  school =       "Universite Joseph Fourier",
+}
+
+
+@InProceedings{EVL-2000-60,
+  pages =        "239--248",
+  year =         "2000",
+  title =        "Conservative Visibility Preprocessing Using Extended
+                 Projections",
+  url =          "http://visinfo.zib.de/EVlib/Show?EVL-2000-60",
+  author =       "Fr{\'{e}}do Durand and George Drettakis and
+                 Jo{\"{e}}lle Thollot and Claude Puech",
+  abstract =     "Visualization of very complex scenes can be
+                 significantly accelerated using occlusion culling. In
+                 this paper we present a visibility preprocessing method
+                 which efficiently computes potentially visible geometry
+                 for volumetric viewing cells. We introduce novel
+                 extended projection operators, which permits efficient
+                 and conservative occlusion culling with respect to all
+                 viewpoints within a cell, and takes into account the
+                 combined occlusion effect of multiple occluders. We use
+                 extended projection of occluders onto a set of
+                 projection planes to create extended occlusion maps; we
+                 show how to efficiently test occludees against these
+                 occlusion maps to determine occlusion with respect to
+                 the entire cell. We also present an improved projection
+                 operator for certain specific but important
+                 configurations. An important advantage of our approach
+                 is that we can re-project extended projections onto a
+                 series of projection planes (via an occlusion sweep),
+                 and accumulate occlusion information from multiple
+                 blockers. This new approach allows the creation of
+                 effective occlusion maps for previously hard-to-treat
+                 scenes such as leaves of trees in a forest. Graphics
+                 hardware is used to accelerate both the extended
+                 projection and reprojection operations. We present a
+                 complete implementation demonstrating significant
+                 speedup with respect to view-frustum culling only,
+                 without the computational overhead of on-line occlusion
+                 culling",
+  keywords =     "Occlusion culling, visibility determination, PVS",
+  booktitle =    "Computer Graphics (Proceedings of SIGGRAPH 2000)",
+}
+
+@InProceedings{scg97*421,
+  author =       "S. Rivi{\`e}re",
+  title =        "Dynamic visibility in polygonal scenes with the
+                 visibility complex",
+  pages =        "421--423",
+  ISBN =         "0-89791-878-9",
+  booktitle =    "Proceedings of the 13th International Annual Symposium
+                 on Computational Geometry ({SCG}-97)",
+  month =        jun # "~4--6",
+  publisher =    "ACM Press",
+  address =      "New York",
+  year =         "1997",
+}
+
+@InProceedings{SWAT::Vegter1990,
+  title =        "The Visibility Diagram: a Data Structure for
+                 Visibility Problems and Motion Planning",
+  author =       "Gert Vegter",
+  booktitle =    "{SWAT} 90, 2nd Scandinavian Workshop on Algorithm
+                 Theory",
+  year =         "1990",
+  series =       "Lecture Notes in Computer Science",
+  volume =       "447",
+  publisher =    "Springer",
+  pages =        "97--110",
+}
+
+@Article{Welzl:1985:CVG,
+  author =       "Emo Welzl",
+  title =        "Constructing the Visibility Graph for $n$-Line
+                 Segments in ${O}(n^2)$ Time",
+  journal =      "Information Processing Letters",
+  volume =       "20",
+  number =       "4",
+  pages =        "167--171",
+  day =          "10",
+  month =        may,
+  year =         "1985",
+  coden =        "IFPLAT",
+  ISSN =         "0020-0190",
+  mrclass =      "68U05",
+  mrnumber =     "86m:68135",
+  bibdate =      "Wed Nov 11 12:16:26 MST 1998",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Leiden State Univ, Inst of Applied Mathematics \&
+                 Computer Science, Leiden, Neth",
+  affiliationaddress = "Leiden State Univ, Inst of Applied Mathematics
+                 \& Computer Science, Leiden, Neth",
+  classification = "723; 921; C1160 (Combinatorial mathematics); C4190
+                 (Other numerical methods)",
+  corpsource =   "Inst. for Inf. Proc., Tech. Univ. of Graz, Austria",
+  journalabr =   "Inf Process Lett",
+  keywords =     "computational geometry; computer programming ---
+                 Algorithms; Graph Theory; graph theory; line segments;
+                 mathematical techniques; n-line segments;
+                 nontransparent obstacles; O(n/sup 2/) time; shortest
+                 path; undirected graph; visibility graph",
+  pubcountry =   "Netherlands A01",
+  treatment =    "T Theoretical or Mathematical",
+}
+
+@InProceedings{EVL-2000-59,
+  pages =        "229--238",
+  year =         "2000",
+  title =        "Conservative Volumetric Visibility with Occluder
+                 Fusion",
+  author =       "Gernot Schaufler and Julie Dorsey and Xavier Decoret
+                 and Fran{\c{c}}ois X. Sillion",
+  url =          "http://visinfo.zib.de/EVlib/Show?EVL-2000-59",
+  abstract =     "Visibility determination is a key requirement in a
+                 wide range of graphics algorithms. This paper
+                 introduces a new approach to the computation of volume
+                 visibility, the detection of occluded portions of space
+                 as seen from a given region. The method is conservative
+                 and classifies regions as occluded only when they are
+                 guaranteed to be invisible. It operates on a discrete
+                 representation of space and uses the opaque interior of
+                 objects as occluders. This choice of occluders
+                 facilitates their extension into adjacent opaque
+                 regions of space, in essence maximizing their size and
+                 impact. Our method efficiently detects and represents
+                 the regions of space hidden by such occluders. It is
+                 the first one to use the property that occluders can
+                 also be extended into empty space provided this space
+                 is itself occluded from the viewing volume. This proves
+                 extremely effective for computing the occlusion by a
+                 set of occluders, effectively realizing occluder
+                 fusion. An auxiliary data structure represents
+                 occlusion in the scene and can then be queried to
+                 answer volume visibility questions. We demonstrate the
+                 applicability to visibility preprocessing for real-time
+                 walkthroughs and to shadow-ray acceleration for
+                 extended light sources in ray tracing, with significant
+                 acceleration in both cases.",
+  booktitle =    "Computer Graphics (Proceedings of SIGGRAPH 2000)",
+}
+
+@Book{Stolfi:1991:OPG,
+  author =       "J. Stolfi",
+  title =        "Oriented Projective Geometry: {A} Framework for
+                 Geometric Computations",
+  publisher =    "Academic Press",
+  year =         "1991",
+}
+
+
+@InProceedings{wonka00,
+  pages =        "71--82",
+  year =         "2000",
+  title =        "Visibility Preprocessing with Occluder Fusion for Urban
+Walkthroughs",
+  author =       "Peter Wonka and Michael Wimmer and Dieter Schmalstieg",
+  booktitle =    "Proceedings of EUROGRAPHICS Workshop on Rendering",
+}
+
+
+@InProceedings{koltun00,
+  year =         "2000",
+  title =        "Virtual Occluders:
+An Efficient Intermediate PVS Representation",
+  author =       "Vladlen Koltun and Yiorgos Chrysanthou and Daniel Cohen-Or",
+  booktitle =    "Proceedings of EUROGRAPHICS Workshop on Rendering",
+}
+
+
+@Article{Cho:1999:IRT,
+  author =       "Franklin S. Cho and David Forsyth",
+  title =        "Interactive ray tracing with the visibility complex",
+  journal =      "Computers and Graphics",
+  volume =       "23",
+  number =       "5",
+  pages =        "703--717",
+  month =        oct,
+  year =         "1999",
+  coden =        "COGRD2",
+  ISSN =         "0097-8493",
+  bibdate =      "Sat Oct 21 14:27:20 MDT 2000",
+  url =          "http://www.elsevier.nl/gej-ng/10/13/20/24/34/34/abstract.html;  http://www.elsevier.nl/gej-ng/10/13/20/24/32/34/article.pdf",
+  acknowledgement = ack-nhfb,
+}
+
+
+@InProceedings{koltun01,
+  year =         "2001",
+  title =        "Hardware-Accelerated From-Region Visibility Using a Dual Ray Space",
+  author =       "Vladlen Koltun and Yiorgos Chrysanthou and Daniel Cohen-Or",
+  booktitle =    "Proceedings of the 12th EUROGRAPHICS Workshop on Rendering",
+}
Index: trunk/VUT/doc/SciReport/Bib/want.bib
===================================================================
--- trunk/VUT/doc/SciReport/Bib/want.bib	(revision 243)
+++ trunk/VUT/doc/SciReport/Bib/want.bib	(revision 243)
@@ -0,0 +1,2200 @@
+@article{bb9633,
+        AUTHOR = "Upstill, S.",
+        TITLE = "The Renderman Companion, Addison-Wesley, Reading",
+        JOURNAL = "MA",
+        VOLUME = "89",
+        YEAR = "1989",
+        PAGES = "1989"
+}
+
+@inproceedings{BerDobEpp-SODA-90,
+  title = {{Visibility with a moving point of view}},
+  author = {Marshall W. Bern and David P. Dobkin and David Eppstein and Robert L. Grossman},
+  booktitle = {Proc. 1st Symp. Discrete Algorithms},
+  publisher = {Assoc. Comput. Mach. and Soc. Industrial {\&} Applied Mathematics},
+  pages = {107--118},
+  month = {January},
+  year = {1990}
+}
+
+@article{BerDobEpp-Algo-94,
+  title = {{Visibility with a moving point of view}},
+  author = {Marshall W. Bern and David P. Dobkin and David Eppstein and Robert L. Grossman},
+  journal = {Algorithmica},
+  volume = {11},
+  number = {4},
+  pages = {360--378},
+  month = {April},
+  year = {1994},
+  review = {MR-94j:68307}
+}
+
+@article{MR-94j:68307,
+  author = {Marshall W. Bern and David P. Dobkin and David Eppstein and Robert L. Grossman},
+  reviews = {BerDobEpp-Algo-94},
+  journal = {Mathematical Reviews},
+  publisher = {Amer. Math. Soc.},
+  title = {{Visibility with a moving point of view}},
+  number = {94j:68307},
+  year = {1994}
+}
+
+@article{ma4,
+  author="J. Matousek",
+  title="Efficient partition trees",
+  journal="Discrete and Computational Geometry",
+  year="1992",
+  volume="8",
+  number="",
+  pages="315-334"
+}
+
+@inproceedings{ma92acm,
+  author="J. Matousek",
+  title="Range searching with efficient hierarchical cuttings",
+  booktitle="$8^{th}$ ACM Conf. in Comp. Geom.",
+  address="Berlin",
+  year="1992",
+  pages="276-285"
+}
+
+@article
+ {ma1,
+  author="J. Matousek",
+  title="Range searching with efficient hierarchical cuttings",
+  journal="Discrete and Computational Geometry",
+  year="1993",
+  volume="10",
+  number="",
+  pages="157-182"
+}
+
+@Article{Matousek95,
+title={Approximations and Optimal Geometric Divide-and-Conquer},
+author={Ji{\v{r}}{\'\i} Matou{\v{s}}ek},
+pages={203--208},
+journal=jcss,
+year=1995,
+month=apr,
+volume=50,
+number=2,
+preliminary={STOC::Matousek1991}
+}
+
+@Article{Adelson:1995:GER,
+  author =       "Stephen J. Adelson and Larry F. Hodges",
+  title =        "Generating Exact Ray-Traced Animation Frames by
+                 Reprojection",
+  journal =      "j-IEEE-CGA",
+  volume =       "15",
+  number =       "3",
+  pages =        "43--52",
+  month =        may,
+  year =         "1995",
+  CODEN =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
+  bibsource =    "Compendex database",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Comput. Res. and Applications, Los Alamos Nat. Lab.,
+                 NM, USA",
+  classification = "723; 723.5; 741.1; 742.2",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "Algorithms; Animation; Animation frames; Cameras;
+                 Color; Color image processing; Computer graphics;
+                 Interactive animation; Light sources; Ray tracing;
+                 Reprojection; Spatiotemporal coherence; Three
+                 dimensional; Visualization; Volume visualization",
+}
+
+Article{Dias:1994:RTI,
+  author =       "Maria Lurdes Dias",
+  title =        "Ray tracing interference color: visualizing {Newton}'s
+                 rings",
+  journal =      "j-IEEE-CGA",
+  volume =       "14",
+  number =       "3",
+  pages =        "17--20",
+  month =        may,
+  year =         "1994",
+  CODEN =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
+  bibsource =    "Compendex database",
+  abstract =     "Generalized Fresnel's reflectance formulas provide the
+                 basis for this ray tracing method, which simulates the
+                 natural phenomenon of interference color. A
+                 visualization of Newton's rings demonstrates its
+                 accuracy.",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Dept. de Fisica, Coimbra Univ., Portugal",
+  classification = "723.2; 723.5; 741.1; 921.6; 931.2",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "Algorithms; Color; Color computer graphics; Color
+                 image processing; Computer simulation; Computer vision;
+                 Fresnel's reflectance formula; Interference color;
+                 Light reflection; Mathematical models; Newton's ring;
+                 Polarization; Ray tracing; Reflectance model;
+                 Refractive angle; Refractive index; Thick films; Thin
+                 films; Visualization",
+}
+
+@Article{Meinzer:1991:HRT,
+  author =       "Hans-Peter Meinzer and Kirsten Meetz and Dinu
+                 Scheppelmann and Uwe Engelmann and Hans Jurgen Baur",
+  title =        "The {Heidelberg} Ray Tracing Model",
+  journal =      "j-IEEE-CGA",
+  volume =       "11",
+  number =       "6",
+  pages =        "34--43",
+  month =        nov,
+  year =         "1991",
+  CODEN =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibsource =    "Graphics/siggraph/91.bib",
+  keywords =     "volume rendering",
+}
+
+@Article{Dias:1991:RTI,
+  author =       "Maria Lurdes Dias",
+  title =        "Ray Tracing Interference Color",
+  journal =      "j-IEEE-CGA",
+  volume =       "11",
+  number =       "2",
+  pages =        "54--60",
+  month =        mar,
+  year =         "1991",
+  CODEN =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Wed Jan 29 06:15:39 1997",
+  bibsource =    "Graphics/siggraph/91.bib, Compendex database",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Phys Dept, Univ of Coimbra, Portugal",
+  classification = "723; 741",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "Color; Computer Graphics; Constructive Interference;
+                 Destructive Interference; External Reflection; Light
+                 --- Interference; Optical Thickness; Ray Tracing
+                 Interference Color; shading; Thin Film Reflectance",
+}
+
+@Article{Woodwark:1991:RHC,
+  author =       "John Woodwark",
+  title =        "Reconstructing history with computer graphics",
+  journal =      "j-IEEE-CGA",
+  volume =       "11",
+  number =       "1",
+  pages =        "18--20",
+  month =        jan,
+  year =         "1991",
+  CODEN =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
+  bibsource =    "Graphics/siggraph/91.bib, Compendex database",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Information Geometers, Winchester, UK",
+  annote =       "Corrections on some statements done in haggerty90d
+                 IEEE CGA July 90.",
+  classification = "402; 723; 901",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "Applications; Archeology; Architecture --- History;
+                 architecture, archaeology; Churches --- Design;
+                 Computer Graphics; Computer Programming --- Algorithms;
+                 Computer Simulation; Divided Object Space Ray Casting
+                 Algorithm (DORA); Models; Ray Casters; Resistivity
+                 Results; Roman Baths; Roman Temples",
+}
+
+@Article{Mastin:1987:FSO,
+  author =       "Gary A. Mastin and Peter A. Watterberg and John F.
+                 Mareda",
+  title =        "{Fourier} Synthesis of Ocean Scenes",
+  journal =      "j-IEEE-CGA",
+  volume =       "7",
+  number =       "3",
+  pages =        "16--23",
+  month =        mar,
+  year =         "1987",
+  CODEN =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
+  bibsource =    "Compendex database, Graphics/siggraph/87.bib",
+  acknowledgement = ack-nhfb,
+  affiliationaddress = "Sandia Natl Lab, Albuquerque, NM, USA",
+  classification = "471; 723; 921",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "Computer Applications; computer graphics; computer
+                 programming --- Algorithms; mathematical
+                 transformations --- Fourier Transforms; model natural
+                 wave; oceanography; ray tracing; signal filtering and
+                 prediction; white-noise images",
+}
+
+@Article{Amanatides:1987:RCG,
+  author =       "John Amanatides",
+  title =        "Realism in Computer Graphics: a Survey",
+  journal =      "j-IEEE-CGA",
+  volume =       "7",
+  number =       "1",
+  pages =        "44--56",
+  month =        jan,
+  year =         "1987",
+  CODEN =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
+  bibsource =    "Compendex database, Graphics/siggraph/87.bib",
+  acknowledgement = ack-nhfb,
+  affiliationaddress = "Univ of Toronto, Ont, Can",
+  annote =       "This article surveys most of the major issues to be
+                 dealt with when generating realistic images, and covers
+                 papers up to December 1985. It begins with an overview
+                 of the rendering process and a quick review of visible
+                 surface-determination algorithms. Then, in more detail,
+                 it discusses shading, antialiasing, texture mapping,
+                 shadows, and optical effects and closes with a
+                 discussion of modeling primitives.",
+  classification = "723; 741; 921",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "computer graphics; general survey, bibliography,
+                 tutorial; image processing --- Synthesis; mathematical
+                 techniques --- Algorithms; pixel boundary; ray tracing
+                 geometry; Reviews; sampling; shading geometry; signal
+                 filtering and prediction; texture mapping; visibility
+                 --- Mathematical Models; visibility algorithms",
+}
+
+@Article{Greene:1986:EMO,
+  author =       "Ned Greene",
+  title =        "Environment Mapping and Other Applications of World
+                 Projection",
+  journal =      "j-IEEE-CGA",
+  volume =       "6",
+  number =       "11",
+  pages =        "21--29",
+  month =        nov,
+  year =         "1986",
+  CODEN =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
+  bibsource =    "Compendex database",
+  acknowledgement = ack-nhfb,
+  affiliationaddress = "New York Inst of Technology, Old Westbury, NY,
+                 USA",
+  classification = "723; 741",
+  conference =   "Graphics Interface 86",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "computer graphics; diffuse surface illumination;
+                 imaging techniques; optics; ray tracing; specular
+                 surface illumination; texture filtering; world
+                 projections",
+  meetingaddress = "Vancouver, BC, Can",
+  meetingdate =  "1986",
+  meetingdate2 = "86",
+}
+
+@Article{Steinberg:1984:SSB,
+  author =       "Herbert A. Steinberg",
+  title =        "A Smooth Surface Based on Biquadratic Patches",
+  journal =      "j-IEEE-CGA",
+  volume =       "4",
+  number =       "9",
+  pages =        "20--23",
+  month =        sep,
+  year =         "1984",
+  CODEN =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
+  bibsource =    "Compendex database",
+  acknowledgement = ack-nhfb,
+  classification = "723",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "biquadratic patches; computer graphics; I35
+                 biquadratic patches and I37 ray-tracing",
+}
+
+@Article{Coquillart:1984:SDD,
+  author =       "Sabine Coquillart and Michel Gangnet",
+  title =        "Shaded Display of Digital Maps",
+  journal =      "j-IEEE-CGA",
+  volume =       "4",
+  number =       "7",
+  pages =        "35--42",
+  month =        jul,
+  year =         "1984",
+  CODEN =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
+  bibsource =    "Compendex database, Graphics/siggraph/84.bib",
+  acknowledgement = ack-nhfb,
+  annote =       "Several methods for displaying height fields are
+                 presented. Bilinear interpolation of patches is used to
+                 define the surface. Efficient algorithms, and quite
+                 elegant. Reminiscent of Kajiya's cut planes for
+                 surfaces of revolution.",
+  classification = "405; 723; 741",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "computer graphics --- Applications; digital maps; maps
+                 and mapping; maps, terrain, ray tracing, priority list,
+                 I37 Ray Tracing, I37 Shading, I3m Cartography; priority
+                 lists; ray-tracing techniques; shaded images of
+                 terrain",
+}
+
+@MASTERSTHESIS{ Westin-Thesis,
+    AUTHOR    = "Stephen H. Westin",
+    TITLE     = "Predicting Reflectance Functions from Complex Surfaces",
+    SCHOOL    = "Cornell University",
+    MONTH     = Aug,
+    YEAR      = 1992
+}
+
+@InProceedings{westin92a,
+  author =       "Stephen H. Westin and James R. Arvo and Kenneth E.
+                 Torrance",
+  title =        "Predicting reflectance functions from complex
+                 surfaces",
+  pages =        "255--264",
+  booktitle =      "Computer Graphics (SIGGRAPH '92 Proceedings)",
+  volume =       "26",
+  number =       "2",
+  year =         "1992",
+  month =        jul,
+  editor =       "Edwin E. Catmull",
+  conference =   "held in Chicago, Illinois; 26-31 July 1992",
+  keywords =     "spherical harmonics, monte carlo, anisotropic
+                 reflection, brdf",
+}
+
+@InProceedings{sillion91b,
+  author =       "Francois X. Sillion and James R. Arvo and Stephen H.
+                 Westin and Donald P. Greenberg",
+  title =        "A global illumination solution for general reflectance
+                 distributions",
+  pages =        "187--196",
+  booktitle =      "Computer Graphics (SIGGRAPH '91 Proceedings)",
+  volume =       "25",
+  number =       "4",
+  year =         "1991",
+  month =        jul,
+  editor =       "Thomas W. Sederberg",
+  conference =   "held in Las Vegas, Nevada; 28 July - 2 August 1991",
+  keywords =     "global illumination, brdf, specular reflection,
+                 directional-diffuse, progressive radiosity, spherical
+                 harmonics",
+  annote =       "A general light transfer simulation algorithm for
+                 environments composed of materials with arbitrary
+                 reflectance functions is presented. This algorithm
+                 removes the previous practical restriction to ideal
+                 specular and/or ideal diffuse environments, and
+                 supports complex physically based reflectance
+                 distributions. This is accomplished by extending
+                 previous two-pass ray-casting radiosity approaches to
+                 handle non-uniform intensity distributions, and
+                 resolving all possible energy transfers between sample
+                 points. An implementation is described based on a
+                 spherical harmonic decomposition for encoding both
+                 bidirectional reflectance distribution functions for
+                 materials, and directional intensity distributions for
+                 illuminated surfaces. The method compares favorably
+                 with experimental measurements.",
+}
+
+@Article{Poulin:1991:SSL,
+  author =       "Pierre Poulin and John Amanatides",
+  title =        "Shading and shadowing with linear light sources",
+  journal =      "Computers and Graphics",
+  volume =       "15",
+  number =       "2",
+  pages =        "259--265",
+  year =         "1991",
+  coden =        "COGRD2",
+  ISSN =         "0097-8493",
+  bibdate =      "Wed Feb 5 07:22:58 MST 1997",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Univ of British Columbia",
+  affiliationaddress = "Vancouver, BC, Can",
+  annote =       "Eurographics '90 award paper.",
+  classification = "723; 741; 921",
+  journalabr =   "Comput Graphics (Pergamon)",
+  keywords =     "Computer Graphics --- Three Dimensional Graphics;
+                 Graphic Methods --- Research; Lambert's Laws; Light
+                 Sources; Linear Light Source Shading And Shadowing;
+                 Mathematical Techniques --- Chebyshev Approximation;
+                 Models; Shadowing Algorithms",
+}
+
+@TECHREPORT{ Novins92b,
+    AUTHOR      = "Kevin Novins and James Arvo and David Salesin",
+    TITLE       = "Adaptive Error Bracketing for Controlled-Precision Volume Rendering",
+    INSTITUTION = "Department of Computer Science, Cornell University",
+    NUMBER      = "92-1312",
+    MONTH       = Nov,
+    YEAR        = 1992
+}
+
+@INPROCEEDINGS{ Mitchell90,
+    AUTHOR    = "Don P. Mitchell",
+    TITLE     = "Robust Ray Intersection with Interval Arithmetic",
+    BOOKTITLE = "Proceedings of Graphics Interface '90",
+    YEAR      = 1990,
+    PAGES     = "68--74"
+}
+
+
+@ARTICLE{Gigus90,
+    AUTHOR    = "Ziv Gigus and Jitendra Malik",
+    TITLE     = "Computing the aspect graph for line drawings of polyhedral objects",
+    JOURNAL   = "IEEE Transactions on Pattern Analysis and Machine Intelligence",
+    VOLUME    = 12,
+    NUMBER    = 2,
+    MONTH     = Feb,
+    YEAR      = 1990,
+    PAGES     = "113--122"
+}
+
+@Article{Sung:1992:ASB,
+  author =       "K. Sung",
+  title =        "Area sampling buffer: tracing rays with {Z}-buffer
+                 hardware",
+  journal =      "Com{\-}pu{\-}ter Graphics Forum",
+  volume =       "11",
+  number =       "3",
+  pages =        "C299--C310, C480--C481",
+  month =        "????",
+  year =         "1992",
+  coden =        "CGFODY",
+  ISSN =         "0167-7055",
+  bibdate =      "Mon Apr 14 10:23:20 MDT 1997",
+  acknowledgement = ack-nhfb,
+  classification = "C6130B (Graphics techniques)",
+  conflocation = "Cambridge, UK; 7-11 Sept. 1992",
+  conftitle =    "European Association for Computer Graphics 13th Annual
+                 Conference. EUROGRAPHICS 92",
+  corpsource =   "Dept. of Comput. Sci., Illinois Univ., Urbana, IL,
+                 USA",
+  keywords =     "area sampling; Area sampling; area sampling; buffer
+                 storage; computer graphics; Frame-buffer systems;
+                 frame-buffer systems; geometrical optics;
+                 hardware-assisted ray; Hardware-assisted ray tracing;
+                 image synthesis processes; Image synthesis processes;
+                 image synthesis processes; Light source area; light
+                 source area; Ray tracing; ray tracing; renderer;
+                 Renderer; Sampling area; sampling area; storage
+                 management; tracing; Z-buffer hardware",
+  thesaurus =    "Buffer storage; Computer graphics; Geometrical optics;
+                 Storage management",
+  treatment =    "P Practical",
+}
+
+@PhdThesis{spackman90a,
+  author =       "John Spackman",
+  title =        "Scene Decompositions for Accelerated Ray Tracing",
+  year =         "1990",
+  type =         "Ph.D. Thesis",
+  school =       "University of Bath, UK",
+  annote =       "Available as Bath Computer Science Technical Report
+                 90/33. \\ Ray tracing has come to the fore in the
+                 computer synthesis of realistic images over the last
+                 decade. This algorithm synthesises a particularly high
+                 degree of realism in both the shading and shape of
+                 surfaces. Surface shading calculations incorporate not
+                 only local diffuse and specular radiance but also
+                 global shadowing, multiple reflection and refraction of
+                 view and light attenuation, all according to the laws
+                 of optical physics. Complex object shapes may be
+                 modelled as boolean constructs from exact
+                 specifications of many common geometries. A wide range
+                 of objects may be modelled exactly without resorting to
+                 polyhedral approximation. \\ Early implementations of
+                 ray tracing synthesised some of the most realistic
+                 images up to that date, but imposed an extremely high
+                 computational load for complex scenes. Synthesis times
+                 proved to be linear in object count, and projected
+                 times for scenes of a few thousand objects extended
+                 into months on popular mini-computers. This prevented
+                 the wide-spread application of ray tracing on
+                 non-specialised hardware. Various methods have been
+                 proposed over the last few years to improve the
+                 efficiency of ray tracing for more viable synthesis
+                 times. \\ This thesis addresses scene decompositions
+                 for the acceleration of ray traced image synthesis. The
+                 decomposition of a globally complicated scene into
+                 simpler local regions is shown to reduce the
+                 computational load imposed by ray tracing. Algorithms
+                 are presented for the construction and use of various
+                 types of scene decomposition. Their relative merits are
+                 compared and the ``octtree'' decomposition is shown to
+                 be particularly suitable for accelerating the synthesis
+                 of complex scenes.",
+}
+
+Article{Spackman:1991:SNR,
+  author =       "John Spackman and Philip Willis",
+  title =        "The {SMART} Navigation of a Ray Through an Oct-Tree",
+  journal =      "Computers and Graphics",
+  volume =       "15",
+  number =       "2",
+  pages =        "185--194",
+  year =         "1991",
+  coden =        "COGRD2",
+  ISSN =         "0097-8493",
+  bibdate =      "Wed Feb 5 07:22:58 MST 1997",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Univ of Bath",
+  affiliationaddress = "Avon, Engl",
+  classification = "723; 921",
+  journalabr =   "Comput Graphics (Pergamon)",
+  keywords =     "Computer Graphics; Computer Image Synthesis; Data
+                 Processing --- Data Structures; Digital Differential
+                 Analyzers; Graphic Methods --- Research; Imaging
+                 Techniques --- Research; Mathematical Techniques ---
+                 Trees; Oct Tree Scene Decompositions; octree; Ray
+                 Traced Image Synthesis; Research; Spatial Measure For
+                 Accelerated Ray Tracing (smart); Spatial Object
+                 Coherence",
+}
+
+@InCollection{Skytta:1991:DDM,
+  author =       "Jorma Skytta and Tapio Takala",
+  title =        "A Distributed Data Model for Raytracing",
+  year =         "1991",
+  booktitle =    "Advances in Computer Graphics Hardware III",
+  editor =       "A. A. M. Kuijk",
+  publisher =    "Springer Verlag",
+  pages =        "19--26",
+  address =      "New York",
+  keywords =     "parallelism",
+}
+
+@InProceedings{morris89a,
+  author =       "D. T. Morris and P. M. Dew",
+  title =        "Dynamic Dataflow Algorithms for Ray Tracing {CSG}
+                 Objects",
+  pages =        "452--460",
+  booktitle =    "Parallel Processing for Computer Vision and Display",
+  year =         "1989",
+  editor =       "P. M. Dew and R. A. Earnshaw and T. R. Heywood",
+  publisher =    "Addison-Wesley",
+  annote =       "This paper describes how solid objects may be rendered
+                 by use of dynamic dataflow techniques. Particular
+                 emphasis is given to the ray-tracing algorithm. The
+                 objects are described by constructive solid geometry.
+                 The algorithms are designed to be executed on a
+                 processor farm coupled with a data-driven dataflow
+                 machine. Many of the limitations of previous
+                 approaches, such as the Kedem-Ellis ray-casting machine
+                 are overcome. For example, the size of the objects that
+                 can be drawn directly is increased, the shading
+                 computations are made more efficient and there is
+                 better hardware utilization.",
+}
+
+@Article{Ohta:1990:RBT,
+  author =       "Masataka Ohta and Mamoru Maekawa",
+  title =        "Ray-Bound Tracing for Perfect and Efficient
+                 Anti-Aliasing",
+  journal =      "The Visual Computer",
+  pages =        "125--133",
+  volume =       "6",
+  number =       "3",
+  month =        jun,
+  year =         "1990",
+  keywords =     "ray tracing, antialiasing, coherence, bound",
+  annote =       "A complete detection of whether aliasing occurs in a
+                 given pixel is possible by using the concept of bounded
+                 rays and ray-bound tracing. A coherent set of rays can
+                 be bounded by bounding both their origins (by a sphere)
+                 and directions (by a circle on a unit sphere). By
+                 tracing bounds of rays in a pixel, along the direction
+                 of reflection, refraction or to light sources, it is
+                 possible to obtain an upper bound on the degree of
+                 aliasing in the pixel. Ray bound tracing is possible
+                 against various shapes and with various shading
+                 algorithms.",
+}
+
+@InProceedings{Ohta:1987:RCT,
+  author =       "Masataka Ohta and Mamoru Maekawa",
+  title =        "Ray Coherence Theorem and Constant Time Ray Tracing
+                 Algorithm",
+  pages =        "303--314",
+  booktitle =    "Computer Graphics 1987 (Proceedings of CG
+                 International '87)",
+  year =         "1987",
+  editor =       "Tsiyasu L. Kunii",
+  publisher =    "Springer-Verlag",
+  keywords =     "ray tracing, cull, computational geometry, spherical
+                 geometry, complexity",
+  annote =       "The concept of ray coherence is formalized as a ray
+                 coherence theorem to decrease the amount of computation
+                 in a ray object intersection of the ray tracing
+                 algorithm. Using the theorem, the calculation time of
+                 ray-object intersection in a ray tracing algorithm can
+                 be drastically decreased, by calculating a table which
+                 is used to limit the number of objects which may
+                 intersect with a given ray. The overhead of the
+                 algorithm is so small that it is effective even when
+                 there are only two objects. For more objects, the
+                 computation time of the ray-object intersection remains
+                 almost constant.",
+}
+
+@InProceedings{Hanrahan:1986:UCB,
+  author =       "Pat Hanrahan",
+  title =        "Using Caching and Breadth-First Search to Speed Up
+                 Ray-Tracing",
+  year =         "1986",
+  month =        may,
+  booktitle =    "Proceedings of Graphics Interface '86",
+  publisher =    "Canadian Information Processing Society",
+  pages =        "56--61",
+  address =      "Toronto, Ontario",
+  keywords =     "seed fill, coherence",
+}
+
+@Article{hall83a,
+  author =       "R. A. Hall and D. P. Greenberg",
+  title =        "A Testbed for Realistic Image Synthesis",
+  pages =        "10--20",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "3",
+  number =       "8",
+  year =         "1983",
+  month =        nov,
+  keywords =     "ray tracing cull, I37 Image Synthesis, I37 Surface
+                 Finish, shading, color",
+  annote =       "concerns shading and color more than ray tracing, but
+                 nice pictures! \\ As we have shown here, Cornell
+                 University's testbed image synthesis system has helped
+                 in the development of a number of improvements of
+                 existing ray-tracing techniques. In summary, these
+                 include a hybrid reflection model, a spectral-sampling
+                 method, the incorporation of light sources, and
+                 adaptive tree-depth control. Nevertheless, we point out
+                 again that many of the problems of realistic image
+                 generation through ray tracing have not been solved.
+                 The inherent point-sampling technique is prone to
+                 aliasing, the reflection models proposed do not include
+                 the correct energy formulations, and the computational
+                 expense is currently too high. The use of environmental
+                 image coherence techniques would probably make these
+                 approaches more tractable. It is our hope that the
+                 testbed imaging system will provide an appropriate
+                 environment for further exploration of these
+                 problems.",
+}
+
+InProceedings{Groller:1991:UTS,
+  author =       "E. Groller and W. Purgathofer",
+  title =        "Using Temporal and Spatial Coherence for Accelerating
+                 the Calculation of Animation Sequences",
+  pages =        "103--113",
+  booktitle =    "Eurographics '91",
+  year =         "1991",
+  month =        sep,
+  editor =       "Werner Purgathofer",
+  publisher =    "North-Holland",
+  conference =   "European Computer Graphics Conference and Exhibition;
+                 held in Vienna, Austria; 2-6 September 1991",
+  keywords =     "ray tracing",
+}
+
+@InProceedings{Gigante:1988:ART,
+  author =       "Michael Gigante",
+  title =        "Accelerated Ray Tracing Using Non-Uniform Grids",
+  pages =        "157--163",
+  booktitle =    "Proceedings of Ausgraph '90",
+  year =         "1988",
+  annote =       "A new space-partitioning method for ray tracing
+                 complex environments is described in this paper.
+                 Elements of a scene are placed into a collection of
+                 non-hierarchical, variable-sized voxels. \\ The
+                 creation of this structure is the result of a simple
+                 pre-processing step. In a scheme similar to that used
+                 by uniform grid methods, the non-uniform grid can be
+                 traversed very efficiently. \\ Unlike uniform grid
+                 methods, this method generates voxels with
+                 approximately uniform density of primitives per voxel.
+                 Its performance is less sensitive to the type of scene
+                 and does not fail on scenes with local, high-density
+                 clusters of primitives.",
+}
+
+@Article{deb94,
+  author =       "M. De Berg and D. Halperin and M. Overmars and J.
+                 Snoeyink and M. Van Kreveld",
+  title =        "Efficient ray shooting and hidden surface removal",
+  journal =      "Algorithmica: An International Journal in Computer
+                 Science",
+  volume =       "12",
+  number =       "1",
+  year =         "1994",
+  publisher =    "Springer Verlag, New York",
+  pages =        "30--53",
+  topic =        "visibility",
+}
+
+@TechReport{Kreveld:1992:NRD,
+  author =       "M. J. van Kreveld",
+  title =        "New results on data structures in computational
+                 geometry",
+  type =         "Ph.{D}. {Dissertation}",
+  institution =  "Dept. Comput. Sci., Univ. Utrecht",
+  address =      "Utrecht, Netherlands",
+  year =         "1992",
+  keywords =     "doctoral thesis",
+}
+
+@TechReport{Rushmeier91-RMVR,
+  author =       "Holly E. Rushmeier",
+  year =         "1991",
+  title =        "Radiosity {Methods} for {Volume} {Rendering}",
+  number =       "GIT-GVU-91-01",
+  publisher =    "Graphics, Visualization and Usability Center",
+  institution = "Georgia Institute of Technology",
+  address =      "Atlanata, GA",
+}
+
+@Article{Roth:1982:RCM,
+  author =       "Scott D. Roth",
+  title =        "Ray Casting for Modeling Solids",
+  journal =      "Computer Graphics and Image Processing",
+  volume =       "18",
+  number =       "2",
+  pages =        "109--144",
+  month =        feb,
+  year =         "1982",
+  coden =        "CGIPBG",
+  ISSN =         "0146-664X",
+  bibdate =      "Fri Feb 7 08:36:21 MST 1997",
+  note =         "Also in SIGGRAPH '87, '88, '89 Introduction to Ray
+                 Tracing course notes. The other classic ray tracing
+                 paper.",
+  acknowledgement = ack-nhfb,
+  annote =       "the other classic ray tracing paper \\ This paper
+                 presents ray casting as the methodological basis for a
+                 CAD/CAM solid modeling system. Solid objects are
+                 modeled by combining primitive solids, such as blocks
+                 and cylinders, using the set operators union,
+                 intersection, and difference. To visualize and analyze
+                 the composite solids modeled, virtual light rays are
+                 cast as probes. By virtue of its simplicity, ray
+                 casting is reliable and extensible. The most difficult
+                 mathematical problem is finding line-surface
+                 intersection points. So surfaces such as planes,
+                 quadrics, tori, and probably even parametric surface
+                 patches may bound the primitive solids. The adequacy
+                 and efficiency of ray casting are issues addressed
+                 here. A fast picture generation capability for
+                 interactive modeling is the biggest challenge. New
+                 methods are presented, accompanied by sample pictures
+                 and CPU times, to meet the challenge.",
+  classification = "723",
+  journalabr =   "Comput Graphics Image Process",
+  keywords =     "computer aided design; computer graphics; ray casting;
+                 ray tracing casting intersect CSG, tracing, hidden
+                 line, I35 ray casting for a CAD/CAM solid modeling
+                 system, CSG",
+}
+
+@PhdThesis{Pattanaik:1990:CMG,
+  author =       "Sumanta N. Pattanaik",
+  title =        "Computational Methods for Global Illumination and
+                 Visualisation of Complex 3{D} Environments",
+  year =         "1990",
+  month =        nov,
+  school =       "Birla Institute of Technology \& Science, Computer
+                 Science Department, Pilani, India",
+  keywords =     "adjoint illumination equations, particle model of
+                 light, random walk, importance sampling",
+}
+
+@Article{Pattanaik:1994:FWR,
+  author =       "S. N. Pattanaik and K. Bouatouch",
+  title =        "Fast Wavelet Radiosity Method",
+  journal =      "Com{\-}pu{\-}ter Graphics Forum",
+  volume =       "13",
+  number =       "3",
+  pages =        "C/407--C/420",
+  month =        "????",
+  year =         "1994",
+  coden =        "CGFODY",
+  ISSN =         "0167-7055",
+  bibdate =      "Mon Apr 14 10:23:20 MDT 1997",
+  acknowledgement = ack-nhfb,
+  classification = "C4260 (Computational geometry); C6130B (Graphics
+                 techniques)",
+  conflocation = "Oslo, Norway; 12-16 Sept. 1994",
+  conftitle =    "15th Annual Conference and Exhibition.
+                 EUROGRAPHICS'94",
+  corpsource =   "Campus de Beaulieu, IRISA, Rennes, France",
+  keywords =     "computational geometry; Computer graphics; computer
+                 graphics; decomposition technique; hierarchical;
+                 Hierarchical decomposition technique; inner products;
+                 interpolating wavelets; Interpolating wavelets;
+                 interpolating wavelets; multidimensional;
+                 Multidimensional inner products; optimal adaptive
+                 subdivision; Optimal adaptive subdivision; ray tracing;
+                 wavelet analysis; Wavelet analysis; wavelet radiosity
+                 method; Wavelet radiosity method; wavelet transforms",
+  thesaurus =    "Computational geometry; Ray tracing; Wavelet
+                 transforms",
+  treatment =    "T Theoretical or Mathematical",
+}
+
+@InProceedings{Ferwerda:1997:MVM,
+  author =       "James A. Ferwerda and Sumanta N. Pattanaik and Peter
+                 Shirley and Donald P. Greenberg",
+  title =        "A Model of Visual Masking for Computer Graphics",
+  booktitle =    "SIGGRAPH 97 Conference Proceedings",
+  editor =       "Turner Whitted",
+  series =       "Annual Conference Series",
+  year =         "1997",
+  organization = "ACM SIGGRAPH",
+  publisher =    "Addison Wesley",
+  month =        aug,
+  pages =        "143--152",
+  note =         "ISBN 0-89791-896-7",
+  keywords =     "visual perception, masking, image quality, error
+                 metrics",
+  annote =       "In this paper we develop a computational model of
+                 visual masking based on psychophysical data. The model
+                 predicts how the presence of one visual pattern affects
+                 the detectability of another. The model allows us to
+                 choose texture patterns for computer graphics images
+                 that hide the effects of faceting, banding, aliasing,
+                 noise and other visual artifacts produced by sources of
+                 error in graphics algorithms. We demonstrate the
+                 utility of the model by choosing a texture pattern to
+                 mask faceting artifacts caused by polygonal tesselation
+                 of a at-shaded curved surface. The model predicts how
+                 changes in the contrast, spatial frequency, and
+                 orientation of the texture pattern, or changes in the
+                 tesselation of the surface will alter the masking
+                 effect. The model is general and has uses in geometric
+                 modeling, realistic image synthesis, scientific
+                 visualization, image compression, and image-based
+                 rendering.",
+}
+
+@Article{Levoy:1990:ERT,
+  author =       "Marc Levoy",
+  title =        "Efficient Ray Tracing of Volume Data",
+  journal =      "ACM Transactions on Graphics",
+  volume =       "9",
+  number =       "3",
+  pages =        "245--261",
+  month =        jul,
+  year =         "1990",
+  coden =        "ATGRDF",
+  ISSN =         "0730-0301",
+  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
+  url =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/78965.html",
+  acknowledgement = ack-nhfb,
+  annote =       "{\em Volume Rendering} is a technique for visualizing
+                 sampled scalar or vector fields of three spatial
+                 dimensions without fitting geometric primitives to the
+                 data. A subset of these techniques generates images by
+                 computing 2-D projections of a colored semitransparent
+                 volume, where the color and opacity at each point are
+                 derived from the data using local operators. Since all
+                 voxels participate in the generation of each image,
+                 rendering time grows linearly with the size of the
+                 dataset. This paper presents a front-to-back
+                 image-order volume-rendering algorithm and discusses
+                 two techniques for improving its performance. The first
+                 technique employs a pyramid of binary volumes to encode
+                 spatial coherence present in the data, and the second
+                 technique uses an opacity threshold to adaptively
+                 terminate ray tracing. Although the actual time saved
+                 depends on the data, speedups of an order of magnitude
+                 have been observed for datasets of useful size and
+                 complexity. Examples from two applications are given:
+                 medical imaging and molecular graphics.",
+  keywords =     "algorithms; design; hierarchical spatial enumeration;
+                 medical imaging; molecular graphics; octree;
+                 performance; ray tracing; scientific visualization;
+                 volume rendering; volume visualization; voxel",
+  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
+                 GRAPHICS, Picture/Image Generation, Display algorithms.
+                 {\bf I.3.5}: Computing Methodologies, COMPUTER
+                 GRAPHICS, Computational Geometry and Object Modeling,
+                 Curve, surface, solid, and object representations. {\bf
+                 I.3.7}: Computing Methodologies, COMPUTER GRAPHICS,
+                 Three-Dimensional Graphics and Realism, Visible
+                 line/surface algorithms.",
+}
+
+@InProceedings{Heckbert92discon,
+  author =       "Paul S. Heckbert",
+  title =        "Discontinuity Meshing for Radiosity",
+  booktitle =    "Third Eurographics Workshop on Rendering",
+  month =        may,
+  year =         "1992",
+  address =      "Bristol, UK",
+  pages =        "203--216",
+  keywords =     "radiosity, adaptive mesh, visibility",
+}
+
+@InProceedings{hashimoto89a,
+  author =       "Akihiko Hashimoto and Taka-aki Akimoto and Kenji Mase
+                 and Yasuhito Suenaga",
+  title =        "Vista Ray-Tracing: High Speed Ray Tracing Using
+                 Perspective Projection Image",
+  pages =        "549--561",
+  booktitle =    "New Advances in Computer Graphics (Proceedings of CG
+                 International '89)",
+  year =         "1989",
+  editor =       "R. A. Earnshaw and B. Wyvill",
+  publisher =    "Springer-Verlag",
+  annote =       "This paper presents a new high speed algorithm of
+                 ray-tracing named Vista Ray-tracing. In Vista
+                 Ray-tracing, time consuming intensity calculations are
+                 done only for ``active'' pixels which really need
+                 precise ray-tracing, while the intensity of
+                 ``moderate'' pixels in calculated by interpolation. The
+                 perspective projection image, or Vista, is generated at
+                 the first stage to be used as a guide map in active
+                 pixel selection. In this paper, a new method for
+                 obtaining Vistas for CSG models of quadratic surface
+                 objects is presented as a key technology. A new texture
+                 mapping algorithm is also presented. Vista Ray-tracing
+                 is actually 16-75 times faster than standard
+                 ray-tracing, and can be even faster if other
+                 acceleration methods are employed. Consequently, Vista
+                 Ray-tracing is very useful for intermediate processes
+                 in making various images for TV animation, movies, high
+                 definition television, printing, etc.",
+}
+
+@Article{Hanrahan:1990:LSL,
+  author =       "Pat Hanrahan and Jim Lawson",
+  editor =       "Forest Baskett",
+  title =        "A Language for Shading and Lighting Calculations",
+  journal =      "Computer Graphics",
+  volume =       "24",
+  number =       "4",
+  pages =        "289--298",
+  month =        aug,
+  year =         "1990",
+  coden =        "CGRADI, CPGPBZ",
+  ISSN =         "0097-8930",
+  conference =   "held in Dallas, Texas; 6--10 August 1990",
+  keywords =     "shading language, little language, illumination,
+                 lighting, rendering",
+}
+
+@Article{Cook:1984:ST,
+  author =       "R. L. Cook",
+  title =        "Shade trees",
+  journal =      "Computer Graphics",
+  volume =       "18",
+  number =       "3",
+  pages =        "223--231",
+  month =        jul,
+  year =         "1984",
+  coden =        "CGRADI, CPGPBZ",
+  ISSN =         "0097-8930",
+  annote =       "Cook developed a special shade tree language for
+                 defining textures and coloration for objects.
+                 Interesting because it separates shading from the rest
+                 of rendering, and allows a library of surface types to
+                 be built up gradually. \\ Ray tracing is one of the
+                 most elegant techniques in computer graphics. Many
+                 phenomena that are difficult or impossible with other
+                 techniques are simple with ray tracing, including
+                 shadows, reflections, and refracted light. Ray
+                 directions, however, have been determined precisely,
+                 and this has limited the capabilities of ray tracing.
+                 By distributing the directions of the rays according to
+                 the analytic function they sample, ray tracing can
+                 incorporate fuzzy phenomena. This provides correct and
+                 easy solutions to some previously unsolved or partially
+                 solved problems, including motion blur, depth of field,
+                 penumbras, translucency, and fuzzy reflections. Motion
+                 blur and depth of field calculations can be integrated
+                 with the visible surface calculations, avoiding the
+                 problems found in previous methods.",
+  conference =   "held in Minneapolis, Minnesota; 23--27 July 1984",
+  keywords =     "texturing, procedural models, languages, I37 Shade
+                 Trees",
+}
+
+@Article{Goldfeather:1989:NRC,
+  author =       "Jack Goldfeather and Steven Molnar and Greg Turk and
+                 Henry Fuchs",
+  title =        "Near Real-Time {CSG} Rendering Using Tree
+                 Normalization and Geometric Pruning",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "9",
+  number =       "3",
+  pages =        "20--28",
+  month =        may,
+  year =         "1989",
+  coden =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Carleton Coll, Dep of Math, Northfield, MN, USA",
+  classification = "723; 741; 921",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "Boolean Switching Functions; Computer Aided Design;
+                 Computer Aided Engineering; Computer Graphics ---
+                 Interactive; Constructive Solid Geometry (CSG);
+                 Geometric Pruning; Imaging Techniques; solid modeling;
+                 Surfaces; Tree Normalization",
+}
+
+@Article{Pavlidis:1990:RCS,
+  author =       "Theo Pavlidis",
+  title =        "Re: Comments on ``{Stochastic Sampling in Computer
+                 Graphics}''",
+  journal =      "ACM Transactions on Graphics",
+  volume =       "9",
+  number =       "2",
+  pages =        "233--236",
+  month =        apr,
+  year =         "1990",
+  coden =        "ATGRDF",
+  ISSN =         "0730-0301",
+  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
+  note =         "See \cite{Cook:1986:SSC,Wold:1990:RCS}.",
+  acknowledgement = ack-nhfb,
+}
+
+@InCollection{Whitted88,
+  author =       "Turner Whitted and Robert L. Cook",
+  editor =       "Kenneth I. Joy and Charles W. Grant and Nelson L. Max
+                 and Lansing Hatfield",
+  title =        "A Comprehensive Shading Model",
+  booktitle =    "Tutorial: Computer Graphics: Image Synthesis",
+  pages =        "232--43",
+  publisher =    "Computer Society Press",
+  address =      "Washington, DC",
+  year =         "1988",
+  keywords =     "shading",
+  note =         "also in SIGGRAPH '85 course notes \#11",
+}
+
+@Article{Cook:1986:SSC,
+  author =       "Robert L. Cook",
+  title =        "Stochastic Sampling in Computer Graphics",
+  journal =      "ACM Transactions on Graphics",
+  volume =       "5",
+  number =       "1",
+  pages =        "51--72",
+  month =        jan,
+  year =         "1986",
+  coden =        "ATGRDF",
+  ISSN =         "0730-0301",
+  bibdate =      "Thu Aug 25 23:39:28 1994",
+  note =         "See remarks \cite{Pavlidis:1990:RCS,Wold:1990:RCS}.
+                 Also in Tutorial: Computer Graphics: Image Synthesis,
+                 Computer Society Press, Washington, 1988, pp.
+                 283--304.",
+  url =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/8927.html",
+  acknowledgement = ack-nhfb,
+  keywords =     "algorithms; antialiasing; depth of field; filtering;
+                 image synthesis; Monte Carlo integration; motion blur;
+                 raster graphics; ray tracing; stochastic sampling",
+  review =       "ACM CR 8709-0784",
+  subject =      "{\bf I.3.3}: Computing Methodologies, COMPUTER
+                 GRAPHICS, Picture/Image Generation, Viewing algorithms.
+                 {\bf G.3}: Mathematics of Computing, PROBABILITY AND
+                 STATISTICS, Probabilistic algorithms (including Monte
+                 Carlo).",
+}
+
+@InProceedings{Torrance87a,
+  author =       "R. L. Cook and K. E. Torrance",
+  title =        "A Reflectance Model for Computer Graphics",
+  year =         "1987",
+  editor =       "W. Richards and S. Ullman",
+  booktitle =    "Image Understanding 1985--86",
+  publisher =    "Ablex",
+  address =      "Norwood, NJ",
+  institution =  "Cornell U",
+  pages =        "1--19",
+  keywords =     "IMAGE OUTPUT",
+}
+
+@TechReport{EVL-1996-11,
+  author =       "Andr{\'e} Hinkenjann and Markus Kubuk and Heinrich
+                 M{\"u}ller",
+  title =        "Answering Line Segment Intersection Queries Based On
+                 Sample Answers",
+  number =       "620/1996",
+  type =         "Research Report",
+  institution =  "University of Dortmund",
+  address =      "Universit{\"a}t Dortmund, 44221 Dortmund, Germany",
+  month =        aug,
+  year =         "1996",
+  abstract =     "Geometric query problems can be solved by
+                 preprocessing the answers for a representative set of
+                 sample queries. An arbitrary query is answered by the
+                 response of a closest sample query. In general, this
+                 answer will not be correct. A framework is presented in
+                 which the quality of approximation of this approach can
+                 be characterized. Futher, efficiency considerations are
+                 performed. They consist in empirical experiments for
+                 the classical line segment intersection query problem,
+                 but also in giving theoretical time and space bounds
+                 describing the trade-off between quality of
+                 approximation and computational complexity. Finally,
+                 approaches to the choice of favorable sample queries
+                 are discussed.",
+  postscript-url = "ftp://euklid.informatik.uni-dortmund.de/pub/reports/ls7/rr-620.ps.gz",
+  evlib-url =    "http://infovis.zib.de:8000/Dienst/UI/2.0/Describe/evl.computationalgeometry%2FEVL-1996-11",
+  evlib-revision = "1st",
+  evlib-postscript-md5 = "14a18f6a52af153a3c3eb1c7037c344c",
+}
+
+@Article{Sbert:1997:OSS,
+  author =       "Mateu Sbert",
+  title =        "Optimal Source Selection in Shooting Random Walk
+                 {Monte Carlo} Radiosity",
+  journal =      "Com{\-}pu{\-}ter Graphics Forum",
+  volume =       "16",
+  number =       "3",
+  pages =        "C301--C308",
+  month =        sep # " 4--8",
+  year =         "1997",
+  coden =        "CGFODY",
+  ISSN =         "0167-7055",
+  bibdate =      "Tue Mar 17 15:44:38 MST 1998",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Universitat de Girona",
+  affiliationaddress = "Girona, Spain",
+  classification = "723.5; 741.1; 921.5; 922.1; 922.2",
+  journalabr =   "Comput Graphics Forum",
+  keywords =     "Computer graphics; Computer simulation; Lighting;
+                 Monte Carlo methods; Optimization; Probability;
+                 Radiosity; Rendering method",
+}
+
+@Article{Choi92,
+  author =       "H. K. Choi and C. M. Kyung",
+  title =        "{PYSHA}: a shadow-testing acceleration scheme for ray
+                 tracing",
+  journal =      "Computer-aided design",
+  volume =       "24",
+  number =       "2",
+  month =        feb,
+  year =         "1992",
+  note =         "hybrid scheme of light buffer and grid subdivision
+                 with cost comparison on the fly",
+}
+
+@article{gt-drssp-97
+, author =	"M. T. Goodrich and R. Tamassia"
+, title =	"Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulations"
+, journal =	"J. Algorithms"
+, volume =	23
+, year =	1997
+, pages =	"51--73"
+, update =	"97.07 smid"
+}
+
+@article{ekltmmv-rcerr-91
+, author =	"J. L. Ellis and G. Kedem and T. C. Lyerly and D. G. Thielman and R. J. Marisa and J. P. Menon and H. B. Voelcker"
+, title =	"The ray casting engine and ray representations: a technical summary"
+, journal =	"Internat. J. Comput. Geom. Appl."
+, volume =	1
+, number =	4
+, year =	1991
+, pages =	"347--380"
+, keywords =	"mechanical CAD CAM, solid modeling, parallel computation, ray representation"
+}
+
+@inproceedings{cj-sersi-91
+, author =	"S. W. Cheng and R. Janardan"
+, title =	"Space-efficient ray shooting and intersection searching: algorithms, dynamization and applications"
+, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
+, year =	1991
+, pages =	"7--16"
+, keywords =	"ray tracing, dynamization, spanning trees of low stabbing number"
+}
+
+@article{cj-arsis-92
+, author =	"S. W. Cheng and R. Janardan"
+, title =	"Algorithms for ray-shooting and intersection searching"
+, journal =	"J. Algorithms"
+, volume =	13
+, year =	1992
+, pages =	"670--692"
+, update =	"93.09 smid"
+}
+
+@techreport{bf-vrs-90
+, author =	"R. Bar-Yehuda and S. Fogel"
+, title =	"Variations on Ray Shooting"
+, type =	"Technical {Report}"
+, number =	639
+, institution =	"Technion IIT"
+, address =	"Haifa, Israel"
+, year =	1990
+, keywords =	"sheaf, ES-trees"
+, update =	"95.01 smid, 93.09 milone+mitchell"
+}
+
+@inproceedings{af-acrsm-97
+, author =	"B. Aronov and S. Fortune"
+, title =	"Average-Case Ray Shooting and Minimum Weight Triangulations"
+, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =	1997
+, pages =	"203--212"
+, update =	"97.07 efrat"
+}
+
+@inproceedings{b-lsbsp-95
+, author =      "Mark de Berg"
+, title =       "Linear Size Binary Space Partitions for Fat Objects"
+, booktitle =   "Proc. 3rd Annu. European Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      979
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "252--263"
+, update =      "97.03 murali+schwarzkopf"
+}
+
+@inproceedings{bg-bspsc-94
+, author =      "M. de Berg and M. de Groot"
+, title =       "Binary space partitions for sets of cubes"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG'94"
+, year =        1994
+, pages =       "84--88"
+, update =      "94.05 schwarzkopf"
+}
+
+@inproceedings{bgo-nrbsp-94
+, author =      "M. de Berg and M. de Groot and M. Overmars"
+, title =       "New results on binary space partitions in the plane"
+, booktitle =   "Proc. 4th Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      824
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "61--72"
+, update =      "95.01 schwarzkopf+smid, 94.05 schwarzkopf"
+}
+
+@inproceedings{bgo-pbsp-93
+, author =      "M. de Berg and M. de Groot and M. Overmars"
+, title =       "Perfect binary space partitions"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "109--114"
+, precedes =    "bgo-pbsp-97"
+, update =      "97.03 devillers, 93.09 milone+mitchell"
+}
+
+@article{bgo-pbsp-97
+, author =      "M. de Berg and M. de Groot and M. Overmars"
+, title =       "Perfect binary space partitions"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, year =        1997
+, pages =       "81--91"
+, succeeds =    "bgo-pbsp-93"
+, update =      "97.03 devillers"
+}
+
+@article{py-ebsph-90
+, author =      "M. S. Paterson and F. F. Yao"
+, title =       "Efficient binary space partitions for hidden-surface removal and solid modeling"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "485--503"
+, succeeds =    "py-bpahs-89"
+}
+
+@inproceedings{py-obspo-90
+, author =      "M. S. Paterson and F. F. Yao"
+, title =       "Optimal binary space partitions for orthogonal objects"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "100--106"
+, precedes =    "py-obspo-92"
+}
+
+@article{py-obspo-92
+, author =      "M. S. Paterson and F. F. Yao"
+, title =       "Optimal binary space partitions for orthogonal objects"
+, journal =     "J. Algorithms"
+, volume =      13
+, year =        1992
+, pages =       "99--113"
+, succeeds =    "py-obspo-90"
+}
+
+
+
+@inproceedings{l-hmelr-83
+, author =      "A. Lingas"
+, title =       "Heuristics for minimum edge length rectangular partitions of rectilinear figures"
+, booktitle =   "Proc. 6th GI Conf. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      145
+, publisher =   "Springer-Verlag"
+, year =        1983
+, pages =       "199--210"
+, keywords =    "design of algorithms, VLSI design, length, partition, approximation, polygons, geometric graphs, rectangles"
+}
+
+@incollection{s-ghsgc-83
+, author =      "K. J. Supowit"
+, title =       "Grid heuristics for some geometric covering problems"
+, editor =      "F. P. Preparata"
+, booktitle =   "Computational Geometry"
+, series =      "Adv. Comput. Res."
+, volume =      1
+, publisher =   "JAI Press"
+, address =     "Greenwich, CT"
+, year =        1983
+, pages =       "215--233"
+, keywords =    "balls, $d$-dimensional, covering, heuristics"
+}
+
+@inproceedings{lls-nohbs-87
+, author =      "C. Levcopoulos and A. Lingas and J.-R. Sack"
+, title =       "Nearly optimal heuristics for binary search trees with geometric generalizations"
+, booktitle =   "Proc. 14th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      267
+, publisher =   "Springer-Verlag"
+, year =        1987
+, pages =       "376--385"
+, keywords =    "decomposition, partition, polygons, two-dimensional"
+}
+
+@article{dz-hmlrp-90
+, author =      "D. Du and Y. Zhang"
+, title =       "On heuristics for minimum length rectilinear partitions"
+, journal =     "Algorithmica"
+, volume =      5
+, year =        1990
+, pages =       "111--128"
+}
+
+ceedings{l-fhmlr-86
+, author =      "C. Levcopoulos"
+, title =       "Fast heuristics for minimum length rectangular partitions of polygons"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "100--108"
+, cites =       "cd-vdbcd-85, f-fapct-85, gz-bprp-85, ia-dsisa-84, ks-mdpo-85, k-ubsir-80, ll-blcpp-84, l-hmelr-83, lprs-melpr-82, l-tspp-77, ps-cgi-85, r-ppis-82, ZZZ"
+, update =      "97.11 bibrelex"
+}
+
+@article{lls-hobst-89
+, author =      "Christos Levcopoulos and Andrzej Lingas and Jorg-R. Sack"
+, title =       "Heuristics For Optimum Binary Search Trees And Minimum Weight Triangulation Problems"
+, journal =     "Theoret. Comput. Sci."
+, volume =      66
+, number =      2
+, month =       aug
+, year =        1989
+, pages =       "181--203"
+, keywords =    "optimum binary search trees, minimum weight triangulation, amortization argument"
+, annote =      "Amortized linear algorithm for GT of semi-circular
+                 polygons."
+, abstract =    "We establish new bounds on the problem of constructing
+                 optimum binary search trees with zero-key access
+                 probabilities (with applications e.g. to point location
+                 problems). We present a linear-time heuristic for
+                 constructing such trees so that their cost is within a
+                 factor of 1 plus epsilon from the optimum cost, where
+                 epsilon is an arbitrary positive constant. Furthermore,
+                 by using an interesting amortization argument, we give
+                 a simple and practical, linear-time implementation of a
+                 known greedy heuristics for such trees. The above
+                 results are obtained in a more general setting, namely,
+                 in the context of minimum length triangulations of so-
+                 called semi-circular polygons. They are carried over to
+                 binary search trees by proving a duality between
+                 optimum (m minus 1)-way search trees and minimum weight
+                 partitions of infinitely-flat semi-circular polygons
+                 into m- gons. With this duality we can also obtain
+                 better heuristics for minimum length partitions of
+                 polygons by using known algorithms for optimum search
+                 trees. (Author abstract) 14 Refs."
+}
+
+@article{dr-hmrst-93
+, author =      "C. C. {De Souza} and C. C. Ribeiro"
+, title =       "Heuristics for the minimum rectilinear {Steiner} tree problem: new algorithms and a computational study"
+, journal =     "Discrete Appl. Math."
+, volume =      45
+, number =      3
+, year =        1993
+, pages =       "205--220"
+, keywords =    "Steiner tree, $L_{1}$ metric, heuristics"
+, update =      "95.09 korneenko"
+}
+
+@InProceedings{Bar-Yehuda90,
+  author =       "R. Bar-Yehuda and S. Fogel",
+  title =        "Good splitters with applications to ray shooting",
+  booktitle =    "Proc. 2nd Canad. Conf. Comput. Geom.",
+  pages =        "81--84",
+  year =         "1990",
+  keywords =     "computational geometry, arrangements",
+}
+
+@InProceedings{Edelsbrunner91,
+  author =       "Herbert Edelsbrunner and Bernard Chazelle and
+                 Michelangelo Grigni and Leonidas Guibas and John
+                 Hershberger and Misha Sharir and Jack Snoeyink",
+  title =        "Ray Shooting in Polygons Using Geodesic
+                 Triangulations",
+  booktitle =    "Proc. 18th Internat. Colloq. Automata Lang. Program.,
+                 Lecture Notes in Computer Science{"} series no. 150",
+  pages =        "661--673",
+  publisher =    "Springer-Verlag",
+  year =         "1991",
+  keywords =     "computational geometry, simple polygon, geodesics",
+  note =         "also as Princeton University, Computer Science
+                 Department, TR-350-91, Sept. 1991",
+}
+
+@TechReport{Guibas89,
+  author =       "L. Guibas and M. Overmars and M. Sharir",
+  title =        "Ray shooting, implicit point location, and related
+                 queries in arrangements of segments{"}",
+  institution =  "Dept. Comput. Sci., New York Univ.",
+  number =       "433",
+  address =      "New York, NY",
+  month =        mar,
+  year =         "1989",
+  keywords =     "random sampling, arrangements, point location",
+}
+
+@Article{Matousek93,
+  author =       "J. Matousek",
+  title =        "On Vertical Ray Shooting in Arrangements",
+  journal =      "Comput. Geom. Theory Appl.",
+  volume =       "2",
+  number =       "5",
+  pages =        "279--285",
+  month =        mar,
+  year =         "1993",
+  keywords =     "computational geometry, zone theorem, cutting,
+                 hyperplane arrangement",
+  note =         "update = 93.09 Held+Matousek+Milone+Mitchell",
+}
+
+@Article{bronsvoort84b,
+  author =       "Willem F. Bronsvoort and Jarke J. van Wijk and
+                 Frederik W. Jansen",
+  title =        "Two Methods for Improving the Efficiency of Ray
+                 Casting in Solid Modeling",
+  pages =        "110--116",
+  journal =      "Computer-Aided Design",
+  volume =       "16",
+  number =       "1",
+  year =         "1984",
+  month =        jan,
+  keywords =     "CSG, I35 Ray Tracing, I35 Solid Modeling",
+  annote =       "enhancements to Roth: scanline interval enclosures,
+                 CSG tree optimization, and recursive screen subdivision
+                 \\ In solid modelling based on constructive solid
+                 geometry and primitive instancing, ray casting is a
+                 very suitable technique for visualization of models on
+                 a raster display. In its present form, it is, however,
+                 too inefficient for interactive use. \\ Two methods for
+                 improving the efficiency are given here. The first uses
+                 scan-line interval enclosures instead of box
+                 enclosures, and also bypasses non-contributing nodes
+                 during each traversal of the CSG (constructive solid
+                 geometry) tree. The second refines the image step by
+                 step by subdivision, thereby avoiding explicit
+                 computation of the intensities of many pixels of the
+                 image. The second method reduces computing time more
+                 than the first, but has the disadvantage that slivers
+                 may occasionally be lost from the image.",
+}
+
+@Article{tvcg-1996-22,
+  author =       "Daniel Cohen-Or and Eran Rich and Uri Lerner and
+                 Victor Shenkar",
+  email =        "daniel@math.tau.ac.il and none and none and none",
+  title =        "A Real-Time Photo-Realistic Visual Flythrough",
+  journal =      "IEEE Transaction on Visualization and Computer
+                 Graphics",
+  volume =       "2",
+  number =       "3",
+  month =        sep,
+  year =         "1996",
+  pages =        "255--264",
+  abstract =     "In this paper we present a comprehensive flythrough
+                 system which generates photo-realistic images in true
+                 real-time. The high performance is due to an innovative
+                 rendering algorithm based on a discrete ray casting
+                 approach, accelerated by ray coherence and
+                 multiresolution traversal. The terrain as well as the
+                 3D objects are represented by a textured mapped
+                 voxel-based model. The system is based on a pure
+                 software algorithm and is thus portable. It was first
+                 implemented on a workstation and then ported to a
+                 general-purpose parallel architecture to achieve
+                 real-time performance.",
+  keywords =     "Terrain visualization, parallel rendering, flight
+                 simulator, visual simulations, voxel-based modeling,
+                 ray casting",
+  tvcg-abstract-url = "http://www.computer.org/pubs/tvcg/abs96.htm#255tg0996",
+}
+
+@InProceedings{dadoun85a,
+        author =       "Nou Dadoun and David G. Kirkpatrick and John P.
+                       Walsh",
+        title =        "The Geometry of Beam Tracing",
+        booktitle =    "Proceedings of the ACM Symposium on Computational
+                       Geometry",
+        pages =        "55--61",
+        year =         "1985",
+        month =        jun,
+        annote =       "the use of BSP trees and hierarchical bounding volumes
+                       for fast beam intersection testing. \\ A solution to
+                       the hidden surface elimination problem called beam
+                       tracing is described. Beam tracing is related to ray
+                       tracing but uses spatial coherence within the scene,
+                       and area coherence within the image to batch
+                       computations. Beam tracing is an object space solution
+                       to the hidden surface problem. \\ Beam tracing is
+                       formulated in terms of its principal subprocesses:
+                       intersection, sorting, and clipping. A hierarchical
+                       scene representation is proposed. This incorporates the
+                       space decomposition idea of the BSP tree [Fuchs, Kedem,
+                       and Naylor, 80] along with the convex polytope
+                       intersection detection technique of [Dobkin and
+                       Kirkpatrick, 83] to interleave and efficiently solve
+                       the intersection and sorting subproblems of beam
+                       tracing.",
+}
+
+
+@InBook{kaplan85a,
+        author =       "M. Kaplan",
+        title =        "Space-Tracing: {A} Constant Time Ray-Tracer",
+        pages =        "149--158",
+        booktitle =    "SIGGRAPH '85 State of the Art in Image Synthesis
+                       seminar notes",
+        year =         "1985",
+        month =        jul,
+        keywords =     "ray tracing cull",
+}
+
+@Book{Samet90,
+        author =       "Hanan Samet",
+        title =        "Applications of Spatial Data Structures",
+        publisher =    "Addison-Wesley",
+        address =      "Reading, Mass.",
+        year =         "1990",
+        keywords =     "quadtree, octree, radiosity",
+        note =         "chapter on ray tracing and efficiency, also discusses
+                       radiosity",
+}
+
+@InProceedings{glassner88d,
+        author =       "Andrew S. Glassner",
+        title =        "Space Subdivision for Fast Ray Tracing",
+        pages =        "159--167",
+        booktitle =    "Tutorial: Computer Graphics: Image Synthesis",
+        year =         "1988",
+        editor =       "Kenneth I. Joy and Charles W. Grant and Nelson L. Max
+                       and Lansing Hatfield",
+        publisher =    "Computer Society Press",
+        annote =       "We have seen that the infamous slowness of ray-tracing
+                       techniques is caused primarily by the time required for
+                       ray-object intersection calculations. We have also seen
+                       a new way of tracing the ray through small subsets of
+                       space at a speed that reduces the number of ray-object
+                       intersections that must be made, thereby cutting the
+                       overall ray-tracing time considerably. \\ This new
+                       algorithm makes possible the ray tracing of complex
+                       scenes by medium- and small-scale computers. It is
+                       hoped that this will enable the power of ray tracing to
+                       be embraced by more people, helping them generate
+                       pictures at the leading edge of computer graphics.",
+}
+
+@TechReport{fussell88a,
+        author =       "Donald Fussell and K. R. Subramanian",
+        title =        "Fast Ray Tracing Using {K}-{D} Trees",
+        institution =  "U. of Texas, Austin, Dept. Of Computer Science",
+        type =         "Technical Report",
+        number =       "TR-88-07",
+        month =        mar,
+        year =         "1988",
+        keywords =     "hierarchies",
+}
+
+@PhdThesis{subramanian90a,
+        author =       "K. R. Subramanian",
+        title =        "Adapting Search Structures to Scene Characteristics
+                       for Ray Tracing",
+        month =        dec,
+        year =         "1990",
+        type =         "Ph.D. Thesis",
+        school =       "Department of Computer Sciences, University of Texas
+                       at Austin",
+        annote =       "We present new results in adapting search structures
+                       to scene characteristics for improving the performance
+                       of ray tracing. A cost model is developed for
+                       evaluating search structures currently being used in
+                       ray tracing. The model has been successfully used to
+                       terminate search structure construction, thus making it
+                       unnecessary to set termination parameters in advance.
+                       The model has also been used with limited success to
+                       compare the performance of different search structures
+                       for a given scene. \\ A detailed experimental study of
+                       some of the important properties of search structures
+                       has been performed. This has resulted in a new adaptive
+                       search structure that is based on {\em k-d} trees, a
+                       multi-dimensional binary search structure which
+                       outperforms existing methods. Its high performance is
+                       primarily due to the fact that it combines the
+                       advantages of such structures based on space
+                       partitioning and those based on bounding volumes. The
+                       greater flexibility of this search structure allows it
+                       to terminate automatically at a point where further
+                       subdivision would result in no additional benefits. \\
+                       Finally, this search structure has been used to render
+                       volume models from scientific applications such as
+                       medical imaging and molecular modeling. Its advantages
+                       over traditional volume rendering techniques have been
+                       demonstrated.",
+}
+
+@TechReport{subramanian90b,
+        author =       "K. R. Subramanian and Donald Fussell",
+        title =        "A Cost Model for Ray Tracing Hierarchies",
+        institution =  "U. of Texas, Austin, Dept. Of Computer Science",
+        type =         "Technical Report",
+        number =       "TR-90-04",
+        month =        mar,
+        year =         "1990",
+        keywords =     "hierarchies",
+}
+
+@TechReport{Subramanian:1990:FAP,
+        author =       "K. R. Subramanian and Donald Fussell",
+        title =        "Factors Affecting Performance of Ray Tracing
+                       Hierarchies",
+        year =         "1990",
+        month =        jul,
+        number =       "R-90-21",
+        type =         "Technical Report",
+        institution =  "Dept. of Computer Sciences, Univ. of Texas at Austin",
+        keywords =     "octree",
+}
+
+@Article{Vanecek:1991:BIM,
+  author =       "G. {Vanecek, Jr.}",
+  title =        "Brep-index: a multidimensional space partitioning
+		 tree",
+  journal =      "Internat. J. Comput. Geom. Appl.",
+  volume =       "1",
+  number =       "3",
+  year =         "1991",
+  pages =        "243--261",
+  keywords =     "classification, Brep, BSP tree, data structures",
+}
+
+@PhdThesis{semwal87a,
+        author =       "S. K. Semwal",
+        title =        "The Slicing Extent Technique for Fast Ray Tracing",
+        year =         "1987",
+        type =         "Ph.D. Thesis",
+        school =       "Department of Computer Science, University of Central
+                       Florida",
+        annote =       "A new technique for image generation using ray tracing
+                       is introduced. The `Slicing Extent Technique'' (SET)
+                       partitions object space with slicing planes
+                       perpendicular to all three axes. Planes are divided
+                       into two dimensional rectangular cells, which contain
+                       pointers to nearby objects. \\ Cell size and the space
+                       slices varies, and is determined by the objects'
+                       locations and orientations. Unlike oct-tree and other
+                       space-partitioning methods, SET is not primarily
+                       concerned with dividing space into mutually exclusive
+                       volume elements (Voxels') and identifying objects
+                       within each voxel. Instead, SET is based on analysis of
+                       projections of objects onto slicing planes. \\ In
+                       comparison to the existing space subdivision methods
+                       for ray tracing, SET avoids tree traversal and exhibits
+                       no anomalous behavior. There is no reorganization when
+                       new objects arrive. Preprocessing to create slices is
+                       inexpensive and produces a finely tuned filter
+                       mechanism which supports rapid ray tracing.",
+}
+
+@TechReport{semwal86a,
+        author =       "S. K. Semwal and J. M. Moshell",
+        title =        "Geometric Issues of the Slicing Extent Technique for
+                       Ray Tracing",
+        year =         "1986",
+        type =         "Technical Report",
+        number =       "CS-TR-86-17",
+        institution =  "Department of Computer Science, University of Central
+                       Florida",
+        annote =       "We introduce a new technique for image generation
+                       using ray tracing. The `Slicing Extent Technique''
+                       (SET) partitions object space with slicing planes
+                       perpendicular to all three axes. Planes are dividied
+                       into two dimensional rectangular cells, which contain
+                       pointers to nearby objects. \\ Cell size and the space
+                       between slices varies, and is determined by objects'
+                       locations and orientations. Unlilke oct-tree and other
+                       space partitioning methods, SET is not primarily
+                       concerned with dividing space into mutually exclusive
+                       volume elements (oxels') and identifying objects
+                       within each voxel. Instead, SET is based on analysis of
+                       projections of objects onto slicing planes. \\ The
+                       analysis of projections onto planes leads to an
+                       interesting geometric problem of `marking the cells''
+                       on the various planes so that no ray-object
+                       intersection goes undetected. In this paper, we show
+                       that our method of `marking the cells'' for spheres
+                       and polyhedras is sufficient in this sense. The nature
+                       of these extents is analyzed. \\ In comparison to the
+                       existing methods for ray tracing, SET avoids tree
+                       traversal. Preprocessing to create slices is
+                       inexpensive and produces a finely tuned filter
+                       mechanism which supports rapid ray tracing. \\ SET
+                       resembles other efforts to speed up ray tracing
+                       inasmuch as a two step process is used. First, an
+                       approximate `filter'' technique eliminates most
+                       possible ray/object collisions. Then an accurate
+                       computation evaluates the remaining possible collisions
+                       and provides information for the generation of
+                       subsequent rays.",
+}
+
+@Article{jevans89b,
+      author =       "David Jevans and Brian Wyvill",
+      title =        "Adaptive voxel subdivision for ray tracing",
+      pages =        "164--172",
+      journal =      "Proceedings of Graphics Interface '89",
+      year =         "1989",
+      month =        jun,
+      conference =   "held in London, Ontario; 19-23 June 1989",
+      keywords =     "spatial subdivision, octree",
+      annote =       "Although regular subdivision has been shown to be
+                     efficient at ray tracing scenes where objects are
+                     evenly distributed, such algorithms perform poorly when
+                     objects are concentrated in a small number of voxels.
+                     In this paper, a method is presented where voxels in a
+                     regular grid are examined and recursively subdivided
+		     depending on object density. This integration of
+		     regular and adaptive spatial subdivision methods allows
+		     images consisting of large regularly distributed
+		     objects and small dense objects to be ray traced
+		     efficiently. The parameters controlling the coarseness
+		     of the voxel grid, depth of adaptive subdivision trees,
+		     and maximum number of polygons per voxel are varied and
+		     their effects on execution time, subdivision time, and
+		     memory use are measured.",
+}
+
+@InProceedings{Jevans:1990:RTS,
+      author =       "David A. J. Jevans",
+      title =        "Ray tracing scenes of varying local complexity",
+      booktitle =    "Proceedings of the 1990 Western Computer Graphics
+		     Symposium",
+      year =         "1990",
+      month =        mar,
+      conference =   "held in Banff, Alberta; 4-8 March 1990",
+      keywords =     "space subdivision, adaptive, cost function",
+}
+
+@InProceedings{Nemoto:1986:ASS,
+      author =       "Keiji Nemoto and Takao Omachi",
+      title =        "An Adaptive Subdivision by Sliding Boundary Surfaces
+		     for Fast Ray Tracing",
+      pages =        "43--48",
+      booktitle =    "Proceedings of Graphics Interface '86",
+      year =         "1986",
+      month =        may,
+      editor =       "M. Green",
+      conference =   "held in Vancouver, B.C.; 26-30 May 1986",
+      keywords =     "adaptive subdivision algorithm on a parallel
+                     architecture, parallel processing",
+      annote =       "They describe a dynamic load-balanced ray tracer. One
+		     of the first load-balanced ray tracers. \\ This paper
+                     presents an adaptive subdivision algorithm for fast ray
+                     tracing implemented on parallel architecture using a
+                     three dimensional computer array. The object space is
+		     divided into several subregions and boundary surfaces
+		     for the subregions are adaptively slid to redistribute
+                     loads of the computers uniformly. Since the shape of
+                     the subregions is preserved as orthogonal
+                     parallelepiped the redistribution overhead can be kept
+                     small. The algorithm is quite simple but can avoid load
+                     concentration to a particular computer. \\ Simulation
+                     results reveal that the adaptive space subdivision
+                     algorithm by sliding boundary surfaces reduces the
+                     computing time to 3/4 - 1/5 as much as that for the
+                     conventional space subdivision algorithm with no
+                     redistribution, which reduces the computing time almost
+                     proportionally to the number of computers.",
+}
+
+@MastersThesis{Jevans90,
+      author =       "David Jevans",
+      title =        "Adaptive Voxel Subdivision for Ray Tracing",
+      school =       "Dept. of Computer Science, Univ. of Calgary",
+      type =         "Master's Thesis",
+      year =         "1990",
+      keywords =     "grid subdivision, hierarchical subdivision",
+      note =         "long version of paper",
+}
+
+@TechReport{naylor86a,
+      author =       "Bruce Naylor and William Thibault",
+      title =        "Application of {BSP} Trees to Ray-Tracing and {CGS}
+		     Evaluation",
+      institution =  "Georgia Institute of Tech., School of Information and
+		     Computer Science",
+      type =         "Technical Report",
+      address =      "Atlanta, Georgia",
+      number =       "GIT-ICS 86/03",
+      month =        feb,
+      year =         "1986",
+      keywords =     "hierarchies, BSP tree, CSG",
+      note =         "true BSP-trees (not just generalized octrees) used for
+		     efficiency",
+}
+
+@MastersThesis{lin87a,
+      author =       "Jimmy Jih-Ming Lin",
+      title =        "Fast Ray Tracing on {BSP}-Trees",
+      year =         "1987",
+      type =         "M.Sc. Thesis",
+      school =       "Department of Computer Science, University of Central
+		     Florida",
+      keywords =     "hierarchies",
+      annote =       "Based on these analyses and experiments, the BSP-Trace
+		     Method may not be the best solution for speeding up the
+		     ray tracing, but it is worthwhile subject for research.
+		     The potential drawbacks of the BSP-Trace which make it
+		     no better than the Octree Method are: \\ (1) The number
+		     of surfaces on the BSP-Tree is typically far more than
+		     the original number of surfaces, because of the
+		     splitting of surfaces into two by other surfaces'
+		     planes; \\ (2) The Octree Method only needs to test
+		     those objects which reside in the selected voxels, and
+		     the BSP-Trace needs to consider the objects in the
+		     whole half-space. \\ [FUJI86] mentioned that the memory
+		     requirement for the octree is very costly, but for the
+		     BSP-Tree, it can be taken care of very efficiently. The
+		     bottleneck of the Octree Method is the time spent on
+		     traveling up and down the Octree [FUJI86], and our
+		     experiments show that this time is around 35\% of the
+		     total time. The solution to reduce the traveling time
+		     is to lower the height of the octree, but meanwhile the
+		     increase in the number of objects contained in the
+		     voxel means more intersections per ray. Thus, a new
+		     data structure for fast ray tracing which combines the
+                     Octree and BSP-Tree is proposed. \\ The new data
+                     structure contains an octree on the top, and every leaf
+                     voxel consists of a BSP-Tree. This will cut down both
+                     the tree traveling time (by lowering the tree height)
+                     and the memory consumed by the octree. Also, if we can
+                     keep the number of objects inside the voxel down, the
+                     increased number of surfaces by using the BSP-Tree is
+		     limited. This thus will reduce the number of
+		     intersection tests made inside the voxel.",
+}
+
+
+@InProceedings{devillers89b,
+        author =       "Olivier Devillers",
+        title =        "Tools to Study the Efficiency of Space Subdivision
+                       Structures for Ray Tracing",
+        pages =        "467--481",
+        booktitle =      "Proceedings of the PIXIM '89",
+        year =         "1989",
+        annote =       "Space Subdivision structures are often used to improve
+                       the performance of ray tracing. The subject of this
+                       article is to study theoretically the effects of the
+                       subdivision on the CPU time. The average number of
+                       regions crossed by a ray is calculated in several cases
+                       of subdivision. \\ With a space subdivision scheme, the
+                       complexity of ray tracing is due to two main factors:
+                       computation of the intersections within a region, and
+                       computation of the sequence of regions intersected by a
+                       given ray. The complexity of these two points is
+                       studied. The distribution of the objects among the
+                       regions is evaluated, and a method to compute the
+                       average number of regions crossed by a ray for a given
+                       method of subdivisions is proposed. This method is
+                       applied to some usual space subdivision techniques:
+                       octree, bounding boxes, grid, and macro-regions.",
+}
+
+@InProceedings{dAmore:1992:OBP,
+  author =       "F. d'Amore and P. G. Franciosa",
+  title =        "On the optimal binary plane partition for sets of
+                 isothetic rectangles",
+  booktitle =    "Proc. 4th Canad. Conf. Comput. Geom.",
+  year =         "1992",
+  pages =        "1--5",
+}
+
+@InProceedings{Chin:1992:FOP,
+  author =       "Norman Chin and Steven Feiner",
+  title =        "Fast object-precision shadow generation for areal
+		 light sources using {BSP} trees",
+  pages =        "21--30",
+  booktitle =    "Computer Graphics (1992 Symposium on Interactive 3D
+		 Graphics)",
+  volume =       "25",
+  number =       "2",
+  year =         "1992",
+  month =        mar,
+  editor =       "David Zeltzer",
+  conference =   "held in Boston; 29 March - 1 April 1992",
+  keywords =     "shadow volume, area light source, penumbra, umbra",
+  annote =       "",
+}
+
+@InProceedings{Chrysanthou:1995:SVB,
+  author =       "Yiorgos Chrysanthou and Mel Slater",
+  title =        "Shadow Volume {BSP} Trees for Computation of Shadows
+                 in Dynamic Scenes",
+  editor =       "Pat Hanrahan and Jim Winget",
+  pages =        "45--50",  
+  booktitle =    "1995 Symposium on Interactive {3D} Graphics",
+  year =         "1995",
+  organization = "ACM SIGGRAPH",
+  month =        apr,
+  note =         "ISBN 0-89791-736-7",
+}
+
+@MastersThesis{macdonald88a,
+  author =       "David MacDonald",
+  title =        "Space Subdivision Algorithms for Ray Tracing",
+  year =         "1988",
+  type =         "M.Sc. Thesis",
+  school =       "Department of Computer Science, University of
+                 Waterloo",
+  annote =       "Ray tracing provides computer rendering of synthetic
+                 images with many realistic qualities, but is
+                 computationally expensive. Ray tracing requires testing
+                 of rays against a scene to see which objects, if any,
+                 are intersected. The high number of such tests required
+                 by typical ray tracers contributes significantly to the
+                 computational expense of ray tracing. \\ An efficient
+                 method of reducing the computation involved in the
+                 intersection tests is to organize the objects composing
+                 the scene into one of several types of hierarchical
+                 data structures. \\ This thesis describes algorithms
+                 for the construction, storage, and traversal of the
+                 space subdivision hierarchy. Methods are suggested for
+                 decreasing computational requirements of the data
+                 structure with respect to these three areas. \\ One
+                 suggested strategy for improving performance in all
+                 three areas (construction, storage, and traversal) is
+                 implemented for the bintree structure. The performance
+                 of these simulations is compared with implementations
+                 of contemporary methods and some efficiency gains are
+                 shown. \\ Further work is suggested, including
+                 adaptation of some of the ideas presented within this
+                 thesis to more general types of hierarchical
+                 structures.",
+}
+
+@TechReport{Quek:1988:ESS,
+  author =       "Lee Hian Quek and D. D. Hearn",
+  title =        "Efficient Space-Subdivision Methods in Ray-Tracing
+                 Algorithms",
+  year =         "1988",
+  month =        nov,
+  number =       "UIUCDCS-R-88-1468",
+  type =         "Report No.",
+  institution =  "Dept. of Computer Science, Univ. of Illinois at
+                 Urbana-Champaign",
+  keywords =     "efficiency",
+  anote  = "Ray tracing provides a simple and powerful tool for the
+generation of highly realistic displays. However, it is a computationally
+expensive approach. A basic ray-tracing algorithm employing no antialiasing
+may require several hours to render a scene of moderate complexity. Methods
+for attaining higher picture quality, such as supersampling, adaptive
+sampling, and distributed sampling, require even longer ray-processing
+times. One method for improving the performance of ray-tracing algorithms is
+to reduce ray-object intersection calculations by employing spatial
+subdivision techniques to group objects in a scene. Here, we consider some
+improvements that can be made to space-subdivision ray tracers by reducing
+ray-traversal calculations and by implementing the algorithms on parallel
+vector architectures.",
+}
+
+@Book{Semwal:1992:RTU,
+  author =       "Sudhanshu Kumar Semwal and Charulata K. Kearney and J.
+                 Michael Moshell",
+  title =        "Ray Tracing Using the Slicing Extent Technique",
+  year =         "1992",
+  publisher =    "International Conference on 3D Graphics (?)",
+  anote = "We present a novel approach to ray tracing called the Slicing
+Extent Technique (SET) and its variations. SET partitions object space with
+slicing planes perpendicular to all three axes. Slicing planes are divided
+into two dimensional rectangular cells, which contain pointers to nearby
+objects. The novelty of SET is that rather than using a collection of
+volumes as an extent, SET uses a collection of planar cells and is based on
+analysis of projections of objects onto slicing planes. These rectangular
+cells are used to quickly traverse through the sparse area of the scene and
+also provide further subdivision in the highly populated dense area. These
+2D cells can also define tighter extents. In comparison to the existing
+space subdivision techniques for ray tracing, SET avoids tree traversal and
+multiple ray-object intersections. It guarantees no increase in image
+generation time when number of cells per slice increase in multiples of
+four. There is no reorganization when new objects arrive and preprocessing
+to create slices is inexpensive.",
+}
+
+TechReport{Wilson92b,
+  author =       "Tom Wilson and Narsingh Deo",
+  title =        "Extent Tracing: Algorithm and Implementation",
+  institution =  "Department of Computer Science, University of Central
+                 Florida",
+  type =         "Technical Report",
+  number =       "CS-TR-92-34",
+  month =        dec,
+  year =         "1992",
+  keywords =     "efficiency",
+  anote = "This paper describes a new ray tracing acceleration algorithm
+called extent tracing. The algorithm works on a structure that is
+conceptually related to a hierarchical tree of extents (HTE), but does not
+require the hierarchy. To speed up extent tracing, spatial subdivision is
+added, resulting in a nonuniform subdivision grid. Implementation details
+and the results of comparisons to some other established acceleration
+techniques are given.",
+}
+
+@TechReport{Wilson92,
+  author =       "Tom Wilson and Narsingh Deo",
+  title =        "Comparing Extent Tracing to Other Ray Tracing
+                 Accelerators",
+  institution =  "Department of Computer Science, University of Central
+                 Florida",
+  type =         "Technical Report",
+  number =       "CS-TR-92-21",
+  month =        sep,
+  year =         "1992",
+  keywords =     "efficiency",
+  anote = "This report examines the feasibility of a new ray-tracing
+acceleration scheme called extent tracing by comparing it to some
+established techniques on established benchmark scenes. The other techniques
+implemented for comparison are binary space-partitioning (BSP) tree,
+hierarchical tree of extents (HTE), octree, and uniform subdivision. The
+statistics used in the comparison are the execution times, memory
+requirements, object intersections per ray, bounding volume intersections
+per ray, and voxels traversed per ray.",
+}
+
+@TechReport{Wilson92a,
+  author =       "Tom Wilson and Narsingh Deo",
+  title =        "Acceleration Schemes for Ray Tracing",
+  institution =  "Department of Computer Science, University of Central
+                 Florida",
+  type =         "Technical Report",
+  number =       "CS-TR-92-22",
+  month =        sep,
+  year =         "1992",
+  keywords =     "efficiency",
+}
+
+@InProceedings{Speer:1985:TEA,
+  author =       "L. R. Speer and T. D. Derose and B. A. Barsky",
+  title =        "A Theoretical and Empirical Analysis of Coherent
+                 Ray-Tracing",
+  booktitle =    "Graphics Interface '85 Proceedings",
+  pages =        "1--8",
+  year =         "1985",
+  editor =       "M. Wein and E. M. Kidd",
+  organization = "Canadian Inf. Process. Soc.",
+  conference =   "held in Montreal, Quebec, Canada; 27--31 May 1985",
+  keywords =     "I37 ray-tracing, I37 image synthesis, I30 picture
+                 processing",
+  annote =       "The use of {\em coherence} has been advocated as a
+                 means of reducing the large computational cost of the
+                 ray-tracing method of image synthesis. This paper
+                 examines the theoretical and empirical performance of a
+                 typical coherent ray-tracing algorithm, one that
+                 exploits the similarity between the intersection trees
+                 generated by successive rays. It is shown that despite
+                 the large degree of coherence present in a scene, the
+                 need to ensure the validity of ray-object intersections
+                 prevents any significant computational savings. This
+                 indicates that other algorithmic methods must be used
+                 in order to substantially reduce the computational cost
+                 of ray-traced imagery.",
+}
+
+@InProceedings{Isler:1991:HSS,
+  author =       "Veysi Isler and Cevdet Aykanat and Bulent
+                 {\"{O}}zgu\c{c}",
+  title =        "A heuristic 3{D} space subdivision algorithm for ray
+                 tracing",
+  pages =        "499--504",
+  booktitle =    "COMPUGRAPHICS '91",
+  volume =       "I",
+  year =         "1991",
+  conference =   "held in Sesimbra, Portugal; 16-20 September 1991",
+}
+
+@Article{Bouville??,
+  author =       "Christian Bouville and Jean-Luc Dubois and Isabelle
+                 Marchal",
+  title =        "A Space Tracing Method Applied to Polygonal Models",
+  journal =      "course paper",
+  year = "???",
+  anote = " The ray-tracing rendering method gives the highest possible
+level of realism that can be attained in computer graphics. Recently many
+alternatives have been reported on ways to speed up this process and
+particularly by means of a space subdivision technique. We propose such an
+algorithm specially adapted to polygonal models. A BSP tree technique is
+used to perform space subdivision and a spatial index allows direct access
+to any cell. A method which minimizes primary ray computations and an
+algorithm which avoids the tracing of a large number of rays towards light
+sources have been studied. Results about time and space required by this
+algorithm are presented.",
+}
+
+@Article{Kalinowski94,
+       author= "Kalinowski J. and Sas J.",
+        title= "Acceleration Techniques for Ray Tracing - Experimental 
+		 Comparison",
+      journal= "MICROCOMPUTER '94 Computer Graphics and Vision",
+      month  = "feb",
+      year   = "1994",
+      pages  = "??-??", 
+      place  = "Zakopane in Poland",
+      note   = "uniform subdivision",
+      anote  = "In this paper the experimental results of applying a series
+of acceleration methods to the ray tracing process are presented. The
+acceleration possibilities at two stages have been distinguished: the stage
+of ray traversal through the scene space and ray-triangle intersection
+testing stage. At the first stage uniform space subdivision has been
+compared with two level n-tree schema. At the stage of ray-triangle
+intersection testing the computational complexity of the set of algorithms
+has been compared and the gains obtained as a result of a series of
+improvements to the ordinary algorithm are presented.",
+}
+
+
+
+@article{vko91,
+  author="M. van Kreveld and H. Overmars",
+  title="Divided k-d Trees",
+  journal="Algorithmica",
+  year="1991",
+  volume="6",
+  number="",
+  pages="840-858"
+}
Index: trunk/VUT/doc/SciReport/Bib/bookmame.bib
===================================================================
--- trunk/VUT/doc/SciReport/Bib/bookmame.bib	(revision 243)
+++ trunk/VUT/doc/SciReport/Bib/bookmame.bib	(revision 243)
@@ -0,0 +1,27 @@
+@Book{bib:Samet89a,
+  author =       "H. J. Samet",
+  title =        "Design and analysis of Spatial Data Structures:   
+                 Quadtrees, Octrees, and other Hierarchical Methods",
+  publisher =    "Addison--Wesley",
+  address =      "Redding, MA",
+  year =         "1989",
+}
+
+@Book{Cormen90,
+ author="T.H. Cormen and C.E. Leiserson and R.L. Rivest",
+ title="Introduction to Algorithms",
+ isbn="ISBN 0-262-03141-8 (MIT Press), ISBN-0-07-013143-0 (McGrawHill)",
+ publisher = "MIT Press",
+ year="1990, tenth printing 1993",
+}
+
+@InBook{arvo89a,
+        author =       "James Arvo and David Kirk",
+        title =        "A survey of ray tracing acceleration techniques",
+        pages =        "201--262",
+        booktitle =    "An introduction to ray tracing",
+        year =         "1989",
+        publisher =    "Academic Press",
+}
+
+
Index: trunk/VUT/doc/SciReport/Bib/minimum.bib
===================================================================
--- trunk/VUT/doc/SciReport/Bib/minimum.bib	(revision 243)
+++ trunk/VUT/doc/SciReport/Bib/minimum.bib	(revision 243)
@@ -0,0 +1,912 @@
+% wanted
+
+@TechReport{fussell88a,
+        author =       "Donald Fussell and K. R. Subramanian",
+        title =        "Fast Ray Tracing Using {K}-{D} Trees",
+        institution =  "U. of Texas, Austin, Dept. Of Computer Science",
+        type =         "Technical Report",
+        number =       "TR-88-07",
+        month =        mar,
+        year =         "1988",
+        keywords =     "hierarchies",
+}
+
+@INPROCEEDINGS{Heckbert92discon,
+AUTHOR={Paul S. Heckbert},
+TITLE={Discontinuity Meshing for Radiosity},
+BOOKTITLE={Third Eurographics Workshop on Rendering},
+MONTH={May},
+YEAR={1992},
+ADDRESS={Bristol, UK},
+PAGES={203-216},
+KEYWORDS={radiosity, adaptive mesh, visibility},
+}
+
+@InProceedings{kaplan85a,
+        author =       "M. Kaplan",
+        title =        "Space-Tracing: {A} Constant Time Ray-Tracer",
+        pages =        "149--158",
+        booktitle =    "SIGGRAPH '85 State of the Art in Image Synthesis seminar
+ notes",
+        year =         "1985",
+        month =        jul,
+        publisher =    "Addison Wesley",
+        keywords =     "ray tracing cull",
+}
+
+
+% collected
+
+@InProceedings{Greene93a,
+  author =       "N. Greene and M. Kass and G. Miller",
+  title =        "Hierarchical {Z}-Buffer Visibility",
+  booktitle =    "Computer Graphics (Proceedings of SIGGRAPH '93)",
+  year =         "1993",
+  pages =        "231--238"
+}
+
+@InProceedings{thibault87a,
+author =       "William C. Thibault and Bruce F. Naylor",
+title =        "Set Operations on Polyhedra Using Binary Space
+Partitioning Trees",
+pages =        "153--162",
+booktitle =      "Proceedings of SIGGRAPH '87",
+volume =       "21",
+year =         "1987",
+month =        jul,
+keywords =     "polyhedra, set operations, geometric modeling,
+geometric search, point location",
+}
+
+@InProceedings{Coorg96b
+, author =	"Coorg, Satyan and Teller, Seth"
+, title =	"Temporally Coherent Conservative Visibility"
+, booktitle =	"Proceedings of the Twelfth Annual ACM Symposium on Computational Geometry"
+, year =	1996
+, optaddress =	"Philadelphia, PA"
+, month =	may
+, documentURL =	"http://graphics.lcs.mit.edu/~satyan/pubs/temporalvis-cg96.ps.Z"
+, pages = "78--87"
+}
+
+@InProceedings{Coorg97,
+  author =       "Satyan Coorg and Seth Teller",
+  title =        "Real-Time Occlusion Culling for Models with Large
+                 Occluders",
+  pages =        "83--90",
+  ISBN =         "0-89791-884-3",
+  booktitle =    "Proceedings of the Symposium on Interactive 3{D}
+                 Graphics",
+  optmonth =        apr # "27--30~",
+  publisher =    "ACM Press",
+  optaddress =      "New York",
+  year =         "1997",
+}
+
+@InProceedings{Rohlf:1994:IPH,
+  author =       "John Rohlf and James Helman",
+  booktitle =    "Proceedings of SIGGRAPH '94",
+  title =        "{IRIS} Performer: {A} High Performance Multiprocessing
+                 Toolkit for Real--{T}ime 3{D} Graphics",
+  pages =        "381--395",
+  month =        jul,
+  year =         "1994",
+}
+
+@InProceedings{Airey90,
+  author =       "Airey, John M. and Rohlf, John H. and {Brooks, Jr.}, Frederick P.",
+  title =        "Towards Image Realism with Interactive Update Rates in
+                 Complex Virtual Building Environments",
+  pages =        "41--50",
+  booktitle =    "1990 Symposium on Interactive 3D Graphics",
+  organization = "ACM SIGGRAPH",
+  year =         "1990",
+  optmonth =        mar,
+  keywords =     "model-space subdivision, potentially visible,
+                 radiosity, adaptive refinement",
+}
+
+@inproceedings{Teller93a
+, author =	"Teller, S. and Hanrahan, P."
+, title =	"Global visibility algorithms for illumination computations"
+, booktitle =	"Proceedings of SIGGRAPH '93"
+, year =	1993
+, pages =	"239--246"
+, keywords =	"hidden surface removal, visibility space, radiosity,
+		 global illumination, algorithmic triage"
+, documentURL =	"http://www.cs.princeton.edu/staff/seth/visglobillum.ps.Z"
+, abstractURL =	"http://www.cs.princeton.edu/gfx/papers/visglob"
+}
+
+@InProceedings{Teller91a
+, author =	"S. J. Teller and C. H. S{\'e}quin"
+, title =	"Visibility Preprocessing For Interactive Walkthroughs"
+, booktitle =	"Proceedings of SIGGRAPH '91"
+, month =	jul
+, year =	1991
+, pages =	"61--69"
+, keywords =     "architectural simulation, linear programming, superset visibility"
+}
+
+@phdthesis{Teller92b
+, author =       "Teller, Seth Jared"
+, title =	"Visibility Computations in Densely Occluded Polyhedral Environments"
+, school =	"Dept. of Computer Science, University of California"
+, address =	"Berkeley"
+, year =	1992
+, keywords =	"graphics, visibility preprocessing, linear programming, spatial decomposition, visibility graphs, Plucker coordinates"
+, documentURL =	 "ftp://tr-ftp.cs.berkeley.edu/pub/tech-reports/csd/csd-92-708/all.ps"
+, note =         "Also available as Technical Report UCB//CSD-92-708"
+}
+
+@article{Yagel95a
+, author =      "Yagel, R. and Ray, W."
+, year =        1995
+, title =       "Visibility Computation for Efficient Walkthrough of Complex Environments"
+, journal =	"Presence: Teleoperators and Virtual Environments"
+, volume =      5
+, number =      1
+, page =        "45-60"
+, documentURL = "http://www.cis.ohio-state.edu/volviz/Papers/1995/presence.ps.gz"
+}
+
+@techreport{Georges95a
+, author	= "Georges, Chris"
+, title 	= "Obscuration Culling on Parallel Graphics Architectures"
+, institution =	"Department of Computer Science, University of N. Carolina, Chapel Hill"
+, number	= "TR95-017"
+, year		= 1995
+, documentURL	= "ftp://ftp.cs.unc.edu/pub/publications/techreports/95-017.ps.Z"
+}
+
+@InProceedings{Chin:1992:FOP,
+  author =       "Norman Chin and Steven Feiner",
+  title =        "Fast object-precision shadow generation for areal
+		 light sources using {BSP} trees",
+  pages =        "21--30",
+  booktitle =    "Computer Graphics (1992 Symposium on Interactive 3D
+		 Graphics)",
+  volume =       "25",
+  number =       "2",
+  year =         "1992",
+  month =        mar,
+  editor =       "David Zeltzer",
+  conference =   "held in Boston; 29 March - 1 April 1992",
+  keywords =     "shadow volume, area light source, penumbra, umbra",
+  annote =       "",
+}
+
+@Article{Moravec:1981:GWT,
+  author =       "Hans P. Moravec",
+  title =        "{3D} Graphics and the Wave Theory",
+  journal =      "Computer Graphics",
+  volume =       "15",
+  number =       "3",
+  pages =        "289--296",
+  month =        aug,
+  year =         "1981",
+  coden =        "CGRADI, CPGPBZ",
+  ISSN =         "0097-8930",
+  annote =       "A general overview of a new way of viewing light for
+                 computer graphics. He suggests using waves as the
+                 basis, and discusses the computational requirements and
+                 new capabilities. illumination by wave fronts, rather
+                 than light rays \\ A continuing trend in computer
+                 representation of three dimensional synthetic scenes is
+                 the ever more accurate modelling of complex
+                 illumination effects. Such effects provide cues
+                 necessary for a convincing illusion of reality. The
+                 best current methods simulate multiple specular
+                 reflections and refractions, but handle at most one
+                 scattering bounce per light ray. They cannot accurately
+                 simulate diffuse light sources, nor indirect lighting
+                 via scattering media, without prohibitive increases in
+                 the already very large computing costs. \\ Conventional
+                 methods depend implicitly on a {\em particle} model;
+                 light propagates in straight and conceptually
+                 infinitely thin rays. This paper argues that a {\em
+                 wave} model has important computational advantages for
+                 the complex situations. In this approach, light is
+                 represented by wave fronts which are stored as two
+                 dimensional arrays of complex numbers. \\ The
+                 propagation of such a front can be simulated by a
+                 linear transform. Several advantages accrue.
+                 Propagations in a direction orthogonal to the plane of
+                 a front are convolutions which can be done by FFT in
+                 $O(n \log n)$ time rather than the $n^{2}$ time for a
+                 similar operation using rays. A typical speedup is
+                 about 10,000. The wavelength of the illumination sets a
+                 resolution limit which prevents unnecessary computation
+                 of elements smaller than will be visible. The generated
+                 wavefronts contain multiplicities of views of the
+                 scene, which can be individually extracted by passing
+                 them through different simulated lenses. Lastly the
+                 wavefront calculations are ideally suited for
+                 implementation on available array processors, which
+                 provide more cost effective calculation for this task
+                 than general purpose computers. \\ The wave method
+                 eliminates the aliasing problem; the wavefronts are
+                 inherently spatially filtered, but substitutes
+                 diffraction effects and depth of focus limitations in
+                 its stead.",
+  conference =   "held in Dallas, Texas; July 1981",
+  keywords =     "I30 wave theory, effects, parallel processing",
+}
+
+
+@Article{Rajkumar:1996:RFBSP,
+  author = 	 {A. Rajkumar and B.F. Naylor and F. Feisullin and L. Rogers},
+  title = 	 {Predicting RF coverage in large environments using
+ray--beam tracing and partitioning tree represented geometry},
+  journal = 	 {Wireless Netwoks},
+  year = 	 {1996},
+  volume = 	 {2},
+  pages = 	 {143--154},
+}
+
+@TechReport{Teller:1998:FC,
+  author = 	 {Seth Teller and John Alex},
+  title = 	 {Frustum casting for progressive, interactive rendering},
+  institution =  {MIT},
+  year = 	 {1998},
+  number = 	 {MIT LCS TR--740},
+  month = 	 {January},
+}
+
+@InProceedings{Lukaszewski98,
+  author =       "A. Lukaszewski and A. Formella",
+  title =        "Fast Penumbra Calculation in Ray Tracing",
+  booktitle =    "Proceedings of WSCG'98, the 6th International
+                 Conference in Central Europe on Computer Graphics and
+                 Visualization '98",
+  pages =        "238--245",
+  month =        feb,
+  year =         "1998",
+  keywords =     "shadow computation, stochastic ray tracing, bounding
+                 volumes",
+}
+
+
+
+@TechReport{Havran97:rep,
+  author = {Havran, V.},
+  title = {Spatial Data Structures for Visibility Computation},
+  institution = {CTU--FEE Prague},
+  number = {DC-PSR-97-05},
+  month = {May},
+  year = {1997},
+  note = {Postgraduate Study Report, 34 pages, also available as
+          ftp://www.cgg.cvut.cz/{}outgoing/havran/minimum/{}dc-psr-97-04.ps.gz},
+}
+
+@PhdThesis{Grant92,
+  author =       "Charles W. Grant",
+  title =        "Visibility Algorithms in Image Synthesis",
+  school =       "U. of California, Davis",
+  year =         "1992",
+  keywords =     "z buffer, ray tracing, shadow, taxonomy",
+  annote =       "partial electronic version available from
+                 grant1@llnl.gov, A successor to
+                 Sutherland-Sproull-Schumacker, Comput. Surv. 74",
+}
+
+@InProceedings{Berg93,
+  author =       "M. de Berg",
+  title =        "Generalized hidden surface removal",
+  pages =        "1--10",
+  ISBN =         "0-89791-582-8",
+  editor =       "ACM-SIGACT ACM-SIGGRAPH",
+  booktitle =    "Proceedings of the 9th Annual Symposium on
+                 Computational Geometry ({SCG} '93)",
+  address =      "San Diego, CA, USA",
+  month =        may,
+  year =         "1993",
+  publisher =    "ACM Press",
+}
+
+@Article{Franklin:1990:POH,
+  author =       "W. Randolph Franklin and Mohan S. Kankanhalli",
+  editor =       "Forest Baskett",
+  title =        "Parallel Object-Space Hidden Surface Removal",
+  journal =      "Computer Graphics",
+  volume =       "24",
+  number =       "4",
+  pages =        "87--94",
+  month =        aug,
+  year =         "1990",
+  coden =        "CGRADI, CPGPBZ",
+  ISSN =         "0097-8930",
+  conference =   "held in Dallas, Texas; 6--10 August 1990",
+}
+
+@Book{Foley90,
+  author =       "James D. Foley and Andries van Dam and Steven K.
+                 Feiner and John F. Hughes",
+  title =        "Computer Graphics: Principles and Practice",
+  edition =      "2nd",
+  pages =        "1174",
+  publisher =    "Addison-Wesley Publishing Co.",
+  address =      "Reading, MA",
+  year =         "1990",
+  mrnumber =     "B.Foley.90",
+  ISBN =         "0-201-12110-7",
+  contents =     "(not listed)",
+}
+
+@InProceedings{Zhang:1997:FBC,
+  author =       "Hansong Zhang and Kenneth E. {Hoff III}",
+  title =        "Fast Backface Culling Using Normal Masks",
+  booktitle =    "1997 Symposium on Interactive {3D} Graphics",
+  pages =        "103--106",
+  year =         "1997",
+  editor =       "Michael Cohen and David Zeltzer",
+  month =        apr,
+  organization = "ACM SIGGRAPH",
+  note =         "ISBN 0-89791-884-3",
+}
+
+@Article{tvcg-1997-21,
+  author =       "Kalpathi R. Subramanian and Bruce F. Naylor",
+  title =        "{Converting Discrete Images to Partitioning Trees}",
+  journal =      "IEEE Transactions on Visualization and Computer
+                 Graphics",
+  volume =       "3",
+  number =       "3",
+  month =        jul,
+  year =         "1997",
+  pages =        "273--?",
+  abstract =     "The discrete space representation of most scientific
+                 datasets (pixels, voxels, etc.), generated through
+                 instruments or by sampling continuously defined fields,
+                 while being simple, is also verbose and structureless.
+                 We propose the use of a particular spatial structure,
+                 the {\em binary space partitioning tree}, or, simply,
+                 {\em partitioning tree}, as a new representation to
+                 perform efficient geometric computation in discretely
+                 defined domains. The ease of performing affine
+                 transformations, set operations between objects, and
+                 correct implementation of transparency (exploiting the
+                 visibility ordering inherent to the representation)
+                 makes the partitioning tree a good candidate for
+                 probing and analyzing medical reconstructions, in such
+                 applications as surgery planning and prostheses design.
+                 The multiresolution characteristics of the
+                 representation can be exploited to perform such
+                 operations at interactive rates by smooth variation of
+                 the amount of geometry. Application to ultrasound data
+                 segmentation and visualization is proposed. The paper
+                 describes methods for constructing partitioning trees
+                 from a discrete image/volume data set. Discrete space
+                 operators developed for edge detection are used to
+                 locate discontinuities in the image from which
+                 lines/planes containing the discontinuities are fitted
+                 by using either the Hough transform or a hyperplane
+                 sort. A multiresolution representation can be generated
+                 by ordering the choice of hyperplanes by the magnitude
+                 of the discontinuities. Various approximations can be
+                 obtained by pruning the tree according to an error
+                 metric. The segmentation of the image into edgeless
+                 regions can yield significant data compression. A
+                 hierarchical encoding schema for both lossless and
+                 lossy encodings is described.",
+  keywords =     "-Partitioning trees, BSP trees, space partitioning,
+                 miltiresolution representations, image reconstruction,
+                 image coding, scientific visualization, MRI
+                 visualization",
+  tvcg-abstract-url = "http://www.computer.org/tvcg/tg1997/v0273abs.htm",
+  tvcg-pdf-url = "http://pdf.computer.org/tg/books/tg1997/pdf/v0273.pdf",
+}
+
+@InProceedings{Murali:1997:CSB,
+  author =       "T. M. Murali and Thomas A. Funkhouser",
+  title =        "Consistent Solid and Boundary Representations from
+                 Arbitrary Polygonal Data",
+  booktitle =    "1997 Symposium on Interactive {3D} Graphics",
+  pages =        "155--162",
+  year =         "1997",
+  editor =       "Michael Cohen and David Zeltzer",
+  month =        apr,
+  organization = "ACM SIGGRAPH",
+  note =         "ISBN 0-89791-884-3",
+}
+
+
+
+@InProceedings{Stewart:1998:AVM,
+  author = 	 {A. J. Stewart and T. Karkanis},
+  title = 	 {Computing the approximate visibility map, with applications to form factors and discontinuity meshing},
+  booktitle =    "Proceedings of the Ninth
+                 Eurographics Workshop on Rendering",
+  pages =        "57--68",
+  year  =        "1998",
+}
+
+
+@Article{Bishop:1998:DPG,
+  author =       "Lars Bishop and Dave Eberly and Turner Whitted and
+                 Mark Finch and Michael Shantz",
+  title =        "Designing a {PC} Game Engine",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "18",
+  number =       "1",
+  pages =        "46--53",
+  month =        jan # "\slash " # feb,
+  year =         "1998",
+  coden =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Thu Feb 26 12:06:17 MST 1998",
+  url =          "http://computer.org/cga/cg1998/g1046abs.htm;
+                 http://dlib.computer.org/cg/books/cg1998/pdf/g1046.pdf",
+  acknowledgement = ack-nhfb,
+}
+
+
+@TechReport{Wimmer:1998:FWIC,
+  author = 	 {M. Wimmer and M. Giegl and D. Schmalstieg},
+  title = 	 {Fast Walkthroughs with Image Caches and Ray Casting},
+  institution =  {Institut f\"ur Computergraphik, TU Wien},
+  year = 	 {1998},
+  number =       {TR-186-2-98-30},
+  month = 	 {December},
+}
+
+@TechReport{Wonka:1999:OSFW,
+  author = 	 {P. Wonka and D. Schmalstieg},
+  title = 	 {Occluder Shadows for Fast Walkthroughs of
+                  Urban Environments},
+
+  institution =  {Institut f\"ur Computergraphik, TU Wien},
+  year = 	 {1999},
+  number =       {TR-186-2-99-03},
+  month = 	 {January},
+}
+
+@TechReport{Szirmay-Kalos98a,
+  author =       "Laszlo Szirmay-Kalos",
+  title =        "Global Ray-bundle Tracing",
+  institution =  "Vienna University of Technology",
+  type =         "Technical Report,",
+  number =       "TR-186-2-98-18",
+  address =      "Vienna",
+  year =         "1998",
+}
+
+@InProceedings{Szirmay-Kalos98b,
+  author =       "Laszlo Szirmay-Kalos and Werner Purgathofer",
+  title =        "Global Ray-bundle Tracing with Hardware Acceleration",
+  booktitle =    "Ninth Eurographics Workshop on Rendering",
+  address =      "Vienna, Austria",
+  month =        jun,
+  year =         "1998",
+  keywords =     "hardware",
+}
+
+@InProceedings{Snyder:1998:VSC,
+  author =       "John Snyder and Jed Lengyel",
+  title =        "Visibility Sorting and Compositing Without Splitting
+                 for Image Layer Decomposition",
+  booktitle =    "SIGGRAPH 98 Conference Proceedings",
+  editor =       "Michael Cohen",
+  series =       "Annual Conference Series",
+  year =         "1998",
+  organization = "ACM SIGGRAPH",
+  publisher =    "Addison Wesley",
+  month =        jul,
+  pages =        "219--230",
+  note =         "ISBN 0-89791-999-8",
+  keywords =     "visibility sorting, compositing, nonsplitting layered
+                 decomposition, occlusion cycle, occlusion graph,
+                 sprite, kd-tree",
+  annote =       "We present an efficient algorithm for visibility
+                 sorting a set of moving geometric objects into a
+                 sequence of image layers which are composited to
+                 produce the final image. Instead of splitting the
+                 geometry as in previous visibility approaches, we
+                 detect mutual occluders and resolve them using an
+                 appropriate image compositing expression or merge them
+                 into a single layer. Such an algorithm has many
+                 applications in computer graphics; we demonstrate two:
+                 rendering acceleration using image interpolation and
+                 visibility-correct depth of field using image blurring.
+                 We propose a new, incremental method for identifying
+                 mutually occluding sets of objects and computing a
+                 visibility sort among these sets. Occlusion queries are
+                 accelerated by testing on convex bounding hulls; less
+                 conservative tests are also discussed. Kd-trees formed
+                 by combinations of directions in object or image space
+                 provide an initial cull on potential occluders, and
+                 incremental collision detection algorithms are adapted
+                 to resolve pairwise occlusions, when necessary. Mutual
+                 occluders are further analyzed to generate an image
+                 compositing expression; in the case of nonbinary
+                 occlusion cycles, an expression can always be generated
+                 without merging the objects into a single layer.
+                 Results demonstrate that the algorithm is practical for
+                 real-time animation of scenes involving hundreds of
+                 objects each comprising hundreds or thousands of
+                 polygons.",
+}
+
+@InProceedings{Plantinga:1990:RTH,
+  author =       "Harry Plantinga and Charles R. Dyer and W. Brent
+                 Seales",
+  title =        "Real-Time Hidden-Line Elimination for a Rotating
+                 Polyhedral Scene Using the Aspect Representation",
+  pages =        "9--16",
+  booktitle =    "Proceedings of Graphics Interface '90",
+  year =         "1990",
+  month =        may,
+  conference =   "held in Halifax, Nova Scotia; 14-18 May 1990",
+}
+
+@PhdThesis{Chrysantho1996a,
+  author =       "Yiorgos Chrysanthou",
+  school =       "QMW, Dept of Computer Science",
+  title =        "Shadow Computation for 3{D} Interaction and
+                 Animation",
+  year =         "1996",
+  keywords =     "Technical Report No. 715",
+  month =        jan,
+  scope =        "ace",
+}
+
+
+
+@PhdThesis{Campbell91,
+  author =       "A. T. {Campbell, III}",
+  title =        "Modeling Global Diffuse Illumination for Image
+                 Synthesis",
+  school =       "CS Dept, University of Texas at Austin",
+  year =         "1991",
+  month =        dec,
+  note =         "Tech. Report TR-91-39",
+  keywords =     "mesh generation, radiosity, penumbra, shadow",
+  pages =        "155",
+  abstract =     "Rapid developments in the design of algorithms for
+                 rendering globally illuminated scenes have taken place
+                 in the past five years. Net energy methods such as
+                 radiosity algorithms have become effective at computing
+                 the energy balance for scenes containing diffusely
+                 reflecting objects. Such methods first break up a scene
+                 description into a large set of elements, or possibly
+                 several levels of elements. Energy transfers among
+                 these elements are then determined using a variety of
+                 means. While much progress has been made in the design
+                 of energy transfer algorithms, little or no attention
+                 has been paid to the proper generation of the mesh of
+                 surface elements. This dissertation presents a
+                 technique for adaptively creating a mesh of surface
+                 elements as the energy transfers are computed. The
+                 method allows large numbers of small elements to be
+                 placed at parts of the scene where the most active
+                 energy transfers occur without requiring that other
+                 parts of the scene be subdivided needlessly to the same
+                 degree. As a result, the computational effort in the
+                 energy transfer computations can be concentrated where
+                 it has the most effect. Since the sources of direct and
+                 indirect illumination in the scene are polygonal
+                 elements, the effects of light sources with finite area
+                 must be computed. Most methods simplify the problem by
+                 approximating the area source with a collection of
+                 point sources. We present an object space algorithm to
+                 model illumination from polygonal light sources
+                 analytically. The result is a collection of
+                 smooth-shaded polygonal facets that may be rendered
+                 from any viewing position. Binary Space Partitioning
+                 trees are used to compute umbra and penumbra boundaries
+                 efficiently. Fast analytic techniques are developed for
+                 illumination calculations. Numerical optimization
+                 methods ensure that the shading function is sampled
+                 finely enough to find all significant illumination
+                 gradations. Illumination calculations are optimized to
+                 concentrate computational effort on parts of the scene
+                 where they are most needed.",
+}
+
+@PhdThesis{Drettakis94-SSRII,
+  author =       "George Drettakis",
+  month =        jan,
+  year =         "1994",
+  title =        "Structured {Sampling} and {Reconstruction} of
+                 {Illumination} for {Image} {Synthesis}",
+  number =       "293",
+  address =      "Toronto, Ontario",
+  school  =  "Department of Computer Science, University of
+                 Toronto",
+  type =         "{CSRI} {Technical} {Report}",
+  comments =     "available via anonymous ftp as:
+                 ftp.csri.toronto.edu:csri-technical-reports/293 and via
+                 the World Wide Web at:
+                 http://safran.imag.fr/Membres/George.Drettakis/pub.html",
+}
+
+@Article{Schroeder:1993:FFB,
+  author =       "P. Schroeder and P. Hanrahan",
+  title =        "On the Form Factor between Two Polygons",
+  journal =      "Computer Graphics",
+  volume =       "27",
+  number =       "{Annual Conference Series}",
+  pages =        "163--164",
+  year =         "1993",
+  bibdate =      "Thu Feb 6 10:16:14 MST 1997",
+  acknowledgement = ack-nhfb,
+  keywords =     "ACM; computer graphics; SIGGRAPH",
+}
+
+@PhdThesis{Funkhouser93phd,
+  author =       "Thomas A. Funkhouser",
+  title =        "Database and Display Algorithms for Interactive
+                 Visualization of Architectural Models",
+  school =       "CS Division, UC Berkeley",
+  year =         "1993",
+  keywords =     "multiresolution, architectural walkthrough",
+}
+
+@Book{Boissonnat98,
+  author =       {J.-D. Boissonnat and M. Yvinec},
+  title =        {Algorithmic Geometry},
+  publisher =    {cambridge University Press},
+  year =         1998,
+  where =        {A19}
+}
+
+
+
+
+@Misc{Chrysanthou:1998:VP,
+  author = 	 {Y. Chrysanthou and D. Cohen-Or and E. Zadicario},
+  title = 	 {Viewspace Partitioning of Densely Occluded Scenes},
+  howpublished = {Abstract of a video presentation,
+at the 13th Annual ACM Symposium on Computational Geometry, Minnesota, pages 413--414},
+  month = 	 {June},
+  year = 	 {1998},
+}
+
+
+@Unpublished{Sagadic,
+  author = 	 {Amela Sagadic},
+  title = 	 {An Algorithm for Invariant Polygon Visibility Orderings},
+  note = 	 {Downloaded from the WWW}
+}
+
+@Unpublished{Teichmann:WV,
+  author = 	 {Marek Teichmann and Seth Teller},
+  title = 	 {A Weak Visibility Algorithm with an Application to an Interactive Walkthrough},
+  note = 	 {Downloaded from the WWW}
+}
+
+@inproceedings{Tanaka91,
+       author =       "Toshimitsu Tanaka and Tokiichiro Takahashi",
+       title =        "Shading with Area Light Sources",
+       booktitle =    "Eurographics '91",
+       publisher =    "North-Holland",
+       pages =        "235--246, 535--537",
+       month =        sep,
+       year =         "1991",
+       annote = "no shadows",
+     }
+
+@InProceedings{Wang98,
+  author = 	 {Yigang Wang and Hujun Bao and Qunsheng Peng},
+  title = 	 {Accelerated Walkthroughs of Virtual Environments Based on
+Visibility Preprocessing and Simplification},
+  booktitle = 	 {Eurographics '98},
+  volume = 	 {17},
+  number = 	 {3},
+  year = 	 {1998},
+  pages = 	 {187--194},
+}
+
+@InProceedings{Nechvile99,
+  author = 	 {Karel Nechv\'\i{}le and Petr Tobola},
+  title = 	 {Local Approach to Dynamic Visibility in a Plane},
+  booktitle = 	 {Proceedings of WSCG'99, the 7th International
+                 Conference in Central Europe on Computer Graphics and
+                 Visualization '99},
+  year = 	 {1999},
+  pages = 	 {202--208},
+}
+@InProceedings{Tobola99,
+  author = 	 {Petr Tobola and Karel Nechv\'\i{}le},
+  title = 	 {Linear Size BSP trees for Scenes with Low Directional Density},
+  booktitle = 	 {Proceedings of WSCG'99, the 7th International
+                 Conference in Central Europe on Computer Graphics and
+                 Visualization '99},
+  year = 	 {1999},
+  pages = 	 {297--304},
+}
+
+@InProceedings{grant85a,
+  author =       "C. W. Grant",
+  title =        "Integrated Analytic Spatial and Temporal Anti-Aliasing
+                 for Polyhedra in 4-Space",
+  pages =        "79--84",
+  booktitle =      "Computer Graphics (SIGGRAPH '85 Proceedings)",
+  volume =       "19",
+  number =       "3",
+  year =         "1985",
+  month =        jul,
+  editor =       "B. A. Barsky",
+  conference =   "held in San Francisco, CA; 22--26 July 1985",
+  keywords =     "I37 anti-aliasing, temporal, I37 anti-aliasing, I37
+                 visible surface algorithms",
+}
+
+@InProceedings{Schilling:1997:TRT,
+  author =       "Andreas Schilling",
+  title =        "Toward Real-Time Photorealistic Rendering: Challenges
+                 and Solutions",
+  booktitle =    "1997 SIGGRAPH / Eurographics Workshop on Graphics
+                 Hardware",
+  editor =       "Steven Molnar and Bengt-Olaf Schneider",
+  year =         "1997",
+  organization = "ACM SIGGRAPH / Eurographics",
+  publisher =    "ACM Press",
+  address =      "New York City, NY",
+  month =        aug,
+  pages =        "7--16",
+  note =         "ISBN 0-89791-961-0",
+  keywords =     "antialiasing, bump mapping, environment mapping,
+                 anisotropic filtering",
+  annote =       "A growing number of real-time applications need
+                 graphics with photorealistic quality, especially in the
+                 field of training (virtual operation, driving and
+                 flight simulation), but also in the areas of design or
+                 ergonomic research. We take a closer look at main
+                 deficiencies of today's real time graphics hardware and
+                 present solutions for several of the identified
+                 problems in the areas of antialiasing and texture-,
+                 bump- and reflection mapping. In the second part of the
+                 paper, a new method for antialiasing bump maps is
+                 explained in more detail.",
+}
+
+@Article{Greene:1994:EAR,
+  author =       "N. Greene and M. Kass",
+  title =        "Error-Bounded Antialiased Rendering of Complex
+                 Environments",
+  journal =      "Computer Graphics",
+  volume =       "28",
+  number =       "{Annual Conference Series}",
+  pages =        "59--66",
+  month =        jul,
+  year =         "1994",
+  coden =        "CGRADI",
+  ISSN =         "0097-8930",
+  bibdate =      "Thu Feb 6 08:30:20 MST 1997",
+  acknowledgement = ack-nhfb,
+  keywords =     "ACM; computer graphics; SIGGRAPH",
+}
+
+@InProceedings{Bartz98,
+  author = 	 {Dirk Bartz and Michael Meissner and Tobias H\"uttner},
+  title = 	 {Extending Graphics Hardware for Occlusion Queries in OpenGL},
+  booktitle = 	 {Proceedings of the 1998 Workshop on Graphics Hardware},
+  pages = 	 {97--104},
+  year  =        {1998},
+}
+
+
+@Article{Clark:1976:HGM,
+  author =       "James H. Clark",
+  title =        "Hierarchical Geometric Models for Visible Surface
+                 Algorithms",
+  journal =      "Communications of the ACM",
+  volume =       "19",
+  number =       "10",
+  pages =        "547--554",
+  month =        oct,
+  year =         "1976",
+  coden =        "CACMA2",
+  ISSN =         "0001-0782",
+  bibdate =      "Tue Mar 25 13:26:09 MST 1997",
+  abstract =     "By using an extension of traditional structure
+                 information, or a geometric hierarchy, five significant
+                 improvements to current techniques of computer picture
+                 production are possible. First, the range of complexity
+                 of an environment is greatly increased while the
+                 visible complexity of any given scene is kept within a
+                 fixed upper limit. Second, a meaningful way is provided
+                 to vary the amount of detail presented in a scene.
+                 Third, ``clipping'' becomes a very fast logarithmic
+                 search for the resolvable parts of the environment
+                 within the field of view. Fourth, frame to frame
+                 coherence and clipping define a graphical ``working
+                 set,'' or fraction of the total structure that should
+                 be present in primary store for immediate access by the
+                 visible surface algorithm. Finally, the geometric
+                 structure suggests a recursive descent, visible surface
+                 algorithm in which the computation time potentially
+                 grows linearly with the visible complexity of the
+                 scene.",
+  acknowledgement = ack-nhfb,
+  classcodes =   "C5540 (Terminals and graphic displays); C6130B
+                 (Graphics techniques)",
+  classification = "723; 921",
+  corpsource =   "Univ. of California, Santa Cruz, CA, USA",
+  journalabr =   "Commun ACM",
+  keywords =     "algorithms; computer graphics; geometric models;
+                 hidden surface; hierarchical data structures; image
+                 processing; mathematical techniques --- Combinatorial
+                 Mathematics; model; visible surface algorithms",
+  treatment =    "A Application; P Practical; T Theoretical or
+                 Mathematical",
+}
+
+@Book{Skiena:1998:ADM,
+  author =       "Steven S. Skiena",
+  title =        "The Algorithm Design Manual",
+  publisher =    "Spring{\-}er-Ver{\-}lag",
+  address =      "Berlin, Germany~/ Heidelberg, Germany~/ London, UK~/
+                 etc.",
+  pages =        "xvi + 486",
+  year =         "1998",
+  ISBN =         "0-387-94860-0",
+  LCCN =         "QA76.9.A43S55 1997",
+  bibdate =      "Tue Feb 10 10:51:27 1998",
+  price =        "US\$54.95",
+  acknowledgement = ack-nhfb,
+}
+
+
+@Book{Blinn:1996:JBC,
+  author =       "Jim Blinn",
+  title =        "{Jim Blinn}'s Corner: {A} Trip Down the Graphics
+                 Pipeline",
+  publisher =    "Morgan Kaufmann Publishers",
+  address =      "Los Altos, CA 94022, USA",
+  pages =        "vii + 214",
+  year =         "1996",
+  ISBN =         "1-55860-387-5",
+  LCCN =         "T385.B585 1996",
+  bibdate =      "Tue Jan 28 14:26:03 1997",
+  note =         "This book is a collection of columns from the journal
+                 IEEE Computer Graphics and Applications.",
+  acknowledgement = ack-nhfb,
+}
+
+@Book{Blinn:1998:JBC,
+  author =       "Jim Blinn",
+  title =        "{Jim Blinn}'s Corner: Dirty Pixels",
+  publisher =    "Morgan Kaufmann Publishers",
+  address =      "Los Altos, CA 94022, USA",
+  pages =        "256",
+  year =         "1998",
+  ISBN =         "1-55860-455-3",
+  LCCN =         "T385.B586 1998",
+  bibdate =      "Tue Jan 28 14:26:03 1997",
+  note =         "This book is a collection of columns from the journal
+                 IEEE Computer Graphics and Applications.",
+  acknowledgement = ack-nhfb,
+}
+
+
+@Book{Prep85,
+  author =       "F. P. Preparata and M. I. Shamos",
+  title =        "Computational Geometry~: An Introduction",
+  publisher =    "Springer-Verlag",
+  year =         "1985",
+}
+
+@ARTICLE{Gigus90,
+    AUTHOR    = "Ziv Gigus and Jitendra Malik",
+    TITLE     = "Computing the aspect graph for line drawings of polyhedral objects",
+    JOURNAL   = "IEEE Transactions on Pattern Analysis and Machine Intelligence",
+    VOLUME    = 12,
+    NUMBER    = 2,
+    MONTH     = Feb,
+    YEAR      = 1990,
+    PAGES     = "113--122"
+}
+
+@Article{Blinn:1998:JBCc,
+  author =       "Jim Blinn",
+  title =        "Jim Blinn's Corner: Ten More Unsolved Problems in
+                 Computer Graphics",
+  journal =      "IEEE Computer Graphics \& Applications",
+  year =         "1998",
+  volume =       "18",
+  number =       "5",
+  month =        sep # " -- " # oct,
+  note =         "ISSN 0272-1716",
+}
Index: trunk/VUT/doc/SciReport/Bib/jiri.bib
===================================================================
--- trunk/VUT/doc/SciReport/Bib/jiri.bib	(revision 243)
+++ trunk/VUT/doc/SciReport/Bib/jiri.bib	(revision 243)
@@ -0,0 +1,345 @@
+@Article{bittner03:jep,
+  author = 	 {Ji\v{r}\'\i{} Bittner and Peter Wonka},
+  title = 	 {Visibility in Computer Graphics},
+  journal = 	 {Environment and Planning B: Planning and Design},
+  year = 	 {2003},
+  volume = 	 {30},
+  number = 	 {5},
+  pages = 	 {729--756},
+  month = 	 sep,
+  publisher = {Pion Ltd}
+}
+
+
+@PhdThesis{bittner:03:phd,
+  author = 	 {Ji\v{r}\'\i{} Bittner},
+  title = 	 {Hierarchical Techniques for Visibility Computations},
+  school = 	 {Czech Technical University in Prague},
+  year = 	 {2002},
+  month = 	 oct,
+}
+
+@Article{bittner:02:cg,
+  author = 	 {Ji\v{r}\'\i{} Bittner and jan P\v{r}ikryl and Pavel Slav\'\i{k}},
+  title = 	 {Exact Regional Visibility using Line Space Partitioning},
+  journal = 	 {Computers \& Graphics},
+  year = 	 {2003},
+  volume = 	 {27},
+  number = 	 {4},
+  pages = 	 {569--580},
+  month = 	 aug,
+}
+
+
+@article{bittner01:jvca,
+  author = "Ji\v{r}\'\i{} Bittner and Vlastimil Havran",
+  title = "Exploiting Coherence in Hierarchical Visibility Algorithms",
+  journal = "Journal of Visualization and Computer Animation, John Wiley \& Sons",
+  year = "2001",
+  volume = "12",
+  pages =  "277--286"
+}
+
+@inproceedings{bittner:2002:SCCG,
+  author = "Ji\v{r}\'\i{} Bittner",
+  title = "Efficient Construction of Visibility Maps using Approximate Occlusion Sweep",
+  booktitle = "Proceedings of Spring Conference on Computer Graphics (SCCG'02)",
+  address = {Budmerice, Slovakia},
+  year = "2002",
+  pages =       "163--171"
+}
+
+
+
+@inproceedings{havran:2002:WSCG,
+  author = "Vlastimil Havran and Ji\v{r}\'\i{} Bittner",
+  title = "On Improving {Kd}-Trees for Ray Shooting",
+  booktitle = "Journal of WSCG (Proceedings of Winter School on Computer Graphics 2001)",
+  address = {Plzen, Czech Republic},
+  year = "2002",
+  month = feb,
+ volume = "10",
+  number = "1--3",
+abstract="Efficient ray shooting algorithm is inherently required by
+many computer graphics algorithms, particularly in image
+synthesis. Practical ray shooting algorithms aiming at the
+average-case complexity use some underlying spatial data structure
+such as $kd$-tree. We show the new termination criteria algorithm that
+improves the space and time complexity of the $kd$-tree
+construction. It provides efficient ray-shooting queries and does not
+require any specific constants from a user. Further, we show how to
+apply a novel clipping algorithm into the $kd$-tree within
+construction phase in order to improve its properties."
+}
+
+
+@inproceedings{bittner:2001:PG,
+  author = "Ji\v{r}\'\i{} Bittner and Peter Wonka and Michael Wimmer",
+  title = "Visibility Preprocessing for Urban Scenes using Line Space Subdivision",
+  booktitle = "Proceedings of Pacific Graphics (PG'01)",
+  address = {Tokyo, Japan},
+  year = "2001",
+  publisher = "IEEE Computer Society",
+  pages =       "276--284"
+}
+
+@inproceedings{bittner:2001:SCCG,
+
+  author = "Ji\v{r}\'\i{} Bittner and Vlastimil Havran",
+  title = "Exploiting Temporal and Spatial Coherence in Hierarchical Visibility Algorithms",
+  booktitle = "Proceedings of Spring Conference on Computer Graphics (SCCG'01)",
+  address = {Budmerice, Slovakia},
+  year = "2001",
+  publisher = "IEEE Computer Society",
+  pages =       "213--220"
+}
+
+@TechReport{Bittner:2001:ERV_long,
+
+  author =      "Ji\v{r}\'\i{} Bittner and Jan P\v{r}ikryl",
+  title =       "Exact Regional Visibility using Line Space Partitioning",
+  year =        "2001",
+  month =       march,
+  pages =       "1--13",
+  keywords =    "visibility, line--space, BSP--tree, kD--tree, Plucker coordinates, projective geometry",
+  number =      "TR-186-2-01-06",
+  institution = "Institute of Computer Graphics and Algorithms,
+                 Vienna University of Technology",
+  address =     "Karlsplatz 13/186/2, A-1040 Vienna, Austria",
+  ftp =         "ftp://ftp.cg.tuwien.ac.at/pub/TR/01/TR-186-2-01-06Paper.ps.gz",
+  note =        "human contact: technical-report@cg.tuwien.ac.at",
+  abstract =    " We present a new technique for exact and output sensitive
+                 determination of  visibility from a polygonal region
+                 in the pla ne. It uses hierarchical partitioning of
+                 {\em line space}, that provid es comprehensive
+                 description of visibility for a set of {\em occlu
+                 ders}.  To the best of our knowledge, it is the first
+                 exact regional visibility algorithm suitable for
+                 visibility preprocessing of large scenes of
+                 unspecific type. We have evaluated the implementation
+                 on scenes with various visibility characteristics."
+                 }
+
+@TechReport{Bittner:2001:ERV,
+
+  author =      "Ji\v{r}\'\i{} Bittner and Jan P\v{r}ikryl",
+  title =       "Exact Regional Visibility using Line Space Partitioning",
+  year =        "2001",
+  month =       march,
+  pages =       "1--13",
+  keywords =    "visibility, line--space, BSP--tree, kD--tree, Plucker coordinates, projective geometry",
+  number =      "TR-186-2-01-06",
+  institution = "Institute of Computer Graphics and Algorithms,
+                 Vienna University of Technology",
+  ftp =         "ftp://ftp.cg.tuwien.ac.at/pub/TR/01/TR-186-2-01-06Paper.ps.gz",
+  note =        "Available as ftp://ftp.cg.tuwien.ac.at/pub/TR/01/TR-186-2-01-06Paper.ps.gz",
+  abstract =    " We present a new technique for exact and output sensitive
+                 determination of  visibility from a polygonal region
+                 in the pla ne. It uses hierarchical partitioning of
+                 {\em line space}, that provid es comprehensive
+                 description of visibility for a set of {\em occlu
+                 ders}.  To the best of our knowledge, it is the first
+                 exact regional visibility algorithm suitable for
+                 visibility preprocessing of large scenes of
+                 unspecific type. We have evaluated the implementation
+                 on scenes with various visibility characteristics."
+                 }
+
+#####################
+
+@inproceedings{havran:2001:EG,
+
+  author = "Vlastimil Havran and Ji\v{r}\'\i{} Bittner",
+  title = "LCTS: Ray Shooting using Longest Common Traversal Sequences",
+  booktitle = "Proceedings of Eurographics (EG'00)",
+  address = {Interlaken, Switzerland},
+  year = "2000",
+  pages =       "59--70"
+}
+
+%%%%%%%%% 1999 %%%%%%%%%%%%%%%%
+
+
+
+@TechReport{bittner99min,
+  author = 	 {Jiri Bittner},
+  title = 	 {Hierarchical Techniques for Visibility Determination},
+  institution =  {Department of Computer Science and Engineering,
+Czech Technical University in Prague},
+  year = 	 {1999},
+  number = 	 {DS-005},
+  month = 	 {March},
+  note = "Also available as http://www.cgg.cvut.cz/\~{}bittner/publications/minimum.ps.gz"
+}
+
+
+@Misc{bittner99eg,
+  author = 	 {Ji\v{r}\'\i{} Bittner and Vlastimil Havran},
+  title = 	 {Exploiting Temporal and Spatial Coherence in Hierarchical Visibility
+ Algorithms},
+  howpublished = {Submitted to the Eurographics'99 conference in Milano},
+  month = 	 {January},
+  year = 	 {1999},
+}
+
+@Misc{havran99wscg,
+  author = 	 {Vlastimil Havran and Ji\v{r}\'\i{} Bittner and
+                 Ji\v{r}\'\i{} \v{Z}\'{a}ra},
+  title = 	 {Constructing Rectilinear BSP Trees for Preffered Ray Sets},
+  howpublished = {Poster presentation at the WSCG'99 conference, Pilsen},
+  month = 	 {February},
+  year = 	 {1999},
+}
+
+@InProceedings{havran99sccg,
+  author = { Vlastimil Havran and Ji\v{r}\'\i{} Bittner},
+  title  = { Rectilinear BSP trees for preferred ray sets },
+  booktitle = { Proceedings of the Spring Conference on Computer Graphics (SCCG'99)}, 
+  address = { Budmerice, Slovakia},
+  year  = 1999,
+  pages = "171--178"
+}
+%  note = "Also available as http://www.cgg.cvut.cz/\~{}bittner/sccg98.ps.gz",
+
+
+@Misc{bittner99wshop,
+  author = 	 {Ji\v{r}\'\i{} Bittner and Vlastimil Havran Tom\'a\v{s}{} Kopal},
+  title = 	 {Visibility Computations in Large 3D Scenes},
+  howpublished = {Poster presentation at the Workshop'99, CTU Prague},
+  month = 	 {January},
+  year = 	 {1999},
+}
+
+%%%%%%%%% 1998 %%%%%%%%%%%%%%%%%%%%%%
+
+@Article{Havran98:d,
+   author = {Havran, V. and Kopal, T. and Bittner, J. and \v{Z}\'{a}ra, J.},
+   title = {FAST ROBUST BSP TREE TRAVERSAL ALGORITHM FOR RAY TRACING},
+   journal = {Journal of Graphics Tools},
+   year = { 1998 },
+   month = dec,
+}
+
+@inproceedings{bittner98b,
+  author = "Ji\v{r}\'\i{} Bittner and Vlastimil Havran and Pavel Slav\'\i{k}",
+  title = "Hierarchical Visibility Culling with Occlusion Trees",
+  booktitle = "Proceedings of Computer Graphics International '98 (CGI'98)",
+  year = "1998",
+  pages = "207--219",
+  publisher = "IEEE",
+  who = "Havran Vlastimil: VIS-0047",
+}
+% note = "Also available as http://www.cgg.cvut.cz/\~{}bittner/paper-copy.ps.gz",
+
+@InProceedings{Havran98:b,
+  author = { Havran, V. and Bittner, J. and \v{Z}\'{a}ra, J.},
+  title  = { Ray Tracing with Rope Trees},
+  booktitle = { Proceedings of 13th Spring Conference on Computer Graphics}, 
+  address = { Budmerice},
+  date  = {April 23--26},
+  year  = 1998,
+  pages = "130--139",
+  note = "Also available as http://www.cgg.cvut.cz/\~{}bittner/sccg98.ps.gz",
+}
+
+
+@InProceedings{bittner98poster,
+  author = {Bittner, J.},
+  title  = {Conservative Hierarchical Visibility with Occlusion Trees},
+  booktitle = {Proceedings of Poster'98},
+  organization = { CTU--FEE },
+  address = {Prague, Czech Republic},
+  pages = {2 pages, IC 03},
+  month = {May},
+  year  = {1998},
+}
+
+
+@InProceedings{Kopal98:b,
+  author = {Kopal, T. and Havran, V. and Bittner, J. and \v{Z}\'{a}ra, J.},
+  title  = {Directionality in Ray Tracing},
+  booktitle = {Proceedings of Poster'98},
+  note = {2nd International Student Conference on Electrical Engineering},
+ organization = { CTU--FEE },
+  address = {Prague, Czech Republic},
+  pages = {2 pages, IC 24},
+  month = {May},
+  year  = {1998},
+}
+
+
+@InProceedings{bittner98wshop,
+   author = {Bittner, J.},
+   title = {Hierarchical Visibility Algorithms},
+   booktitle = {Proceedings of Workshop'98},
+   organization = { CTU--FEE },
+   address = { Prague, Czech Republic },
+   editor= { A. Strejc },
+   month = { February},
+   pages = { 195--196},
+   year  = { 1998 },
+}
+
+
+%%%%%%%%% 1997 %%%%%%%%%%%%%%%%%%%%%%%
+
+@MastersThesis{Bittner:masters97,
+  author = 	 {Bittner, J.},
+  title = 	 {Global Visibility Computations},
+  school = 	 {Department of Computer Science and Engineering, Czech Technical University
+Prague},
+  year = 	 {1997},
+  month = 	 {January},
+  note =  "Also available as http://www.cgg.cvut.cz/\~{}bittner/masters.ps.gz",
+}
+
+@InProceedings{Bittner:gaw97,
+  author = 	 {Bittner, J.},
+  title = 	 {Global Visibility Computations},
+  booktitle =    {Graphics and WEB '97},
+  year =         {1997},
+  organization = {HTW Dresden, Germany},
+  key =          {global visibility, VRML, conservative visibility, spatial
+                  subdivision, visibility computations},
+}
+
+@InProceedings{Bittner:cescg97,
+  author = 	 {Bittner, J.},
+  title = 	 {Global Visibility},
+  booktitle =    {Proceedings of the CESCG '97, April 97, Bratislava and Vienna},
+  year =         {1997},
+  pages = {105--111},
+  key =          {global visibility, VRML, conservative visibility, spatial
+                  subdivision, visibility computations},
+}
+
+@InProceedings{Trefny97,
+  author =       {M. Trefn\'{y} and J. Bittner},
+  title =        {Global Visibility},
+  booktitle =    {Proceedings of The Fifth Internatinal Conference in Central
+                  Europe on Computer Graphics and Visualization '97},
+  key =          {global visibility, VRML, conservative visibility, spatial
+                  subdivision, visibility computations},
+  volume =       {IV},
+  pages =        {691--694},
+  year =         {1997},
+  month =        feb
+}
+
+%%%%%%%%%%%% 1996 %%%%%%%%%%%%%%%%%%%
+@TechReport{Bittner:delft96,
+  author = 	 {Bittner, J.},
+  title = 	 {RECNET - The speech recognition system},
+  institution =  {Technical University, Delft},
+  year = 	 {1996},
+  number =       {TR 96--160},
+  month = 	 {June}
+}
+
+
+
+
+
+
+
+
Index: trunk/VUT/doc/SciReport/Bib/cge-wanted.bib
===================================================================
--- trunk/VUT/doc/SciReport/Bib/cge-wanted.bib	(revision 243)
+++ trunk/VUT/doc/SciReport/Bib/cge-wanted.bib	(revision 243)
@@ -0,0 +1,669 @@
+
+@inproceedings{BerDobEpp-SODA-90,
+  title = {{Visibility with a moving point of view}},
+  author = {Marshall W. Bern and David P. Dobkin and David Eppstein and Robert L. Grossman},
+  booktitle = {Proc. 1st Symp. Discrete Algorithms},
+  publisher = {Assoc. Comput. Mach. and Soc. Industrial {\&} Applied Mathematics},
+  pages = {107--118},
+  month = {January},
+  year = {1990}
+}
+
+@article{BerDobEpp-Algo-94,
+  title = {{Visibility with a moving point of view}},
+  author = {Marshall W. Bern and David P. Dobkin and David Eppstein and Robert L. Grossman},
+  journal = {Algorithmica},
+  volume = {11},
+  number = {4},
+  pages = {360--378},
+  month = {April},
+  year = {1994},
+  review = {MR-94j:68307}
+}
+
+@article{MR-94j:68307,
+  reviews = {BerDobEpp-Algo-94},
+  journal = {Mathematical Reviews},
+  publisher = {Amer. Math. Soc.},
+  title = {{Visibility with a moving point of view}},
+  number = {94j:68307},
+  year = {1994}
+}
+
+
+
+@Article{Matousek95,
+title={Approximations and Optimal Geometric Divide-and-Conquer},
+author={Ji{\v{r}}{\'\i} Matou{\v{s}}ek},
+pages={203--208},
+journal=jcss,
+year=1995,
+month=apr,
+volume=50,
+number=2,
+preliminary={STOC::Matousek1991}
+}
+
+@article{ma4,
+  author="J. Matousek",
+  title="Efficient partition trees",
+  journal="Discrete and Computational Geometry",
+  year="1992",
+  volume="8",
+  number="",
+  pages="315-334"
+}
+
+@inproceedings{ma92acm,
+  author="J. Matousek",
+  title="Range searching with efficient hierarchical cuttings",
+  booktitle="$8^{th}$ ACM Conf. in Comp. Geom.",
+  address="Berlin",
+  year="1992",
+  pages="276-285"
+}
+
+@article
+ {ma1,
+  author="J. Matousek",
+  title="Range searching with efficient hierarchical cuttings",
+  journal="Discrete and Computational Geometry",
+  year="1993",
+  volume="10",
+  number="",
+  pages="157-182"
+}
+
+@inproceedings{a-rsoas-89
+, author =      "Pankaj K. Agarwal"
+, title =       "Ray shooting and other applications of spanning trees with low stabbing number"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "315--325"
+, precedes =    "a-rsoas-92"
+, update =      "96.05 agarwal, 95.05 korneenko"
+}
+
+@article{a-rsoas-92
+, author =      "Pankaj K. Agarwal"
+, title =       "Ray shooting and other applications of spanning trees with low stabbing number"
+, journal =     "SIAM J. Comput."
+, volume =      21
+, year =        1992
+, pages =       "540--570"
+, keywords =    "ray shooting, visibility, spanning trees, partition trees"
+, succeeds =    "a-rsoas-89"
+, update =      "96.05 agarwal, 95.05 korneenko"
+}
+
+@TECHREPORT{duke.tr:DukeCSTR9122,
+    AUTHOR = "Pankaj K. {Agarwal} and Jiri Matousek.",
+    year = "1991",
+    ABSTRACT = "\indent We present efficient algorithms for 
+        the {\em ray shooting} problem:  Given a
+        collection $\Gamma$ of objects in ${\bf R}^{d}$, build a data structure
+        so that, for a query ray, one can quickly determine the first object of
+        $\Gamma$  hit by the ray.  Using the parametric search technique, we reduce
+        this problem to the {\em segment emptiness} problem.  For various ray shooting
+        problems, we achieve space/query time tradeoffs of the following type:  for
+        some integer $b$ and a parameter $m \,  (n \leq m \leq n^{b})$ the queries are
+        answered in time 
+        $O(\frac{n}{m^{1/b}}\, \mbox {log} ^{O(1)}n)$,
+        with  $O(m^{1+ \epsilon })$ space and preprocessing time $(\varepsilon > 0$ is
+        arbitrarily small but fixed constant).  We get $b = \lfloor d/2
+        \rfloor $ for ray shooting
+        in a convex $d$-polytope defined as an intersection of $n$ half-spaces, $b = d$
+        for an arrangement of $n$ hyperplanes in ${\bf R}^{d}$ and $b = 3$ for an
+        arrangement of $n$ half-planes in ${\bf R}^{3}$.  Our approach also yields
+        fast procedures for finding the first $k$ objects hit by a query ray, for
+        searching nearest and farthest neighbors, and for the hidden surface
+        removal.  All the data structures can be maintained dynamically in amortized
+        time  $O(m^{1+ \epsilon }/n)$ per insert/delete operation. ",
+    LOCATION = "ftp://ftp.cs.duke.edu/dist/techreport/1991/1991-22.ps.Z",
+    NOTE = "Printed copies available from
+          T.R. Librarian,
+          Dept. of Computer Science,
+          Duke University,
+          Box 90129,
+          Durham, NC  27708-0129",
+    PUBLISHER = "Department of Computer Science, Duke University",
+    REPORTNUMBER = "Technical report DUKE--TR--1991--22",
+    TITLE = " Ray Shooting and Parametric Search",
+    SUBMITTER = "surendar@swift.cs.duke.edu (Mon Jul  1 23:53:45 1996)",
+    institution = "Duke University",
+    KEY = "DukeCSTR9122"
+}
+
+@inproceedings{am-rsps-92
+, author =      "Pankaj K. Agarwal and J. Matou{\v s}ek"
+, title =       "Ray shooting and parametric search"
+, booktitle =   "Proc. 24th Annu. ACM Sympos. Theory Comput."
+, year =        1992
+, pages =       "517--526"
+, keywords =    "ray tracing, range search, intersection, partition trees"
+, update =      "96.09 agarwal, 96.05 agarwal"
+}
+
+@article{as-rsacp-96i
+, author =      "P. K. Agarwal and M. Sharir"
+, title =       "Ray shooting amidst convex polygons in {2D}"
+, journal =     "J. Algorithms"
+, volume =      21
+, year =        1996
+, pages =       "508--519"
+, update =      "97.03 agarwal+pocchiola+smid, 96.09 agarwal, 96.05 agarwal"
+}
+
+@inproceedings{as-rsacp-93
+, author =      "Pankaj K. Agarwal and M. Sharir"
+, title =       "Ray Shooting Amidst Convex Polytopes in Three Dimensions"
+, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1993
+, pages =       "260--270"
+, precedes =    "as-rsacp-96ii"
+, update =      "96.05 smid, 93.05 smid"
+}
+
+@inproceedings{af-acrsm-97
+, author =      "B. Aronov and S. Fortune"
+, title =       "Average-Case Ray Shooting and Minimum Weight Triangulations"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "203--212"
+, update =      "97.07 efrat"
+}
+
+@inproceedings{bf-gsars-90
+, author =      "R. Bar-Yehuda and S. Fogel"
+, title =       "Good splitters with applications to ray shooting"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "81--84"
+, keywords =    "ray tracing, arrangements"
+}
+
+@techreport{bf-vrs-90
+, author =      "R. Bar-Yehuda and S. Fogel"
+, title =       "Variations on Ray Shooting"
+, type =        "Technical {Report}"
+, number =      639
+, institution = "Technion IIT"
+, address =     "Haifa, Israel"
+, year =        1990
+, keywords =    "sheaf, ES-trees"
+, update =      "95.01 smid, 93.09 milone+mitchell"
+}
+
+@article{bf-vrs-94
+, author =      "R. Bar-Yehuda and S. Fogel"
+, title =       "Variations on Ray Shooting"
+, journal =     "Algorithmica"
+, volume =      11
+, year =        1994
+, pages =       "133--145"
+, succeeds =    "bf-vrs-90"
+, update =      "95.01 smid, 94.05 matousek"
+}
+
+@inproceedings{bhosk-ershs-91
+, author =      "M. de Berg and D. Halperin and M. Overmars and J. Snoeyink and M. van Kreveld"
+, title =       "Efficient ray shooting and hidden surface removal"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "21--30"
+, keywords =    "ray tracing, hidden surface removal, random sampling"
+, cites =       "as-anspt-91, ako-iqco-91, as-zasha-91, cegpsss-ccclr-90, cegs-lscaa-89, cg-vippg-89, csw-qoubs-90, cj-sersi-91, cs-vppt-89, bo-hsrap-90, de-ssio-87, dk-ladsc-85, e-acg-87, m-aodq-90, m-wcohs-87, os-oshsr-89, p-srs3d-90, p-nrrsi-91, sml-rtatp-88, s-pcg-88, ZZZ"
+, update =      "97.11 bibrelex"
+}
+
+@Article{deb94,
+  author =       "M. De Berg and D. Halperin and M. Overmars and J.
+                 Snoeyink and M. Van Kreveld",
+  title =        "Efficient ray shooting and hidden surface removal",
+  journal =      "Algorithmica: An International Journal in Computer
+                 Science",
+  volume =       "12",
+  number =       "1",
+  year =         "1994",
+  publisher =    "Springer Verlag, New York",
+  pages =        "30--53",
+  topic =        "visibility",
+}
+
+@inproceedings{cegghss-rspug-91
+, author =      "B. Chazelle and H. Edelsbrunner and M. Grigni and L. Guibas and J. Hershberger and M. Sharir and J. Snoeyink"
+, title =       "Ray shooting in polygons using geodesic triangulations"
+, booktitle =   "Proc. 18th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      510
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "661--673"
+, keywords =    "ray shooting, simple polygon, geodesics"
+, update =      "93.09 rote"
+}
+
+@article{cegghss-rspug-94
+, author =      "B. Chazelle and H. Edelsbrunner and M. Grigni and L. Guibas and J. Hershberger and M. Sharir and J. Snoeyink"
+, title =       "Ray shooting in polygons using geodesic triangulations"
+, journal =     "Algorithmica"
+, volume =      12
+, year =        1994
+, pages =       "54--68"
+, keywords =    "ray shooting, simple polygon, geodesics"
+, succeeds =    "cegghss-rspug-91"
+, update =      "96.05 pocchiola+ramkumar"
+}
+
+@article{cf-plhur-94
+, author =      "B. Chazelle and J. Friedman"
+, title =       "Point Location among Hyperplanes and Unidirectional Ray-Shooting"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      4
+, year =        1994
+, pages =       "53--62"
+, update =      "97.11 bibrelex, 95.01 matousek+smid"
+}
+
+@article{cj-arsis-92
+, author =      "S. W. Cheng and R. Janardan"
+, title =       "Algorithms for ray-shooting and intersection searching"
+, journal =     "J. Algorithms"
+, volume =      13
+, year =        1992
+, pages =       "670--692"
+, update =      "93.09 smid"
+}
+
+@inproceedings{cj-sersi-91
+, author =      "S. W. Cheng and R. Janardan"
+, title =       "Space-efficient ray shooting and intersection searching: algorithms, dynamization and applications"
+, booktitle =   "Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1991
+, pages =       "7--16"
+, keywords =    "ray tracing, dynamization, spanning trees of low stabbing number"
+}
+
+@inproceedings{cpt-uadpl-93
+, author =      "Y.-J. Chiang and F. P. Preparata and R. Tamassia"
+, title =       "A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps"
+, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1993
+, pages =       "44--53"
+, precedes =    "cpt-uadpl-96"
+, update =      "96.05 smid, 93.05 smid"
+}
+
+@article{cpt-uadpl-96
+, author =      "Y.-J. Chiang and F. P. Preparata and R. Tamassia"
+, title =       "A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps"
+, journal =     "SIAM J. Comput."
+, volume =      25
+, year =        1996
+, pages =       "207--233"
+, url = "http://www.cs.brown.edu/cgc/papers/cpt-uadpl-96.ps.gz"
+, succeeds =    "cpt-uadpl-93"
+, update =      "97.03 tamassia, 96.05 smid, 95.01 tamassia"
+}
+
+@article{g-airsm-97
+, author =      "M. T. Goodrich"
+, title =       "An improved ray shooting method for constructive solid geometry models via tree contraction"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      "??"
+, year =        1997
+, note =        "to appear"
+, update =      "97.03 tamassia"
+}
+
+@article{gt-drssp-97
+, author =      "M. T. Goodrich and R. Tamassia"
+, title =       "Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulations"
+, journal =     "J. Algorithms"
+, volume =      23
+, year =        1997
+, pages =       "51--73"
+, update =      "97.07 smid"
+}
+
+@inproceedings{gt-drssp-93
+, author =      "M. T. Goodrich and R. Tamassia"
+, title =       "Dynamic ray shooting and shortest paths via balanced geodesic triangulations"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "318--327"
+, update =      "93.09 jones"
+}
+
+@inproceedings{gos-ilsrs-88
+, author =      "L. Guibas and M. Overmars and M. Sharir"
+
+, title =       "Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques"
+, booktitle =   "Proc. 1st Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      318
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "64--73"
+}
+
+@techreport{gos-rsipl-89
+, author =      "L. Guibas and M. Overmars and M. Sharir"
+, title =       "Ray shooting, implicit point location, and related queries in arrangements of segments"
+, type =        "Report"
+, number =      433
+, institution = "Dept. Comput. Sci., New York Univ."
+, address =     "New York, NY"
+, month =       mar
+, year =        1989
+, keywords =    "random sampling, ray tracing, arrangements, point location"
+}
+
+@article{k-3vrs2-??
+, author =      "M. J. Katz"
+, title =       "{3-D} vertical ray shooting and {2-D} point enclosure, range searching, and arc shooting amidst convex fat objects"
+, journal =     "Comput. Geom. Theory Appl."
+, note =        "to appear"
+, succeeds =    "k-3vrs2-95"
+, update =      "97.11 katz"
+, year = "1995"
+}
+
+@techreport{k-3vrs2-95
+, author =      "M. J. Katz"
+, title =       "{3-D} vertical ray shooting and {2-D} point enclosure, range searching, and arc shooting amidst convex fat objects"
+, type =        "Research {Report}"
+, number =      2583
+, institution = "INRIA"
+, address =     "BP93, 06902 Sophia-Antipolis, France"
+, year =        1995
+, update =      "97.11 katz, 96.09 smid"
+}
+
+@article{ms-rscp-93
+, author =      "J. Matou{\v s}ek and O. Schwarzkopf"
+, title =       "On ray shooting in convex polytopes"
+, journal =     "Discrete Comput. Geom."
+, volume =      10
+, number =      2
+, year =        1993
+, pages =       "215--232"
+, keywords =    "ray shooting, convex polytope, range searching"
+, comments =    "another part of the results of the conference version is in m-loq-93"
+, succeeds =    "ms-loq-92"
+, update =      "96.09 agarwal, 94.05 schwarzkopf, 94.01 matousek"
+}
+
+@inproceedings{mms-qsrs-94
+, author =      "J. S. B. Mitchell and D. M. Mount and S. Suri"
+, title =       "Query-Sensitive Ray Shooting"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "359--368"
+, update =      "94.09 jones, 94.01 jones"
+}
+
+@techreport{p-nrrsi-91
+, author =      "M. Pellegrini"
+, title =       "New results on ray-shooting and isotopy classes of lines in $3$-dimensional space"
+, year =        1991
+, update =      "97.11 bibrelex"
+}
+
+@inproceedings{p-rsicl-91
+, author =      "M. Pellegrini"
+, title =       "Ray-shooting and isotopy classes of lines in $3$-dimensional space"
+, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "20--31"
+, keywords =    "ray tracing, random sampling"
+}
+
+@incollection{p-rsls-97
+, author =      "M. Pellegrini"
+, title =       "Ray shooting and lines in space"
+, chapter =     32
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "599--614"
+, update =      "97.11 orourke"
+}
+
+@article{p-rst3s-93
+, author =      "M. Pellegrini"
+, title =       "Ray shooting on triangles in $3$-space"
+, journal =     "Algorithmica"
+, volume =      9
+, year =        1993
+, pages =       "471--494"
+, update =      "94.05 matousek"
+}
+
+@inproceedings{p-srs3d-90
+, author =      "M. Pellegrini"
+, title =       "Stabbing and ray shooting in $3$-dimensional space"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "177--186"
+, cites =       "a-dapal-89, a-rsoas-89, ak-frtrc-87, aw-alts-87, bdeg-vmpv-90, cegs-lscaa-89, c-narsc-87, cs-vppt-86, e-acg-87, egs-cmfal-88, emprww-sls-82, eos-calha-86, g-rt-89, gos-rsipl-89, hp-mag-52, hs-ndssg-86, jk-spals-88, m-ai-70, mo-al3sd-88, os-oshsr-89, s-chdch-86, sml-rtatp-88, s-agtd-51, s-pcg-88, ZZZ"
+, update =      "97.11 bibrelex"
+}
+
+@inproceedings{s-rscp-92
+, author =      "O. Schwarzkopf"
+, title =       "Ray shooting in convex polytopes"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "286--295"
+, precedes =    "s-dmcpr-92"
+, cites =       "aesw-emstb-90, am-dhsrr-91, am-rsps-92, bc-hhihr-92, bdsty-arsol-92, bdt-riach-, cegs-sessr-89, cf-plhur-94, c-hsh-85, c-narsc-87, c-racpq-88, cms-frric-92i, cs-arscg-89, dmt-fddtl-92, e-acg-87, gks-ricdv-92, m-ept-91, m-rph-91, m-fppa1-88, m-rmstd-91, m-rmstf-91, m-rmstl-91, s-dmgsm-91, s-sdlpc-91, s-sfira-91, ZZZ"
+, update =      "97.11 bibrelex, 93.05 schwarzkopf"
+}
+
+@TECHREPORT{duke.tr:DukeCSTR9107,
+    AUTHOR = "Pankaj K. {Agarwal} and Micha Sharir.",
+    year = "1991",
+    ABSTRACT = "\indent We present several applications of a 
+        recent space partitioning technique of
+        Chazelle, Sharir and Welzl [13].  Our results include efficient algorithms
+        for output-sensitive hidden surface removal, for ray shooting in two and
+        three dimensions, and for constructing spanning trees with low stabbing
+        number.",
+    LOCATION = "ftp://ftp.cs.duke.edu/dist/techreport/1991/1991-07.ps.Z",
+    NOTE = "Printed copies available from
+          T.R. Librarian,
+          Dept. of Computer Science,
+          Duke University,
+          Box 90129,
+          Durham, NC  27708-0129",
+    PUBLISHER = "Department of Computer Science, Duke University",
+    REPORTNUMBER = "Technical report DUKE--TR--1991--07",
+    TITLE = " Applications of a New Space Partitioning Technique",
+    SUBMITTER = "surendar@swift.cs.duke.edu (Mon Jul  1 23:53:07 1996)",
+    institution = "Duke University",
+    KEY = "DukeCSTR9107"
+}
+
+@article{
+dk-ladsc-85, info="81"
+, author =      "D. P. Dobkin and D. G. Kirkpatrick"
+, title =       "A linear algorithm for determining the separation of convex polyhedra"
+, journal =     "J. Algorithms"
+, volume =      6
+, year =        1985
+, pages =       "381--392"
+, keywords =    "design of algorithms, construction, separation, convex, polyhedra, hierarchical representations"
+}
+
+@InProceedings{dadoun85a,
+        author =       "Nou Dadoun and David G. Kirkpatrick and John P.
+                       Walsh",
+        title =        "The Geometry of Beam Tracing",
+        booktitle =    "Proceedings of the ACM Symposium on Computational
+                       Geometry",
+        pages =        "55--61",
+        year =         "1985",
+        month =        jun,
+        annote =       "the use of BSP trees and hierarchical bounding volumes
+                       for fast beam intersection testing. \\ A solution to
+                       the hidden surface elimination problem called beam
+                       tracing is described. Beam tracing is related to ray
+                       tracing but uses spatial coherence within the scene,
+                       and area coherence within the image to batch
+                       computations. Beam tracing is an object space solution
+                       to the hidden surface problem. \\ Beam tracing is
+                       formulated in terms of its principal subprocesses:
+                       intersection, sorting, and clipping. A hierarchical
+                       scene representation is proposed. This incorporates the
+                       space decomposition idea of the BSP tree [Fuchs, Kedem,
+                       and Naylor, 80] along with the convex polytope
+                       intersection detection technique of [Dobkin and
+                       Kirkpatrick, 83] to interleave and efficiently solve
+                       the intersection and sorting subproblems of beam
+                       tracing.",
+}
+
+@InProceedings{dAmore:1992:OBP,
+  author =       "F. d'Amore and P. G. Franciosa",
+  title =        "On the optimal binary plane partition for sets of
+                 isothetic rectangles",
+  booktitle =    "Proc. 4th Canad. Conf. Comput. Geom.",
+  year =         "1992",
+  pages =        "1--5",
+}
+
+@inproceedings{bgo-pbsp-93
+, author =      "M. de Berg and M. de Groot and M. Overmars"
+, title =       "Perfect binary space partitions"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "109--114"
+, precedes =    "bgo-pbsp-97"
+, update =      "97.03 devillers, 93.09 milone+mitchell"
+}
+
+@inproceedings{bgo-nrbsp-94
+, author =      "M. de Berg and M. de Groot and M. Overmars"
+, title =       "New results on binary space partitions in the plane"
+, booktitle =   "Proc. 4th Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      824
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "61--72"
+, update =      "95.01 schwarzkopf+smid, 94.05 schwarzkopf"
+}
+
+@article{bgo-pbsp-97
+, author =      "M. de Berg and M. de Groot and M. Overmars"
+, title =       "Perfect binary space partitions"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, year =        1997
+, pages =       "81--91"
+, succeeds =    "bgo-pbsp-93"
+, update =      "97.03 devillers"
+}
+
+@inproceedings{b-lsbsp-95
+, author =      "Mark de Berg"
+, title =       "Linear Size Binary Space Partitions for Fat Objects"
+, booktitle =   "Proc. 3rd Annu. European Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      979
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "252--263"
+, update =      "97.03 murali+schwarzkopf"
+}
+
+@article{ekltmmv-rcerr-91
+, author =	"J. L. Ellis and G. Kedem and T. C. Lyerly and D. G. Thielman and R. J. Marisa and J. P. Menon and H. B. Voelcker"
+, title =	"The ray casting engine and ray representations: a technical summary"
+, journal =	"Internat. J. Comput. Geom. Appl."
+, volume =	1
+, number =	4
+, year =	1991
+, pages =	"347--380"
+, keywords =	"mechanical CAD CAM, solid modeling, parallel computation, ray representation"
+}
+
+@article{py-ebsph-90
+, author =      "M. S. Paterson and F. F. Yao"
+, title =       "Efficient binary space partitions for hidden-surface removal and solid modeling"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "485--503"
+, succeeds =    "py-bpahs-89"
+}
+
+@inproceedings{py-obspo-90
+, author =      "M. S. Paterson and F. F. Yao"
+, title =       "Optimal binary space partitions for orthogonal objects"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "100--106"
+, precedes =    "py-obspo-92"
+}
+
+@article{py-obspo-92
+, author =      "M. S. Paterson and F. F. Yao"
+, title =       "Optimal binary space partitions for orthogonal objects"
+, journal =     "J. Algorithms"
+, volume =      13
+, year =        1992
+, pages =       "99--113"
+, succeeds =    "py-obspo-90"
+}
+
+@TechReport{Kreveld:1992:NRD,
+  author =       "M. J. van Kreveld",
+  title =        "New results on data structures in computational
+                 geometry",
+  type =         "Ph.{D}. {Dissertation}",
+  institution =  "Dept. Comput. Sci., Univ. Utrecht",
+  address =      "Utrecht, Netherlands",
+  year =         "1992",
+  keywords =     "doctoral thesis",
+}
+
+@Article{Vanecek:1991:BIM,
+  author =       "G. {Vanecek, Jr.}",
+  title =        "Brep-index: a multidimensional space partitioning
+		 tree",
+  journal =      "Internat. J. Comput. Geom. Appl.",
+  volume =       "1",
+  number =       "3",
+  year =         "1991",
+  pages =        "243--261",
+  keywords =     "classification, Brep, BSP tree, data structures",
+}
+
+@inproceedings{bg-bspsc-94
+, author =      "M. de Berg and M. de Groot"
+, title =       "Binary space partitions for sets of cubes"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG'94"
+, year =        1994
+, pages =       "84--88"
+, update =      "94.05 schwarzkopf"
+}
+
+
+@article{vko91,
+  author="M. van Kreveld and H. Overmars",
+  title="Divided k-d Trees",
+  journal="Algorithmica",
+  year="1991",
+  volume="6",
+  number="",
+  pages="840-858"
+}
Index: trunk/VUT/doc/SciReport/Bib/cgemame.bib
===================================================================
--- trunk/VUT/doc/SciReport/Bib/cgemame.bib	(revision 243)
+++ trunk/VUT/doc/SciReport/Bib/cgemame.bib	(revision 243)
@@ -0,0 +1,650 @@
+@InCollection{p-rsls-97,
+author =      "M. Pellegrini",
+title =       "Ray shooting and lines in space",
+chapter =     32  ,
+editor =      "Jacob E. Goodman and Joseph O'Rourke",
+booktitle =   "Handbook of Discrete and Computational Geometry",
+publisher =   "CRC Press LLC",
+address =     "Boca Raton, FL",
+year =        1997,
+pages =       "599--614",
+update =      "97.11 orourke",
+who = "Havran Vlastimil: CGE-0046",
+}
+
+@TechReport{Kahan94,
+  author =       "S. Kahan and P. Kelsen",
+  title =        "Constant Time Parallel Indexing of Points in a Triangle",
+  institution =  "Department of Computer Science, University of British
+                  Columbia",
+  number =       "UBC CS TR-94-06",
+  month =        feb,
+  year =         "1994",
+  url =          "http://www.cs.ubc.ca/cgi-bin/tr/1994/TR-94-06",
+  who = "Havran Vlastimil: CGE-0045",
+}
+
+@Booklet{matousek94,
+  author       =   "Matou\v{s}ek, J.",
+  title        =   "Topological Methods in Combinatorics and Geometry",
+  howpublished =   "Lecture Notes",
+  address      =   "Charles University--Praha",
+  year         =    1994,
+  who = "Havran Vlastimil: CGE-0044",
+}
+
+@Article{KalShe94,
+  author =       "L.J. Guibas and J-C. Latombe and S.M. Lavalle and D. Lin and R. Motwani",
+  title =        "Visibility-Based Pursuit-Evasion in a Polygonal Environment",
+  journal =      "Special issue on the CGC Workshop on Computational Geometry, 
+                 International Journal of Computational Geometry and Applications",
+  volume =       "??",
+  year =         "1997",
+  who = "Havran Vlastimil: CGE-0043",
+}
+
+@TechReport{Luebke96:TCHR,
+  author =       "D. Luebke",
+  title =        "Hierarchical Structures For Dynamic Polygonal Simplification",
+  institution =  "Department of Computer Science, University of North
+                 Carolina - Chapel Hill",
+  number =       "TR96-006",
+  month =        feb # " 16",
+  year =         "1996",
+  url =          "ftp://ftp.cs.unc.edu/pub/publications/techreports/96-006.ps.Z",
+  note =         "Wed, 26 Jun 1996 18:07:48 GMT",
+  who = "Havran Vlastimil: CGE-0042",
+}
+
+@TechReport{Erikson96,
+  author =       "Carl Erikson",
+  title =        "Polygonal Simplification: An Overview",
+  institution =  "Department of Computer Science, University of North
+                 Carolina - Chapel Hill",
+  number =       "TR96-016",
+  month =        feb # " 16",
+  year =         "1996",
+  url =          "ftp://ftp.cs.unc.edu/pub/publications/techreports/96-016.ps.Z",
+  note =         "Wed, 26 Jun 1996 18:07:48 GMT",
+  who = "Havran Vlastimil: CGE-0041",
+}
+
+@techreport{TH83
+, author =      "S. Teller and M. Hohmeyer"
+, title =       "Computing the Lines Piercing Four Lines"
+, type =        "Technical {Report}"
+, number =      "UCB/CSD 93/161"
+, institution = "UC Berkeley"
+, month =       apr
+, year =        1993
+, who = "Havran Vlastimil: CGE-0040"
+}
+
+@Article{KalShe94a,
+  author =       "Kalpakis and Sherman",
+  title =        "Probabilistic Analysis of an Enhanced Partitioning
+                 Algorithm for the Steiner Tree Problem",
+  journal =      "NETWORKS: Networks: An International Journal",
+  volume =       "24",
+  year =         "1994",
+  who = "Havran Vlastimil: CGE-0039",
+}
+
+@Article{Blinn:1992:JBCc,
+  author =       "James F. Blinn",
+  title =        "{Jim Blinn}'s Corner --- Uppers and downers: Part 2",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "12",
+  number =       "3",
+  pages =        "80--85",
+  month =        may,
+  year =         "1992",
+  coden =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
+  acknowledgement = ack-nhfb,
+  affiliation =  "California Inst of Technol, CA, USA",
+  classification = "723; 921",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "Applications; Computer Graphics; Feynman Diagrams;
+                 Mathematical Techniques --- Tensors",
+  who = "Havran Vlastimil: CGE-0038",
+}
+
+@Article{Blinn:1992:JBCb,
+  author =       "James F. Blinn",
+  title =        "{Jim Blinn}'s Corner --- Uppers and downers",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "12",
+  number =       "2",
+  pages =        "85--91",
+  month =        mar,
+  year =         "1992",
+  coden =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
+  acknowledgement = ack-nhfb,
+  affiliation =  "California Inst of Technol, CA, USA",
+  classification = "723; 921",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "Computational Geometry; Computer Graphics;
+                 Mathematical Techniques; Mathematical Techniques ---
+                 Tensors; Matrix Algebra",
+  who = "Havran Vlastimil: CGE-0037",
+}
+
+@Article{RavadaSherman,
+  author =       "S. Ravada and A. T. Sherman",
+  title =        "Experimental evaluation of a partitioning algorithm
+                 for the {Steiner} tree problem in {$R^2$} and {$R^3$}",
+  journal =      "Networks",
+  note =         "(to appear)",
+  year =         "1993",
+  url =          "http://www.cs.umbc.edu/\~{}sherman/Rtopics/Algs/steiner.html",
+  postscript =   "http://www.cs.umbc.edu/pub/REPORTS/cs-93-12.ps",
+  who = "Havran Vlastimil: CGE-0036",
+}
+
+@inproceedings{held:cgi:98,
+  author = "M. Held",
+  title = "Efficient and Reliable Triangulation of Polygons",
+  booktitle = "Proceedings of Computer Graphics International '98 (CGI'98)",
+  year = "1998",
+  month = jun,
+  pages = "633--643",
+  address = "Hannover, Germany",
+  publisher = "IEEE, NY",
+  who = "Havran Vlastimil: CGE-0035",
+}
+
+@Article{Kolingerov:1997:CPL,
+  author =       "Ivana Kolingerov",
+  title =        "Convex polyhedron-line intersection detection using
+                 dual representation",
+  journal =      "The Visual Computer",
+  year =         "1997",
+  volume =       "13",
+  number =       "1",
+  pages =        "42--49",
+  publisher =    "Springer-Verlag",
+  note =         "ISSN 0178-2789",
+  keywords =     "intersection detection, dual representation,
+                 line-polyhedron intersection, convex polyhedron,
+                 computer graphics",
+  annote =       "Duality is a well-known principle of computational
+                 geometry. It is often used for detecting the mutual
+                 position of convex geometrical objects, the dimensions
+                 of which do not differ more than by one; e.g., a convex
+                 polyhedron and a hyperplane or two convex polyhedra of
+                 the same dimensions. In this paper, a new possibility
+                 of usage is shown for objects with dimensions different
+                 by two. The mutual position of a convex polyhedron and
+                 a line is tested. The method works as follows. The line
+                 is described as an intersection of two planes. With a
+                 proper choice of these planes, the original problem of
+                 detecting a polyhedron-line intersection is reduced to
+                 a one-dimensional range search, which is much simpler
+                 to solve. The price to be paid for this reduction is
+                 computationally more demanding preprocessing.",
+  who = "Havran Vlastimil: CGE-0034",
+}
+
+@InCollection{Green95gems,
+  author =       "D. Green and D. Hatch",
+  editor =       "Alan W. Paeth",
+  title =        "Fast Polygon-Cube Intersection Testing",
+  booktitle =    "Graphics Gems V",
+  pages =        "375--379",
+  publisher =    "Academic Press",
+  address =      "Boston MA",
+  year =         "1995",
+  who = "Havran Vlastimil: CGE-0033",
+}
+
+@InProceedings{Barequet:1996:HCR,
+  title =        "History Consideration in Reconstructing Polyhedral
+                 Surfaces from Parallel Slices",
+  author =       "Gill Barequet and Daniel Shapiro and Ayellet Tal",
+  booktitle =    "IEEE Visualization '96",
+  organization = "IEEE",
+  year =         "1996",
+  month =        oct,
+  note =         "ISBN 0-89791-864-9",
+ who = "Havran Vlastimil: CGE-0032",
+}
+
+@InProceedings{SODA::AgarwalP1998,
+  title =        "Exact and Approximation Algorithms for Clustering
+                 (Extended Abstract)",
+  author =       "Pankaj K. Agarwal and Cecilia M. Procopiuc",
+  pages =        "658--667",
+  booktitle =    "Proceedings of the Ninth Annual {ACM}-{SIAM} Symposium
+                 on Discrete Algorithms",
+  month =        "25--27 " # jan,
+  year =         "1998",
+  address =      "San Francisco, California",
+  references =   "\cite{ACMCS::AgarwalS1998}
+                 \cite{ICVLDB::AgrawalGIIS1992}
+                 \cite{JALGO::Bar-IlanKP1993}
+                 \cite{STOC::charikarCFM1997}
+                 \cite{ICVLDB::DiwanRSS1996} \cite{STOC::FederG1988}
+                 \cite{IPL::FowlerPT1981} \cite{TCS::Gonzalez1985}
+                 \cite{IPL::Gonzalez1991} \cite{ALGOR::HwangCL1993}
+                 \cite{ALGOR::HwangLC1993} \cite{ESA::KhullerS1996}
+                 \cite{SODA::LuptonMY1996} \cite{SICOMP::MegiddoS1984}
+                 \cite{ICVLDB::NgH1994} \cite{SODA::Raghavan1997}
+                 \cite{ICVLDB::ShaverAM1997} \cite{STOC::ShmoysTA1997}",
+ who = "Havran Vlastimil: CGE-0031",
+}
+
+@techreport{c-accgc-96
+, author =      "Bernard Chazelle and others"
+, title =       "Application Challenges to Computational Geometry: {CG} Impact Task Force Report"
+, type =        "Technical {Report}"
+, number =      "TR-521-96"
+, institution = "Princeton Univ."
+, month =       apr
+, year =        1996
+, url = "http://www.cs.princeton.edu/~chazelle/taskforce/CGreport.ps"
+, comments =    "Also at \path|http://www.cs.duke.edu/~jeffe/compgeom/taskforce.html|"
+, update =      "98.03 mitchell, 97.03 pocchiola+tamassia, 96.09 orourke"
+, who = "Havran Vlastimil: CGE-0030"
+}
+
+
+@Booklet{matousek94:LN,
+  author       =   "Matou\v{s}ek, J.",
+  title        =   "Lecture notes on combinatorial and algorithmic geometry",
+  howpublished =   "Lecture Notes",
+  address      =   "Charles University--Praha",
+  year         =    1998,
+  who = "Havran Vlastimil: CGE-0029",
+}
+
+@techreport{ae-rsir-97
+, author =      "Pankaj K. Agarwal and Jeff Erickson"
+, title =       "Geometric range searching and its relatives"
+, type =        "Tech.\ Report"
+, number =      "CS-1997-11"
+, institution = "Department of Computer Science"
+, address =     "Duke University"
+, year =        1997
+, update =      "98.03 agarwal"
+, who = "Havran Vlastimil: CGE-0028"
+}
+
+techreport{a-rs-96
+, author =      "Pankaj K. Agarwal"
+, title =       "Range searching"
+, type =        "Report"
+, number =      "CS-1996-05"
+, institution = "Dept. Comput. Sci., Duke Univ."
+, address =     "Durham, NC"
+, year =        1996
+, update =      "96.09 agarwal"
+, who = "Havran Vlastimil: CGE-0027"
+}
+
+@inproceedings{aas-lalsp-97
+, author =      "B. Aronov and Pankaj Agarwal and Micha Sharir"
+, title =       "On Levels in Arrangements of Lines, Segments, Planes, and Triangles"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "30--38"
+, update =      "98.03 mitchell, 97.07 efrat"
+, who = "Havran Vlastimil: CGE-0026"
+}
+
+@incollection{dt-cg-97
+, author =      "D. Dobkin and S. Teller"
+, title =       "Computer graphics"
+, chapter =     42
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "779--796"
+, update =      "97.11 orourke"
+, who = "Havran Vlastimil: CGE-0025"
+}
+
+@article{aaas-cvgbr-94
+, author =      "Pankaj K. Agarwal and N. Alon and B. Aronov and Subhash Suri"
+, title =       "Can visibility graphs be represented compactly?"
+, journal =     "Discrete Comput. Geom."
+, volume =      12
+, year =        1994
+, pages =       "347--365"
+, update =      "98.03 mitchell, 96.05 agarwal, 95.01 smid"
+, who = "Havran Vlastimil: CGE-0024"
+}
+
+@article{hs-parss-95
+, author =      "J. Hershberger and Subhash Suri"
+, title =       "A Pedestrian Approach to Ray Shooting: {Shoot} a Ray, Take a Walk"
+, journal =     "J. Algorithms"
+, volume =      18
+, year =        1995
+, pages =       "403--431"
+, keywords =    "mesh generation, triangulation, stabbing number"
+, succeeds =    "hs-parss-93"
+, update =      "98.03 mitchell, 96.05 mitchell+pocchiola"
+, annote =      "Special issue of selected papers from the
+4th Symposium on Discrete Algorithms."
+, who = "Havran Vlastimil: CGE-0023"
+}
+
+@article{k-3vrs2-97
+, author =      "M. J. Katz"
+, title =       "{3-D} vertical ray shooting and {2-D} point enclosure, range searching, and arc shooting amidst convex fat objects"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      8
+, year =        1997
+, pages =       "299--316"
+, update =      "97.11 katz"
+, who = "Havran Vlastimil: CGE-0022"
+}
+
+@article{bgo-nrbsp-97
+, author =      "M. de Berg and M. de Groot and M. Overmars"
+, title =       "New results on binary space partitions in the plane"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      8
+, year =        1997
+, pages =       "317--333"
+, update =      "97.11 oostrum"
+, who = "Havran Vlastimil: CGE-0021"
+}
+
+@inproceedings{aeg-kbspi-98
+, author =      "Pankaj K. Agarwal and Jeff Erickson and Leonidas J. Guibas"
+, title =       "Kinetic binary space partitions for intersecting segments and disjoint triangles"
+, booktitle =   "Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
+, journal =     "Proc. 1st Internat. IEE/IEEE Conf. on Genetic Algorithms in Engineering Systems: Innovations and Applications"
+, year =        1998
+, pages =       "107--116"
+, update =      "98.03 agarwal"
+, who = "Havran Vlastimil: CGE-0020"
+}
+
+@inproceedings{ab-hgach-95
+, author =      "David Avis and David Bremner"
+, title =       "How Good are Convex Hull Algorithms?"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "20--28"
+, keywords =    "vertex enumeration, pivoting"
+, cites =       "af-pachv-92, bdh-qach-93, bl-cacp-93, b-icp-83, cgaf-gstlm-94, ck-acp-70, c-ochaa-93, c-lp-83, cs-adpch-88, d-cvem-83, f-crmv0-, gkz-drmd-94, h-sretn-91, k-pptrl-74, km-hgisa-72, l-epcrn-88, lt-sptcc-91, l-rtp-91, mrtt-ddm-53, s-chaop-81, s-chdch-86, y-stgd-90, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
+, who = "Havran Vlastimil: CGE-0019",
+}
+
+@techreport{pv-pc-96
+, author =      "M. Pocchiola and G. Vegter"
+, title =       "On polygonal covers"
+, number =      "96-16"
+, institution = "Labo. Inf. Ens"
+, address =     "45 rue d'Ulm 75230 Paris, France"
+, month =       jul
+, year =        1996
+, note =        ""
+, keywords =    "illumination, covering, separation"
+, comments =    ""
+, succeeds =    "pv-ptta-96"
+, update =      "97.03 pocchiola"
+, who = "Havran Vlastimil: CGE-0018",
+}
+
+@inproceedings{pv-ptta-96
+, author =      "Michel Pocchiola and Gert Vegter"
+, title =       "Pseudo-Triangulations: Theory and Applications"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "291--300"
+, cites =       "pv-vc-96, pv-cvgpt-95, b-rsdoh-93, c-cgr-95, f-icd-77, ers-ccsno-90, blsz-om-93, rz-rspu-95, pa-cg-95, gp-ms-83, bcm-anlcg-90"
+, update =      "97.11 bibrelex, 96.05 efrat+pocchiola"
+, who = "Havran Vlastimil: CGE-0017",
+}
+
+@inproceedings{bp-sccpa-96
+, author =      "Chandrajit L. Bajaj and Valerio Pascucci"
+, title =       "Splitting a Complex of Convex Polytopes in any Dimension"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "88--97"
+, cites =       "am-dhsrr-95, am-rsss-94, b-rgsdd-93, bd-cdpr-92, be-mgot-92i, c-oaitd-92, cd-icott-87, dk-fdpi-83, e-acg-87, em-sstcd-90, fm-nsala-91, g-cp-67, hk-prga-92, k-opcbf-95, l-ndgcm-94, lc-mchr3-87, lm-cschu-90, m-cgitr-93, m-rpm-93, m-rsehc-93, mhc-avcev-90, n-cgpt-93, nat-mbtyp-90, pbcf-dimsc-93, pfp-diccb-95, py-ebsph-90, s-lrapi-94, s-rcaic-94, t-cpos-92, tn-sopub-87, v-bimsp-91, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
+, who = "Havran Vlastimil: CGE-0016",
+}
+
+@incollection{g-dirsc-94
+, author =      "Ned Greene"
+, title =       "Detecting Intersection of a Rectangular Solid and a Convex Polyhedron"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "74--82"
+, keywords =    "collision detection, octree, computational geometry"
+, update =      "94.09 heckbert"
+, annote =      "Presents an optimized technique to test for intersection
+between a convex polyhedron and a box. This is useful when comparing
+bounding boxes against a viewing frustum in a rendering program, for
+instance. Contains pseudocode."
+, who = "Havran Vlastimil: CGE-0015",
+}
+
+@techreport{as-eago-96
+, author =      "Pankaj K. Agarwal and Micha Sharir"
+, title =       "Efficient algorithms for geometric optimization"
+, type =        "Tech.\ Report"
+, number =      "CS-1996-19"
+, institution = "Dept. Computer Science, Duke University"
+, year =        1996
+, update =      "97.07 agarwal"
+, who = "Havran Vlastimil: CGE-0014",
+}
+
+@inproceedings{as-rsacp-93
+, author =      "Pankaj K. Agarwal and M. Sharir"
+, title =       "Ray Shooting Amidst Convex Polytopes in Three Dimensions"
+, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1993
+, pages =       "260--270"
+, precedes =    "as-rsacp-96ii"
+, update =      "96.05 smid, 93.05 smid"
+, who = "Havran Vlastimil: CGE-0013",
+}
+
+@article{as-rsacp-96i
+, author =      "P. K. Agarwal and M. Sharir"
+, title =       "Ray shooting amidst convex polygons in {2D}"
+, journal =     "J. Algorithms"
+, volume =      21
+, year =        1996
+, pages =       "508--519"
+, update =      "97.03 agarwal+pocchiola+smid, 96.09 agarwal, 96.05 agarwal"
+, who = "Havran Vlastimil: CGE-0012",
+}
+
+@TechReport{EVL-1996-11,
+  author =       "Andr{\'e} Hinkenjann and Markus Kubuk and Heinrich
+                 M{\"u}ller",
+  title =        "Answering Line Segment Intersection Queries Based On
+                 Sample Answers",
+  number =       "620/1996",
+  type =         "Research Report",
+  institution =  "University of Dortmund",
+  address =      "Universit{\"a}t Dortmund, 44221 Dortmund, Germany",
+  month =        aug,
+  year =         "1996",
+  abstract =     "Geometric query problems can be solved by
+                 preprocessing the answers for a representative set of
+                 sample queries. An arbitrary query is answered by the
+                 response of a closest sample query. In general, this
+                 answer will not be correct. A framework is presented in
+                 which the quality of approximation of this approach can
+                 be characterized. Futher, efficiency considerations are
+                 performed. They consist in empirical experiments for
+                 the classical line segment intersection query problem,
+                but also in giving theoretical time and space bounds
+                 describing the trade-off between quality of
+                 approximation and computational complexity. Finally,
+                 approaches to the choice of favorable sample queries
+                 are discussed.",
+  postscript-url = "ftp://euklid.informatik.uni-dortmund.de/pub/reports/ls7/rr-6
+20.ps.gz",
+  evlib-url =    "http://infovis.zib.de:8000/Dienst/UI/2.0/Describe/evl.computat
+ionalgeometry%2FEVL-1996-11",
+  evlib-revision = "1st",
+  evlib-postscript-md5 = "14a18f6a52af153a3c3eb1c7037c344c",
+  who = "Havran Vlastimil: CGE-0011",
+}
+
+@article{m-vrsa-93
+, author =      "J. Matou{\v s}ek"
+, title =       "On Vertical Ray Shooting in Arrangements"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      2
+, number =      5
+, month =       mar
+, year =        1993
+, pages =       "279--285"
+, keywords =    "ray shooting, zone theorem, cutting, hyperplane arrangement"
+, update =      "93.09 held+matousek+milone+mitchell"
+,  who = "Havran Vlastimil: CGE-0010",
+}
+
+@incollection{as-atgo-95
+, author =      "P. K. Agarwal and Micha Sharir"
+, title =       "Algorithmic techniques for geometric optimization"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1000
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "234--253"
+, update =      "98.03 mitchell, 97.11 bibrelex"
+,  who = "Havran Vlastimil: CGE-0009",
+}
+
+article{h-iarat-96
+, author =      "Philip M. Hubbard"
+, title =       "Improving Accuracy in a Robust Algorithm for Three-Dimensional {Voronoi} Diagrams"
+, journal =     "Journal of Graphics Tools"
+, volume =      1
+, number =      1
+, year =        1996
+, pages =       "33--47"
+, update =      "96.09 held+hubbard"
+, annote =      "Extends \cite{iss-nriac-92}"
+, abstract =    "This paper describes extensions to a previous algorithm that
+                 robustly builds three-dimensional Voronoi diagrams in the
+                 presence of inexact numerical computations.  The extensions
+                 improve the algorithm's accuracy, making its results more
+                 nearly represent the proximity properties of an ideal
+                 Voronoi diagram.  In empirical tests, these extensions have
+                 improved accuracy by more than eight orders of magnitude.
+                 Complete pseudocode for the algorithm appears in an appendix
+                 of this paper."
+,  who = "Havran Vlastimil: CGE-0008",
+}
+
+@article{yn-sbgtc-97
+, author =      "F. Yamaguchi and M. Niizeki"
+, title =       "Some Basic Geometric Test Conditions in Terms of Pluecker Coordinates and Pluecker Coefficients"
+, journal =     "Visual Comput."
+, volume =      13
+, number =      1
+, year =        1997
+, pages =       "29--41"
+, update =      "97.03 held"
+,  who = "Havran Vlastimil: CGE-0007",
+}
+
+@incollection{m-ccpps-91
+, author =      "J. Matou{\v s}ek"
+, title =       "Computing the center of planar point sets"
+, editor =      "J. E. Goodman and R. Pollack and W. Steiger"
+, booktitle =   "Computational Geometry: papers from the DIMACS special year"
+, publisher =   "American Mathematical Society"
+, address =     "Providence"
+, year =        1991
+, pages =       "221--230"
+, keywords =    "centerpoint, parametric search, cutting, k-level"
+, update =      "96.05 agarwal, 93.09 matousek"
+,  who = "Havran Vlastimil: CGE-0006",
+}
+
+@article{m-dcg-96
+, author =      "J. Matou{\v s}ek"
+, title =       "Derandomization in computational geometry"
+, journal =     "J. Algorithms"
+, volume =      20
+, year =        1996
+, pages =       "545--580"
+, update =      "97.03 smid"
+,  who = "Havran Vlastimil: CGE-0005",
+}
+
+@inproceedings{amv-ptcbs-97
+, author =      "P. Agarwal and T. Murali and J. Vitter"
+, title =       "Practical techniques for constructing binary space partitions for orthogonal rectangles"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "382--384"
+, update =      "97.07 efrat"
+, who = "Havran Vlastimil: CGE-0004",
+}
+
+@inproceedings{agm-bspfr-96
+, author =      "P. K. Agarwal and E. F. Grove and T. M. Murali and J. S. Vitter"
+, title =       "Binary Space Partitions for Fat Rectangles"
+, booktitle =   "Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci."
+, site =        "Burlington, VT"
+, month =       oct
+, year =        1996
+, pages =       "482--491"
+, update =      "97.07 smid, 97.03 murali"
+, who = "Havran Vlastimil: CGE-0003",
+}
+
+@inproceedings{agmv-cskbs-97
+, author =      "Pankaj K. Agarwal and Leonidas J. Guibas and T. M. Murali and Jeffrey Scott Vitter"
+, title =       "Cylindrical Static and Kinetic Binary Space Partitions"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "39--48"
+, update =      "97.07 agarwal+efrat"
+, who = "Havran Vlastimil: CGE-0002",
+}
+
+@InProceedings{Agarwal94soda,
+  author =       "Pankaj K. Agarwal and Subhash Suri",
+  title =        "Surface Approximation and Geometric Partitions",
+  booktitle =    "Proc. 5th ACM-SIAM Sympos. Discrete Algorithms",
+  year =         "1994",
+  pages =        "24--33",
+  keywords =     "triangulation, ray shooting",
+  update =       "95.01 mitchell",
+  annote =       "polygonal approximation of terrains within log factor
+                 of optimal",
+  note =         "(Also available as Duke U. CS tech report, URL {ftp://ftp.cs.duke.edu/dist/techreport/1994/1994-21.ps.Z})",
+  who = "Havran Vlastimil: CGE-0001",
+}
+
+@book{bkos-cgaa-97
+, author =      "Mark de Berg and Marc van Kreveld and Mark Overmars and Otfried Schwarzkopf"
+, title =       "Computational Geometry: Algorithms and Applications"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin"
+, year =        1997
+, isbn =        "3-540-61270-X"
+, url = "http://www.cs.ruu.nl/geobook/"
+, keywords =    "textbook"
+, update =      "98.03 agarwal+mitchell, 97.11 oostrum+orourke"
+, who = "Havran Vlastimil: CGE-0087"
+}
+
Index: trunk/VUT/doc/SciReport/Bib/vismame.bib
===================================================================
--- trunk/VUT/doc/SciReport/Bib/vismame.bib	(revision 243)
+++ trunk/VUT/doc/SciReport/Bib/vismame.bib	(revision 243)
@@ -0,0 +1,1665 @@
+
+@TechReport{EVL-1998-675,
+  author =       "Andr{\'e} Hinkenjann and Heinrich M{\"u}ller",
+  title =        "Determining Visibility between Extended Objects",
+  number =       "675/1998",
+  type =         "Research Report",
+  institution =  "University of Dortmund",
+  address =      "Universit{\"a}t Dortmund, 44221 Dortmund, Germany",
+  month =        aug,
+  year =         "1998",
+  who  = "Havran Vlastimil: VIS-0090",
+}
+
+@TechReport{EVL-1996-10,
+  author =       "Andr{\'e} Hinkenjann and Heinrich M{\"u}ller",
+  title =        "Hierarchical Blocker Trees for Global Visibility
+                 Calculation",
+  number =       "621/1996",
+  type =         "Research Report",
+  institution =  "University of Dortmund",
+  month =        aug,
+  year =         "1996",
+  abstract =     "We present a technique to determine visibility within
+                 geometric scenes, as required for more advanced
+                 rendering approaches in computer graphics. Visibility
+                 types considered are completely visible, completely
+                 blocked and partially blocked. In a preprocessing step,
+                 the given scene is recursively subdivided into a
+                 hierarchy of subscenes. For each resulting subscene, a
+                 so called blocker tree is calculated which holds
+                 information about the visibility type of viewing lines
+                 passing through a bounding box enclosing the scene. The
+                 resulting hierarchical blocker tree is used to answer
+                 queries for the visibility between two subscenes. This
+                 approach is implemented in flatland based on quadtrees,
+                 and analyzed experimentally.",
+  postscript-url = "ftp://euklid.informatik.uni-dortmund.de/pub/reports/ls7/rr-6
+21.ps.gz",
+  evlib-url =    "http://infovis.zib.de:8000/Dienst/UI/2.0/Describe/evl.computat
+ionalgeometry%2FEVL-1996-10",
+  evlib-revision = "1st",
+  evlib-postscript-md5 = "2abfecb868f469b0af855c1167f7dd14",
+  who  = "Havran Vlastimil: VIS-0089",
+}
+
+@inproceedings{addpp-vr-95,
+ author =      "Boris Aronov and Alan R. Davis and Tamal K. Dey and
+                Sudebkumar P. Pal and D. Chithra Prasad",
+ title =       "Visibility with Reflection",
+ booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom.",
+ year =        1995,
+ pages =       "316--325",
+ keywords =    "mirrors",
+ cites =       "addpp-vmr-95, ak-frtrc-87, bo-arcgi-79, dpp-agpvr-95,
+                ea-lacvp-81, fkn-vsgpt-80, ghlst-ltavs-87, g-bp-86,
+                hv-splsp-49,  k-ealdp-89, kw-onupp-91, l-vsp-83, ll-ccagp-86,
+                lpsssstwy-clcsp-88, o-agta-87, rty-ccrt-94, s-rrag-92,
+                s-mlppr-87, s-sldps-90, ZZZ",
+ update =      "98.03 bibrelex, 95.09 mitchell",
+ who  = "Havran Vlastimil: VIS-0088",
+}
+
+@Article{Sharir:1992:SOS,
+  author =       "Micha Sharir and Mark H. Overmars",
+  title =        "A Simple Output-Sensitive Algorithm for Hidden Surface
+                 Removal",
+  journal =      "ACM Transactions on Graphics",
+  volume =       "11",
+  number =       "1",
+  pages =        "1--11",
+  month =        jan,
+  year =         "1992",
+  coden =        "ATGRDF",
+  ISSN =         "0730-0301",
+  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
+  url =          "http://www.acm.org/pubs/toc/Abstracts/0730-0301/112141.html",
+  abstract =     "We derive a simple output-sensitive algorithm for
+                 hidden surface removal in a collection of n triangles
+                 in space for which a (partial) depth order is known. If
+                 $k$ is the combinatorial complexity of the output
+                 visibility map, the method runs in time $O(n\sqrt{k}
+                 \log n)$. The method is extended to work for other
+                 classes of objects as well, sometimes with even
+                 improved time bounds. For example, we obtain an
+                 algorithm that performs hidden surface removal for n
+                 (nonintersecting) balls in time $O(n^{3/2}\log n+k)$",
+  acknowledgement = ack-nhfb,
+  keywords =     "algorithms; hidden surface removal; theory",
+  subject =      "{\bf I.3.7}: Computing Methodologies, COMPUTER
+                 GRAPHICS, Three-Dimensional Graphics and Realism,
+                 Hidden line/surface removal. {\bf F.2.2}: Theory of
+                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
+                 COMPLEXITY, Nonnumerical Algorithms and Problems,
+                 Geometrical problems and computations. {\bf I.3.5}:
+                 Computing Methodologies, COMPUTER GRAPHICS,
+                 Computational Geometry and Object Modeling, Geometric
+                 algorithms, languages, and systems.",
+  who  = "Havran Vlastimil: VIS-0087",
+}
+
+@InProceedings{Westermann:1997:VVO,
+  author =       "R{\"{u}}diger Westermann and Thomas Ertl",
+  title =        "The {VSBUFFER}: Visibility Ordering of Unstructured
+                 Volume Primitives by Polygon Drawing",
+  booktitle =    "IEEE Visualization \'97",
+  editor =       "Roni Yagel and Hans Hagen",
+  year =         "1997",
+  organization = "IEEE",
+  month =        nov,
+  pages =        "35--42",
+  who  = "Havran Vlastimil: VIS-0086",
+}
+
+@InProceedings{COZ-gi98,
+  title =        "Visibility Streaming for Network-based Walkthroughs",
+  author =       "Daniel Cohen-Or and Eyal Zadicario",
+  booktitle =    "Graphics Interface",
+  year =         "1998",
+  month =        jun,
+  pages =        "1--7",
+  who  = "Havran Vlastimil: VIS-0085",
+}
+
+@InProceedings{Soler:1996:AEB,
+  author =       "Cyril Soler and Fran{\c{c}}ois Sillion",
+  title =        "Accurate Error Bounds for Multi-Resolution
+                 Visibility",
+  booktitle =    "Eurographics Rendering Workshop 1996",
+  editor =       "Xavier Pueyo and Peter Schr{\"{o}}der",
+  year =         "1996",
+  organization = "Eurographics",
+  publisher =    "Springer Wein",
+  address =      "New York City, NY",
+  month =        jun,
+  pages =        "133--142",
+  note =         "ISBN 3-211-82883-4",
+  keywords =     "error bounds, hierarchical radiosity, multi-resolution
+                 visibility, error-driven refinement, visibility
+                 correlation",
+  annote =       "We propose a general error-driven algorithm to compute
+                 form factors in complex scenes equipped with a suitable
+                 cluster hierarchy. This opens the way for the efficient
+                 approximation of form factors in a controlled manner,
+                 with guaranteed error bounds at every stage of the
+                 calculation. In particular we discuss the issues of
+                 bounding the error in the form factor approximation
+                 using average cluster transmittance, combining
+                 subcluster calculations with proper treatment of
+                 visibility correlation, and the calculation and storage
+                 of the necessary information in the hierarchy. We
+                 present results from a 2D implementation, that
+                 demonstrate the validity of the approach; the form
+                 factor approximations are efficiently bounded by the
+                 user-supplied threshold.",
+  who  = "Havran Vlastimil: VIS-0084",
+}
+
+@Article{Pueyo:1996:OAT,
+  author =       "Xavier Pueyo and Frederic P{\'e}rez and Toni
+                 Sellar{\`e}s and Josep Suy",
+  title =        "An object-oriented approach for teaching visibility
+                 computation algorithms",
+  journal =      "Computers and Graphics",
+  volume =       "20",
+  number =       "4",
+  pages =        "605--610",
+  month =        jul # "--" # aug,
+  year =         "1996",
+  coden =        "COGRD2",
+  ISSN =         "0097-8493",
+  bibdate =      "Wed Feb 5 07:22:58 MST 1997",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Universitat de Girona",
+  affiliationaddress = "Spain",
+  classification = "721.1; 723; 723.5; 921.4",
+  journalabr =   "Comput Graphics (Pergamon)",
+  keywords =     "Abstraction; Algorithms; Computational complexity;
+                 Computational geometry; Computer graphics; Object
+                 recognition; Ray casting; Scan line; Visibility
+                 computation algorithms; Visualization",
+  who  = "Havran Vlastimil: VIS-0083",
+}
+
+@InProceedings{james-cgf-98,
+   author =       "A. James and A.M. Day",
+   title =        "The Priority Face Determination Tree for Hidden Surface
+                  Removal",
+   pages =        "55-71",
+   booktitle =      "Computer Graphics Forum",
+   volume =       "17",
+   number =       "1",
+   year =         "1998",
+   month =        "march",
+   who  = "Havran Vlastimil: VIS-0082",
+}
+
+@inproceedings{james-eguk-98,
+  author = "A. James and A.M. Day",
+  title = "Conflict Neutralization on Binary Space Partitioning
+           (extended abstract)",
+  booktitle = "Eurographics UK Proceedings",
+  year = 1998,
+  month = "march",
+  volume = 16,
+  pages = "225 - 229",
+  who = "Havran Vlastimil: VIS-0081",
+}
+
+@inproceedings{james-eguk-97,
+  author = "A. James and A.M. Day",
+  title = "The Priority Face Determination Tree",
+  booktitle = "Eurographics UK Proceedings",
+  year = 1997,
+  month = "march",
+  volume = 15,
+  pages = "21 - 46",
+  who = "Havran Vlastimil: VIS-0080",
+}
+
+@inproceedings{cohen-egc-98,
+  author = "D. Cohen-Or and G. Fibich and D. Halperin and E. Zadicario",
+  title = "Conservative Visibility and Strong Occlusion for Viewspace
+           Partitioning of Densely Occluded Scenes",
+  booktitle = "EUROGRAPHICS'98",
+  year = "1998",
+  who = "Havran Vlastimil: VIS-0079",
+}
+
+@InCollection{deb93,
+  author =       "M. De Berg",
+  title =        "Ray shooting, Depth Orders and Hidden Surface
+                 Removal",
+  year =         "1993",
+  booktitle =    "Lecture Notes in Computer Science",
+  volume =       "703",
+  publisher =    "Springer Verlag, New York",
+  topic =        "visibility",
+  who = "Havran Vlastimil: VIS-0078",
+}
+
+@InProceedings{Funkhouser98,
+  author =       "Thomas Funkhouser and Ingrid Carlbom and Gary Elko and
+                 Gopal Pingali and Mohan Sondhi and Jim West",
+  title =        "A Beam Tracing Approach to Acoustic Modeling for
+                 Interactive Virtual Environments",
+  booktitle =    "Computer Graphics (Proceedings of SIGGRAPH '98)",
+  pages =        "21--32",
+  month =        jul,
+  year =         "1998",
+  who = "Havran Vlastimil: VIS-0077",
+}
+
+@PhdThesis{Teller92phd,
+  author =       "Seth J. Teller",
+  title =        "Visibility Computations in Densely Occluded Polyhedral
+                 Environments",
+  school =       "CS Division, UC Berkeley",
+  month =        oct,
+  year =         "1992",
+  note =         "Tech. Report UCB/CSD-92-708",
+  keywords =     "computational geometry, architectural walkthrough",
+  who = "Havran Vlastimil: VIS-0076",
+}
+
+@InProceedings{Aliaga:1997:AWU,
+  author =       "Daniel G. Aliaga and Anselmo A. Lastra",
+  title =        "Architectural Walkthroughs Using Portal Textures",
+  booktitle =    "IEEE Visualization \'97",
+  editor =       "Roni Yagel and Hans Hagen",
+  year =         "1997",
+  organization = "IEEE",
+  month =        nov,
+  pages =        "355--362",
+  who = "Havran Vlastimil: VIS-0075",
+}
+
+@InProceedings{Stewart93-OSACS,
+  author =       "A. James Stewart and Sherif Ghali",
+  month =        aug,
+  year =         "1993",
+  title =        "An {Output} {Sensitive} {Algorithm} for the
+                 {Computation} of {Shadow} {Boundaries}",
+  booktitle =    "Canadian Conference on Computational Geometry",
+  pages =        "291--296",
+  who = "Havran Vlastimil: VIS-0074", 
+}
+
+@InProceedings{Kumar:1996:HBF,
+  author =       "Subodh Kumar and Dinesh Manocha and William Garrett
+                 and Ming Lin",
+  title =        "Hierarchical Back-Face Computation",
+  booktitle =    "Eurographics Rendering Workshop 1996",
+  editor =       "Xavier Pueyo and Peter Schr{\"{o}}der",
+  year =         "1996",
+  organization = "Eurographics",
+  publisher =    "Springer Wein",
+  address =      "New York City, NY",
+  month =        jun,
+  pages =        "235--244",
+  note =         "ISBN 3-211-82883-4",
+  annote =       "We present a sub-linear algorithm to compute the set
+                 of back-facing polygons in a polyhedral model. The
+                 algorithm partitions the model into hierarchical
+                 clusters based on the orientations and positions of the
+                 polygons. As a pre-processing step, the algorithm
+                 constructs spatial decompositions with respect to each
+                 cluster. For a sequence of back-face computations, the
+                 algorithm exploits the coherence in view-point movement
+                 to efficiently determine if it is in front of or behind
+                 a cluster. Due to coherence, the algorithm's
+                 performance is linear in the number of clusters on
+                 average. We have applied this algorithm to speed up the
+                 rendering of polyhedral models. On average, we are able
+                 to cull almost half the polygons. The algorithm
+                 accounts for 5 - 10% of the total CPU time per frame on
+                 an SGI Indigo2 Extreme. The overall frame rate is
+                 improved by 40 - 75% as compared to the standard
+                 back-face culilng implemented in hardware.",
+    who = "Havran Vlastimil: VIS-0073",
+}
+
+@InProceedings{Zhang97a,
+  author =       "Hansong Zhang and Kenneth E. Hoff III",
+  month =        "???",
+  year =         "1997",
+  title =        "Accelerated Walkthrough of Large Spline Models",
+  booktitle =    "Symposium on Interactive 3D Graphics, 1997",
+  who  = "Havran Vlastimil: VIS-0072",
+}
+
+@Article{Orti:1996:RDS,
+  author =       "Rachel Orti and Stephane Riviere and Fredo Durand and
+                 Claude Puech",
+  title =        "Radiosity for Dynamic Scenes in Flatland with the
+                 Visibility Complex",
+  journal =      "Com{\-}pu{\-}ter Graphics Forum",
+  volume =       "15",
+  number =       "3",
+  pages =        "C237--C248",
+  month =        sep,
+  year =         "1996",
+  coden =        "CGFODY",
+  ISSN =         "0167-7055",
+  bibdate =      "Tue Mar 17 15:44:38 MST 1998",
+  acknowledgement = ack-nhfb,
+  affiliation =  "iMAGIS\slash GRAVIR - IMAG",
+  affiliationaddress = "Grenoble, Fr",
+  affiliationaddress = "Fr",
+  classification = "723.2; 723.5; 741.1; 741.2; 921.4; C4260
+                 (Computational geometry); C6130B (Graphics
+                 techniques)",
+  conference =   "Proceedings of the 1996 17th Annual Conference and
+                 Exhibition of the European Association for Computer
+                 Graphics, EUROGRAPHICS'96",
+  conflocation = "Poitiers, France; 26-30 Aug. 1996",
+  conftitle =    "European Association for Computer Graphics 17th Annual
+                 Conference and Exhibition. EUROGRAPHICS '96",
+  corpsource =   "IMAG, Grenoble, France",
+  journalabr =   "Comput Graphics Forum",
+  keywords =     "Algorithms; Architectural simulation; Calculations;
+                 Computational geometry; Computer graphics; Computer
+                 simulation; Data structures; Discontinuity mesh; Form
+                 factor; Global illumination; Image synthesis; Lighting;
+                 Lighting design; Radiosity; Static environment; Three
+                 dimensional; Two dimensional; Visibility; Visibility
+                 complex; Visualization",
+  keywords =     "2D method; algorithm; Algorithms; Architectural
+                 simulation; brightness; Calculations; computational
+                 geometry; Computational geometry; computational
+                 geometry; computer graphics; Computer graphics;
+                 Computer simulation; data structure; Data structures;
+                 discontinuity mesh; Discontinuity mesh; discontinuity
+                 mesh; dynamic environments; dynamic scenes; factors;
+                 flatland; form; Form factor; global; Global
+                 illumination; illumination; Image synthesis; image
+                 synthesis; Lighting; lighting; Lighting design;
+                 polygonal scenes; Radiosity; radiosity method; Static
+                 environment; static scenes; Three dimensional; Two
+                 dimensional; visibility; Visibility; visibility;
+                 Visibility complex; visibility complex; Visualization",
+  meetingaddress = "Poitiers, Fr",
+  meetingdate =  "Aug 26--30 1996",
+  meetingdate2 = "08/26--30/96",
+  sponsor =      "CNRS; ERCIM; BARCO; EDF; SUN; et al",
+  sponsororg =   "CNRS; BARCO; Electr. France; et al",
+  treatment =    "T Theoretical or Mathematical",
+  who = "Havran Vlastimil: VIS-0071",
+}
+
+@InProceedings{Kumar97,
+  author =       "Subodh Kumar and  Dinesh Manocha and  Kenneth E. Hoff III and                  Hansong Zhang",
+  month =        "???",
+  year =         "1997",
+  title =        "Accelerated Walkthrough of Large Spline Models",
+  booktitle =    "Symposium on Interactive 3D Graphics, 1997",
+  who  = "Havran Vlastimil: VIS-0070",
+}
+
+@InProceedings{Orti96-UVCRC,
+  author =       "Rachel Orti and Stephane Riviere and Fredo Durand and
+                 Claude Puech",
+  month =        may,
+  year =         "1996",
+  title =        "Using the {Visibility} {Complex} for {Radiosity}
+                 {Computation}",
+  booktitle =    "Lecture Notes in Computer Science (Applied
+                 Computational Geometry: Towards Geometric
+                 Engineering)",
+  volume =       "1148",
+  pages =        "177--190",
+  publisher =    "Springer-Verlag",
+  address =      "Berlin, Germany",
+  who  = "Havran Vlastimil: VIS-0069",
+}
+
+@Article{EVL-1996-194,
+  author =       "R. Yagel and W. Ray",
+  title =        "Visibility Computation for Efficient Walkthrough
+                 Complex Environments",
+  journal =      "PRESENCE",
+  volume =       "5",
+  number =       "1",
+  pages =        "1--16",
+  year =         "1996",
+  language =     "en",
+  abstract =     "In many virtual reality applications as well as
+                 general computer graphics we need to consider large
+                 numbers of objects in order to render one image. In
+                 many cases rendering can be preceded by a culling phase
+                 which employs simple mechanisms to reject most of the
+                 objects. As a result, only a very small portion of the
+                 model has to go through the time consuming process of
+                 hidden object removal. We report on such a culling
+                 mechanism that is based on regular space subdivision
+                 into cells followed by cell classification into
+                 interior, exterior, and wall cells. A special
+                 cell-to-cell visibility algorithm is then activated
+                 between every two non-exterior cells. Only the objects
+                 in the potentially visible set of cells are actually
+                 submitted to the hidden object removal algorithm. We
+                 report on the implementation of the algorithm and its
+                 performance for walkthrough of various environments.",
+  postscript-url = "http://www.cis.ohio-state.edu/volviz/Papers/1995/presence.ps.gz",
+  evlib-url =    "http://visinfo.zib.de:80/Dienst/UI/2.0/Describe/evl.volumerendering%2FEVL-1996-194",
+  postscript-url-md5 = "614ddffe140b1fb6e4b238c7923097aa",
+  evlib-revision = "1st",
+  who = "Havran Vlastimil: VIS-0068",
+}
+
+@TechReport{Krishnan:TR94063:1994,
+  author = "S. Krishnan and D. Manocha",
+  number = "TR94-063",
+  title = "Global Visibility and Hidden Surface Algorithms for Free Form Surfaces",
+  institution = "University of North Carolina, Chapel Hill, NC 27599-3175",
+  year = 1994,
+  month = nov,
+  documentURL = "ftp://ftp.cs.unc.edu/pub/users/manocha/papers/visibility/visib.ps.Z",
+  who = "Havran Vlastimil: VIS-0067",
+}
+
+@Misc{Hoff98,
+  author = "Kenneth E. Hoff III",
+  title = "Faster 3D Game Graphics by Not Drawing What Is Not Seen",
+  documentURL = "http://www.acm.org/crossroads/xrds3-4/faster3d.html",
+  who  = "Havran Vlastimil: VIS-0066",
+}
+
+@InProceedings{Luebke:1995:PMS,
+  author =       "David Luebke and Chris Georges",
+  title =        "Portals and Mirrors: Simple, Fast Evaluation of
+                 Potentially Visible Sets",
+  editor =       "Pat Hanrahan and Jim Winget",
+  pages =        "105--106",
+  booktitle =    "1995 Symposium on Interactive {3D} Graphics",
+  year =         "1995",
+  organization = "ACM SIGGRAPH",
+  month =        apr,
+  who  = "Havran Vlastimil: VIS-0065",
+}
+
+@Misc{Holmes96,
+  author = "John Holmes",
+  title = "Binary Space Partitioning (BSP) Trees",
+  documentURL = "http://www.cis.ufl.edu/~jch/is-final.ps",
+  who  = "Havran Vlastimil: VIS-0064",
+}
+
+@Misc{BSPFAQ,
+  author = "et al",
+  title = "BSP Tree Frequently Asked Questions (FAQ)",
+  documentURL = "http://reality.sgi.com/bspfaq/",
+  who  = "Havran Vlastimil: VIS-0063",
+}
+
+@Misc{Campbel96,
+  author = "A.T. Campbell, III",
+  title = "BSP Trees: An Introduction and an Implementation",
+  year = 1996,
+  month = mar,
+  pages = "8",
+  who  = "Havran Vlastimil: VIS-0062",
+}
+
+@InProceedings{Martinka95a,
+  author =       "Josef Martinka and Ludovit Niepel and Andrej Ferko",
+  title =        "Sweeping Algorithm for Scene Visibility Graph",
+  pages =        "11--16",
+  booktitle =    "Summer school in computer graphics in Bratislava (SCCG95)",
+  year =         "1995",
+  month =        jun,
+  keywords =     "ray tracing",
+  who  = "Havran Vlastimil: VIS-0061",
+}
+
+@InProceedings{Sojka92,
+  author =       "E. Sojka",
+  title =        "Potencial viditelnosti a jeho vypocet",
+  booktitle =    "Winter School of Computer Graphics 1992",
+  year =         "1992",
+  month =        "feb",
+  pages =        "36--46",
+  note =         "held at University of West Bohemia, Plzen, Czech
+                 Republic, February 1992",
+  who = "Havran Vlastimil: VIS-0060",
+}
+
+@InProceedings{Fuchs80a,
+  author =       "Fuchs, H. and Kedem, Z. M. and Naylor, B. F.",
+  title =        "On Visible Surface Generation by a Priori Tree Structures",
+  pages =        "124--133",
+  booktitle =      "Computer Graphics (SIGGRAPH '80 Proceedings)",
+  volume =       "14",
+  number =       "3",
+  year =         "1980",
+  month =        jul,
+  keywords =     "graphical data/base/structures, Algorithmic Aspects hidden line/surface removal, surface generation, Three-Dimensional Graphics realism, Applications of Computer Graphics electrical engineering power engineering, Painter's Algorithm",
+  who = "Havran Vlastimil: VIS-0059",
+}
+
+@TechReport{Cazals:3204:1997,
+  author = "F. Cazals and M. Sbert",
+  number = "RR-3204",
+  title = "Some integral geometry tools to estimate the complexity of
+           3D scenes",
+  institution = "The French National Institue for Research in
+                 Computer Science and Control (INRIA)",
+  year = 1997,
+  month = jul,
+  documentURL = "ftp://ftp.inria.fr/INRIA/publication/RR/RR-3204.ps.gz",
+  keywords = "Average case analysis, Stochastic geometry, Computer Graphics",
+  who = "Havran Vlastimil: VIS-0058",
+}
+
+@inproceedings{pv-cvgpt-95,
+  author =      "M. Pocchiola and G. Vegter",
+  title =       "Computing the Visibility Graph via Pseudo-Triangulations",
+  booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom.",
+  year =        1995,
+  pages =       "248--257",
+  keywords =    "topological sweep, visibility complex",
+  cites =       "ce-oails-92, eg-tsa-89, gt-ltasc-85, gm-osacv-91,
+                 hmrt-sjslt-86, ow-nmcvg-88, pv-vc-93, s-ec-86,
+                 w-cvgnl-85, ZZZ",
+  update =      "98.03 bibrelex, 96.05 pocchiola, 95.09 mitchell",
+  who = "Havran Vlastimil: VIS-0057",
+}
+
+@inproceedings{pv-vc-93,
+  author =      "M. Pocchiola and G. Vegter",
+  title =       "The visibility complex",
+  booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom.",
+  year =        1993,
+  pages =       "328--337",
+  precedes =    "pv-vc-96",
+  cites =       "cg-vippg-89, gm-osacv-91, hm-oacvp-91, p-gfr-90, v-vddsv-90,
+                 v-dmvg-91, w-cvgnl-85, ZZZ",
+ update =      "98.03 bibrelex, 97.03 devillers, 93.09 jones",
+ who = "Havran Vlastimil: VIS-0056",
+}
+
+@TechReport{Mount:TR9771,
+  author = "David M. Mount and Fan-Tao Pu",
+  number = "UMIACS-TR-96-71",
+  title = "Stabbing Orthogonal Objects in 3-Space",
+  institution = "University of Maryland Institute for Advanced Computer
+                Studies~Dept. of Computer Science, Univ. of Maryland",
+  year = 1996,
+  month = oct,
+  documentURL = "ftp://ftp.cs.umd.edu/pub/papers/papers/3701/3701.ps.Z",
+  keywords = "Lines in 3-space, Plucker coordinates, approximation algorithms,
+              orthogonal polygons, computer graphics",
+  who = "Havran Vlastimil: VIS-0055",
+}
+
+@TechReport{Miller:CS9615,
+ author =      "Timothy Miller",
+ title =       "Hidden-Surfaces: Combining BSP Trees with Graph-Based Algorithms",
+  institution = "Department of Computer Graphics, Brown University",
+  number =      "CS-96-15",
+  month =       apr,
+  year =        1996,
+  documentURL = "http://www.cs.brown.edu/publications/techreports/reports/CS-96-15.html",
+  who = "Havran Vlastimil: VIS-0054",
+}
+
+@inproceedings{chrysanthou:1996:five,
+   author = "Yiorgos Chrysanthou",
+   title = "A Fast and Accurate Shadow Algorithm for Dynamic Scenes",
+   booktitle = "A symposium of the Framework for Immersive Virtual
+                Environments Working Group",
+  year = "1996",
+  month = oct,
+  pages = "??--??",
+  address = "Geneva, Switzerland",
+  who = "Havran Vlastimil: VIS-0053",
+}
+
+@inproceedings{sadagic:1996:five,
+   author = "Amela Sadagic",
+   title = "Fast Approximate Quantitative Visibility for Complex Scenes",
+   booktitle = "A symposium of the Framework for Immersive Virtual
+                Environments Working Group",
+  year = "1996",
+  month = oct,
+  pages = "??--??",
+  address = "Geneva, Switzerland",
+  who = "Havran Vlastimil: VIS-0052",
+}
+
+@inproceedings{chrysanthou:cgi:98,
+  author = "Chrysanthou, Y. and Cohen-Or, D. and Lischinski, D.",
+  title = "Fast Approximate Quantitative Visibility for Complex Scenes",
+  booktitle = "Proceedings of Computer Graphics International '98 (CGI'98)",
+  year = "1998",
+  month = jun,
+  pages = "23--31",
+  address = "Hannover, Germany",
+  publisher = "IEEE, NY",
+  who = "Havran Vlastimil: VIS-0051",
+}
+
+@inproceedings{barelber:cgi:98,
+  author = "Bar-Lev, A. and Elber, G.",
+  title = "Visibility as an Intrinsic Property of Geometric Models",
+  booktitle = "Proceedings of Computer Graphics International '98 (CGI'98)",
+  year = "1998",
+  month = jun,
+  pages = "198--206",
+  address = "Hannover, Germany",
+  publisher = "IEEE, NY",
+  who = "Havran Vlastimil: VIS-0050",
+}
+
+@inproceedings{hinkenjann:cgi:98,
+  author = "Hinkenjann, A. and Muller, H.",
+  title = "Determining Visibility between Extended Objects",
+  booktitle = "Proceedings of Computer Graphics International '98 (CGI'98)",
+  year = "1998",
+  month = jun,
+  pages = "23--31",
+  address = "Hannover, Germany",
+  publisher = "IEEE, NY",
+  who = "Havran Vlastimil: VIS-0049",
+}
+
+@inproceedings{iones:cgi:98,
+  author = "Iones, A. and Zhukov, S. and Krupkin, A.",
+  title = "On Optimality of OBBs for Visibility Tests for Frustrum Culling,
+           Ray Shooting and Collision Detection",
+  booktitle = "Proceedings of Computer Graphics International '98 (CGI'98)",
+  year = "1998",
+  month = jun,
+  pages = "256--263",
+  address = "Hannover, Germany",
+  publisher = "IEEE, NY",
+  who = "Havran Vlastimil: VIS-0048",
+}
+
+
+@inproceedings{bb12590,
+  AUTHOR = "Shimshoni, I. and Ponce, J.",
+  TITLE = "Finite Resolution Aspect Graphs of Polyhedral Objects",
+  BOOKTITLE = "WQV93",
+  YEAR = "1993",
+  PAGES = "140-150",
+  who = "Havran Vlastimil: VIS-0046",
+}
+
+@inproceedings{devai-star-97,
+  author = "F. D\`{e}vai",
+  title = "On the Computational Requirements of Virtual Reality Systems",
+  booktitle = "State of Art, Eurographics'97",
+  year = 1997,
+  who = "Havran Vlastimil: VIS-0045",
+}
+
+
+@article{bb12595,
+        AUTHOR = "Eggert, D.W. and Bowyer, K.W. and Dyer, C.R. and Christensen, H.I. and Goldgof, D.B.",
+        TITLE = "The Scale Space Aspect Graph",
+        JOURNAL = "PAMI",
+        VOLUME = "15",
+        YEAR = "1993",
+        NUMBER = "11",
+        MONTH = "November",
+        PAGES = "1114-1130",
+  who = "Havran Vlastimil: VIS-0044",
+}
+
+@inproceedings{r-tsvcp-95,
+  author =      "St\'{e}phane Rivi\`{e}re",
+  title =       "Topologically Sweeping the Visibility Complex of
+                 Polygonal Scenes",
+  booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom.",
+  year =        1995,
+  pages =       "C36--C37",
+  keywords =    "visibility graph optimal algorithm, experimental",
+  cites =       "eg-tsa-86, gm-osacv-87, ow-nmcvg-88, pv-savgc-93, pv-vc-93,
+                 pv-cvgpt-95, r-ectac-93, ZZZ",
+  update =      "98.03 bibrelex, 95.09 mitchell",
+  who = "Havran Vlastimil: VIS-0043",
+}
+
+@inproceedings{r-wvcav-97,
+  author =      "St\'ephane Rivi\`ere",
+  title =       "Walking in the Visibility Complex with Applications
+                 to Visibility Polygons and Dynamic Visibility",
+  booktitle =   "Proc. 9th Canad. Conf. Comput. Geom.",
+  year =        1997,
+  pages =       "147--152",
+  update =      "97.11 jones",
+  who = "Havran Vlastimil: VIS-0042",
+}
+
+@inproceedings{r-dvpsv-97,
+ author = "S. Rivi{\`e}re",
+ title = "Dynamic visibility in polygonal scenes with the visibility complex",
+ booktitle = "Proc. 13th Annu. ACM Sympos. Comput. Geom.",
+ year = 1997,
+ pages = "421--423",
+ who = "Havran Vlastimil: VIS-0041",
+}
+
+@Article{Slater:1992a,
+  author =       "M. Slater",
+  title =        "A Comparison of Three Shadow Volume Algorithms",
+  journal =      "The Visual Computer",
+  volume =       "9",
+  number =       "1",
+  pages =        "25--38",
+  year =         "1992",
+  who = "Havran Vlastimil: VIS-0040",
+}
+
+@inproceedings{slater97a,
+ author =      "M. Slater and Y. Chrysanthou",
+ title =       "View Volume Culling Using a Probabilistic Caching
+Scheme",
+ booktitle =   "ACM Virtual Reality Software and Technology VRST'97",
+ year =        1997,
+ month = sep,
+ address =      "Lausanne, Switzerland",
+ pages =       "??-??",
+ who = "Havran Vlastimil: VIS-0039", 
+}
+
+@TechReport{Coorg96a,
+ author =      "Coorg, Satyan and Teller, Seth",
+ title =       "A Spatially and Temporally Coherent Object Space Visibility Algorithm",
+  institution = "Department of Computer Graphics, MIT",
+  number =      "TM-546",
+  month =       feb,
+  year =        1996,
+  documentURL = "http://graphics.lcs.mit.edu/~satyan/pubs/mit-lcs-tm-546.ps.Z",
+  who = "Havran Vlastimil: VIS-0038",
+}
+
+@inproceedings{blais98a,
+ author =      "M. Blais and P. Poulin",
+ title =       "Sampling Visibility in Three-Space",
+ booktitle =   "Proc. of the 1998 Western Computer Graphics Symposium",
+ year =        1998,
+ month = apr,
+ pages =       "45--52",
+ who = "Havran Vlastimil: VIS-0037", 
+}
+
+@Article{Sudarsky:1996:OVA,
+  author =       "Oded Sudarsky and Craig Gotsman",
+  title =        "Output-Sensitive Visibility Algorithms for Dynamic
+                 Scenes with Applications to Virtual Reality",
+  journal =      "Com{\-}pu{\-}ter Graphics Forum",
+  volume =       "15",
+  number =       "3",
+  pages =        "C249--C258",
+  month =        sep,
+  year =         "1996",
+  coden =        "CGFODY",
+  ISSN =         "0167-7055",
+  bibdate =      "Tue Mar 17 15:44:38 MST 1998",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Technion - Israel Inst of Technology",
+  affiliationaddress = "Haifa, Isr",
+  affiliationaddress = "Isr",
+  classification = "722.4; 723.1; 723.2; 723.5; 741.2; 921.4; C6120
+                 (File organisation); C6130B (Graphics techniques);
+                 C6150N (Distributed systems software)",
+  conference =   "Proceedings of the 1996 17th Annual Conference and
+                 Exhibition of the European Association for Computer
+                 Graphics, EUROGRAPHICS'96",
+  conflocation = "Poitiers, France; 26-30 Aug. 1996",
+  conftitle =    "European Association for Computer Graphics 17th Annual
+                 Conference and Exhibition. EUROGRAPHICS '96",
+  corpsource =   "Dept. of Comput. Sci., Israel Inst. of Technol.,
+                 Haifa, Israel",
+  journalabr =   "Comput Graphics Forum",
+  keywords =     "Algorithms; Client server design; Computational
+                 geometry; Computer graphics; Computer simulation; Data
+                 structures; Distributed computer systems; Distributed
+                 multi user virtual environment; Dynamic scenes; Output
+                 sensitive visibility algorithm; Temporal bounding
+                 volumes; Virtual reality; Visibility",
+  keywords =     "Algorithms; auxiliary data structure; Client server
+                 design; client-server systems; communications;
+                 Computational geometry; Computer graphics; Computer
+                 simulation; current position; Data structures;
+                 Distributed computer systems; Distributed multi user
+                 virtual environment; distributed virtual; dynamic
+                 object; dynamic objects; dynamic scenes; Dynamic
+                 scenes; environments; hidden feature removal; model;
+                 multiple; Output sensitive visibility algorithm;
+                 output-sensitive visibility algorithms; overhead;
+                 runtime; scene; spatial data; structures; temporal
+                 bounding volumes; Temporal bounding volumes; temporal
+                 bounding volumes; updated spatial data structure;
+                 virtual reality; Virtual reality; Visibility;
+                 visibility; visible graphic primitives",
+  meetingaddress = "Poitiers, Fr",
+  meetingdate =  "Aug 26--30 1996",
+  meetingdate2 = "08/26--30/96",
+  sponsor =      "CNRS; ERCIM; BARCO; EDF; SUN; et al",
+  sponsororg =   "CNRS; BARCO; Electr. France; et al",
+  treatment =    "T Theoretical or Mathematical",
+  who = "Havran Vlastimil: VIS-0036",
+}
+
+@inproceedings{hmclhz-aocus-97,
+ author =      "T. Hudson and D. Manocha and J. Cohen and M. Lin
+                 and K. Hoff and H. Zhang",
+ title =       "Accelerated Occlusion Culling Using Shadow Frustra",
+ booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom.",
+ year =        1997,
+ pages =       "1--10",
+ update =      "97.07 efrat",
+ who = "Havran Vlastimil: VIS-0035", 
+}
+
+@InProceedings{Durand:1996:VCN,
+  author =       "Fr{\'{e}}do Durand and George Drettakis and Claude
+                 Puech",
+  title =        "The {3D} Visibility Complex: {A} New Approach to the
+                 Problems of Accurate Visibility",
+  booktitle =    "Proceedings of Eurographics Rendering Workshop '96",
+  year =         "1996",
+  publisher =    "Springer",
+  month =        jun,
+  pages =        "245--256",
+  keywords =     "visibility, visibility complex, spatial coherence,
+                 discontinuity meshing, form factor",
+  annote =       "Visibility computations are central in any computer
+                 graphics application. The most common way to reduce
+                 this expense is the use of approximate approaches using
+                 spatial subdivision. More recently analytic approaches
+                 efficently encoding visibility have appeared for 2D
+                 (the visibility complex) and for certain limited cases
+                 in 3D (aspect graph, discontinuity meshes). In this
+                 paper we propose a new way of describing and studying
+                 the visibility of 3D space by a dual space of the 3D
+                 lines, such that all the visibility events are
+                 described. A new data-structure is defined, called the
+                 3D visibility complex, which encapsulates all
+                 visibility events. This structure is global and
+                 complete since it encodes all visibility relations in
+                 3D, and is spatially coherent allowing efficient
+                 visibility queries such as view extraction, aspect
+                 graph, discontinuity mesh, or form factor computation.
+                 A construction algorithm and suitable data structures
+                 are sketched.",
+ who = "Havran Vlastimil: VIS-0034",
+}
+
+@InProceedings{Teller:1991:VPI,
+  author =       "Seth J. Teller and Carlo H. S{\'e}quin",
+  title =        "Visibility preprocessing for interactive
+                 walkthroughs",
+  pages =        "61--69",
+  booktitle =    "Computer Graphics (Proceedings of SIGGRAPH '91)",
+  year =         "1991",
+  keywords =     "architectural simulation, linear programming, superset
+                 visibility",
+  who = "Havran Vlastimil: VIS-0033",
+}
+
+@InProceedings{EVL-1997-163,
+  author =       "Hansong Zhang and Dinesh Manocha and Thomas Hudson and
+                 Kenneth E. {Hoff III}",
+  title =        "Visibility Culling Using Hierarchical Occlusion Maps",
+  booktitle =    "Computer Graphics (Proceedings of SIGGRAPH '97)",
+  pages =        "77--88",
+  year =         "1997",
+  keywords =     "visibility culling, interactive display, image
+                 pyramid, occlusion culling, hierarchical data
+                 structures",
+  language =     "en",
+  abstract =     "We present hierarchical occlusion maps (HOM) for
+                 visibility culling on complex models with high depth
+                 complexity. The culling algorithm uses an object space
+                 bounding volume hierarchy and a hierarchy of image
+                 space occlusion maps. Occlusion maps represent the
+                 aggregate of projections of the occluders onto the
+                 image plane. For each frame, the algorithm selects a
+                 small set of objects from the model as occluders and
+                 renders them to form an initial occlusion map, from
+                 which a hierarchy of occlusion maps is built. The
+                 occlusion maps are used to cull away a portion of the
+                 model not visible from the current viewpoint. The
+                 algorithm is applicable to all models and makes no
+                 assumptions about the size, shape, or type of
+                 occluders. It supports approximate culling in which
+                 small holes in or among occluders can be ignored. The
+                 algorithm has been implemented on current graphics
+                 systems and has been applied to large models composed
+                 of hundreds of thousands of polygons. In practice, it
+                 achieves significant speedup in interactive
+                 walkthroughs of models with high depth complexity.",
+  evlib-url =    "http://visinfo.zib.de:80/Dienst/UI/2.0/Describe/evl.computergraphics%2FEVL-1997-163",
+  evlib-revision = "1st",
+  who = "Havran Vlastimil: VIS-0032",
+}
+
+@InProceedings{Kumar:1996:HVC,
+  author =       "Subodh Kumar and Dinesh Manocha",
+  title =        "Hierarcical Visibility Culling for Spline Models",
+  booktitle =    "Graphics Interface '96",
+  editor =       "Wayne A. Davis and Richard Bartels",
+  year =         "1996",
+  organization = "Canadian Information Processing Society",
+  publisher =    "Canadian Human-Computer Communications Society",
+  month =        may,
+  pages =        "142--150",
+  note =         "ISBN 0-9695338-5-3",
+  keywords =     "NURBS rendering, visibility, backpatch, CAGD,
+                 ONE-tree",
+  annote =       "We present hierarchical algorithms for visibilit
+                 culling of spline models. This includes back-patch
+                 culling, a generalization of back-face culling for
+                 polygons to splines. These algorithms are extended to
+                 trimmed surfaces as well. We propose different spatial
+                 approximations for enclosing the normals of spline
+                 surface and compare them for efficiency and
+                 effectiveness on different graphics systems. We extend
+                 the culling algorithms using hierarchical techniques to
+                 collection of surface patches and combine them with
+                 view-frustum culling to formulate a ONE (Object-Normal
+                 Exclusion)-tree for a given model. The algorithm
+                 traverses the ONE-tree at run time and culls away
+                 portions of the model not visible from the current
+                 viewpoint. These algorithms have been implemented and
+                 applied to a number of large models. In practice, we
+                 are able to speed-up the overall spline rendering
+                 algorithms by about 20 - 30% based on back-patch
+                 culling only and by more than 50% using ONE-trees.",
+  who = "Havran Vlastimil: VIS-0031",
+}        
+
+@InProceedings{SOJKA:1995:FMG,
+  author =       "Eduard SOJKA",
+  title =        "Fields, Maps and Graphs of Properties of a Scene",
+  booktitle =    "Compugraphics '95",
+  pages =        "234--245",
+  year =         "1995",
+  month =        dec,
+  editor =       "Harold P. Santo",
+  note =         "ISBN 972-8342-00-4",
+  who = "Havran Vlastimil: VIS-0030",
+}
+
+@InProceedings{Sojka:1994:GPV,
+  author =       "Eduard Sojka",
+  title =        "Graf potencialu viditelnosti",
+  booktitle =    "Winter School of Computer Graphics 1994",
+  year =         "1994",
+  month =        jan,
+  note =         "held at University of West Bohemia, Plzen, Czech
+                 Republic, 19-20 January 1994",
+  keywords =     "graf potencialu viditelnosti, graf aspektu,
+                 viditelnost.",
+  pages = "168--173",
+  annote =       "Clanek podava novy pohled na teorii potencialu
+                 viditelnosti. Tento pohled predpoklada, ze na mnozine
+                 obrazu dane sceny lze zavest relaci ekvivalence. Tato
+                 relace pak indukuje rozklad mnoziny obrazu, ktera je
+                 nekonecna, na konecny pocet trid. Take prostor
+                 obklopujici scenu je dekomponovan na tridy. Ze vsech
+                 bodu jedne tridy vnima pozorovatel ekvivalentni obrazy.
+                 Graf potencialu viditelnosti zachycuje informaci o
+                 techto tridach a vztazich mezi nimi. Predkladana teorie
+                 umoznuje zasadit publikovane pristupy do jednotneho
+                 ramce. Pouziti teorie je ilustrovano na nekolika
+                 prikladech. Graf potencialu viditelnosti muze byt puzit
+                 jako alternativni nebo doplnkovy model sceny a muze byt
+                 uzitecny pri reseni ruznych problemu jako je napriklad
+                 problem viditelnosti, problem navigace ve scene a
+                 problem rozpoznani trojrozmernych objektu.",
+  who = "Havran Vlastimil: VIS-0029",
+}
+
+@InProceedings{Sojka:1995:AGT,
+  author =       "E. Sojka",
+  title =        "Aspect Graphs of Three Dimensional Scenes",
+  booktitle =    "Winter School of Computer Graphics 1995",
+  year =         "1995",
+  month =        feb,
+  pages =        "289--299",
+  note =         "held at University of West Bohemia, Plzen, Czech
+                 Republic, 14-18 February 1995",
+  who = "Havran Vlastimil: VIS-0028",
+}
+
+@Article{Mulmuley:1989:EAH,
+  author =       "Ketan Mulmuley",
+  editor =       "Jeffrey Lane",
+  title =        "An Efficient Algorithm for Hidden Surface Removal",
+  journal =      "Computer Graphics",
+  volume =       "23",
+  number =       "3",
+  pages =        "379--388",
+  month =        jul,
+  year =         "1989",
+  bibsource =    "Graphics/imager/imager.89.bib",
+  conference =   "held in Boston, Massachusetts; 31 July -- 4 August
+                 1989",
+  who = "Havran Vlastimil: VIS-0027",
+}
+
+@InProceedings{Sillion:1995:FBC,
+  author =       "Fran\c{c}ois Sillion and George Drettakis",
+  title =        "Feature-based Control of Visibility Error: {A}
+                 Multi-Resolution Clustering Algorithm for Global
+                 Illumination",
+  pages =        "145--152",
+  booktitle =    "Computer Graphics (Proceedings of SIGGRAPH '95)",
+  year =         "1995",
+  publisher =    "ACM SIGGRAPH/Addison Wesley",
+  month =        aug,
+  who = "Havran Vlastimil: VIS-0026",
+}
+
+@InProceedings{Drettakis:1997:IUG,
+  author =       "George Drettakis and Fran{\c{c}}ois Sillion",
+  title =        "Interactive Update of Global Illumination Using {A}
+                 Line-Space Hierarchy",
+  booktitle =    "SIGGRAPH 97 Conference Proceedings",
+  editor =       "Turner Whitted",
+  series =       "Annual Conference Series",
+  year =         "1997",
+  organization = "ACM SIGGRAPH",
+  publisher =    "Addison Wesley",
+  month =        aug,
+  pages =        "57--64",
+  note =         "ISBN 0-89791-896-7",
+  keywords =     "global illumination, dynamic environments,
+                 hierarchical radiosity, form-factors, interactivity,
+                 frame rate control",
+  annote =       "Interactively manipulating the geometry of complex,
+                 globally illuminated scenes has to date proven an
+                 elusive goal. Previous attempts have failed to provide
+                 interactive updates of global illumination and have not
+                 been able to offer well-adapted algorithms controlling
+                 the frame rate. The need for such interactive updates
+                 of global illumination is becoming increasingly
+                 important as the field of application of radiosity
+                 algorithms widens. To address this need, we present a
+                 novel algorithm which provides interactive update rates
+                 of global illumination for complex scenes with moving
+                 objects. In the context of clustering for hierarchical
+                 radiosity, we introduce the idea of an implicit
+                 line-space hierarchy. This hierarchy is realized by
+                 augmenting the links between hierarchical elements
+                 (clusters or surfaces) with shafts, representing the
+                 set of lines passing through the two linked elements.
+                 We show how line-space traversal allows rapid
+                 identification of modified links, and simultaneous
+                 cleanup of subdivision no longer required after a
+                 geometry move. The traversal of line-space also limits
+                 the amount of work required to update and solve the new
+                 hierarchical system after a move, by identifying the
+                 modified paths in the scene hierarchy. The
+                 implementation of our new algorithm allows interactive
+                 updates of illumination after object motion for scenes
+                 containing several thousand polygons, including global
+                 illumination effects. Finally, the line-space hierarchy
+                 traversal provides a natural control mechanism allowing
+                 the regulation of the tradeoff between image quality
+                 and frame rate.",
+  who = "Havran Vlastimil: VIS-0025",
+}
+
+
+@TechReport{deBerg96traverse,
+  author =       "Mark de Berg and Marc van Kreveld and Rene van Oostrum and Mark Overmars",
+  title =        "Simple traversal of a subdivision without extra storage",
+  institution =  "CS Dept, Utrecht U.",
+  year =         "1996",
+  note =         "UU-CS-1996-17 URL: http:/www.cs.ruu.nl/docs/research/publication/TechList2.",
+  keywords =     "contour map, computational geometry, interval tree, cartography",
+  annote =       "traversing a planar subdivision without mark bits",
+  who = "Havran Vlastimil: VIS-0024",
+}
+
+
+@InProceedings{chrysanthou92a,
+   author =       "Y. Chrysanthou and M. Slater",
+   title =        "Computing dynamic changes to BSP trees",
+   pages =        "321--332",
+   booktitle =      "Computer Graphics Forum (EUROGRAPHICS '92 Proceedings)",
+   volume =       "11",
+   number =       "3",
+   year =         "1992",
+   month =        sep,
+   editor =       "A. Kilgour and L. Kjelldahl",
+   conference =   "held in Cambridge, UK; 7-11 September 1992",
+   keywords =     "binary space partition trees, svbsp, shadows",
+  who  = "Havran Vlastimil: VIS-0023",
+}
+
+@InProceedings{navazo87a, 
+        author =       "Isabel Navazo and Josep Fontdecaba and Pere Brunet",
+        title =        "Extended octtrees, between {CSG} trees and boundary
+                       representations",
+        pages =        "239--247",
+        booktitle =    "Eurographics '87",
+        year =         "1987",
+        month =        aug,
+        editor =       "G. Marechal",
+        publisher =    "North-Holland",
+        conference =   "European Computer Graphics Conference and Exhibition;
+                       held in Amsterdam, The Netherlands; 24 -- 28 August
+                       1987",
+        keywords =     "octree",
+  who  = "Havran Vlastimil: VIS-0022",
+}
+
+@InProceedings{Torres:1990:OBS,
+  author =       "Enric Torres",
+  title =        "Optimization of the Binary Space Partition Algorithm
+                 ({BSP}) for the Visualization of Dynamic Scenes",
+  pages =        "507--518",
+  booktitle =    "Eurographics '90",
+  year =         "1990",
+  month =        sep,   
+  editor =       "C. E. Vandoni and D. A. Duce",
+  publisher =    "North-Holland",
+  conference =   "European Computer Graphics Conference and Exhibition;
+                 held in Montreux, Switzerland; 3 -- 7 September 1990",
+  keywords =     "",
+  annote =       "",
+  who  = "Havran Vlastimil: VIS-0021",
+}
+
+@InProceedings{Chin:1989:NRT,
+  author =       "Norman Chin and Steven Feiner",
+  title =        "Near Real-Time Shadow Generation Using {BSP} Trees",
+  pages =        "99--106",  
+  booktitle =    "Computer Graphics (Proceedings of SIGGRAPH '89)",
+  year =         "1989",  
+  conference =   "held in Boston, Massachusetts; 31 July -- 4 August
+                 1989",
+  keywords =     "shadows, shadow volumes, BSP, binary space
+                 partitioning", 
+  annote =       "",
+  who  = "Havran Vlastimil: VIS-0020",
+}
+
+@Article{Morer:1995:OPL,
+  author =       "P. Morer and A. M. Garcia-Alonso and J. Flaquer",
+  title =        "Optimization of a Priority List Algorithm for {3-D}
+                 Rendering of Buildings",
+  journal =      "Com{\-}pu{\-}ter Graphics Forum",
+  volume =       "14",
+  number =       "4",
+  pages =        "217--227",
+  month =        oct,
+  year =         "1995",
+  coden =        "CGFODY",
+  ISSN =         "0167-7055",
+  bibdate =      "Fri Sep 13 06:22:32 MDT 1996",
+  acknowledgement = ack-nhfb,
+  classification = "C7440 (Civil and mechanical engineering computing);
+                 C6130B (Graphics techniques); C1180 (Optimisation
+                 techniques)",
+  keywords =     "Priority list algorithm; 3D rendering; 3-D rendering;
+                 Buildings; Architectural scenes; Parallel surfaces;
+                 Instantiation; Visualization algorithms; Hidden surface
+                 removal problem; Implementation policies; Binary space
+                 partition algorithm; Memory space; Optimization
+                 TECHNIQUES",
+  pubcountry =   "UK",
+  thesaurus =    "Architectural CAD; Data visualisation; Engineering
+                 graphics; Hidden feature removal; Optimisation;
+                 Rendering [computer graphics]",
+ who  = "Havran Vlastimil: VIS-0019",
+}
+
+@Article{Gordon:1991:FDB,
+  author =       "Dan Gordon and Shuhong Chen",
+  title =        "Front-to-back display of {BSP} trees",
+  journal =      "IEEE Computer Graphics and Applications",
+  volume =       "11",
+  number =       "5",
+  pages =        "79--85",
+  month =        sep,
+  year =         "1991",
+  coden =        "ICGADZ",
+  ISSN =         "0272-1716",
+  bibdate =      "Sat Jan 25 06:42:48 MST 1997",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Texas A\&M Univ, USA",
+  annote =       "For each scanline, keeps a list of unlit segments. By
+                 displaying front-to-back instead of the traditional
+                 back-to-front, save on the unnecessary display/shading
+                 of hidden polygons. The savings are negligible for
+                 small polygons but increase with the size of the
+                 polygons. Using hardware polygon rendering (instead of
+                 the scanline algorithm) would not make this technique
+                 as interesting.",
+  classification = "723; 921",
+  journalabr =   "IEEE Comput Graphics Appl",
+  keywords =     "Back-to-Front Display; Binary Space Partitioning
+                 Trees; bsp, dynamic screen data structure; Computer
+                 Graphics; Data Structures; Front-to-Back Display; Image
+                 Processing; Interpolation Shading",
+  who = "Havran Vlastimil: VIS-0018",
+}
+
+@InProceedings{Chen:1996:FPA,
+  author =       "{Han-Ming} Chen and {Wen-Teng} Wang",
+  title =        "The Feudal Priority Algorithm on Hidden-Surface
+                 Removal",
+  editor =       "Holly Rushmeier",
+  series =       "Annual Conference Series",
+  pages =        "55--64",
+  booktitle =    "SIGGRAPH 96 Conference Proceedings",
+  year =         "1996",
+  organization = "ACM SIGGRAPH",
+  publisher =    "Addison Wesley",
+  month =        aug,
+  note =         "held in New Orleans, Louisiana, 04-09 August 1996",
+  annote =       "Development of a real-time shaded rendering approach
+                 for a frequently changing viewpoint or view vector is
+                 very important in the simulation of 3-D objects in
+                 Computer-Aided Design. A new approach is proposed in
+                 this paper to meet this demand in a very efficient
+                 manner. A pre-processing phase, in which a feudal
+                 priority tree is established for all polygons of an
+                 object, and a post-processing phase, in which a
+                 rendering priority list is searched for from the feudal
+                 priority tree for a new viewpoint or view vector, are
+                 included in our approach. The most time-consuming work
+                 is finished in the pre-processing phase which only has
+                 to be executed once for an object, and the relatively
+                 simple task is left to the post-processing phase, which
+                 is repeated when the viewpoint or view vector is
+                 changed. For the pre-processing phase, a static version
+                 and a dynamic version are proposed in this paper. The
+                 one-way priority relations of all polygons are computed
+                 in the former part of the dynamic pre-processing in a
+                 more efficient way than that in the static
+                 pre-processing, but the latter part of the dynamic
+                 pre-processing is still based on the static
+                 pre-processing. A new concept of ``absolute priority''
+                 is introduced to systematically reduce the polygons in
+                 which a separating plane is to be searched for so the
+                 probability of finding the separating plane is much
+                 increased. This is the basis to implement another
+                 important concept of ``separating before splitting'' by
+                 which the polygon splittings are much reduced. Hence
+                 the efficiency in the pre-processing and the
+                 post-processing phases is highly increased.",
+  who = "Havran Vlastimil: VIS-0017",
+}
+
+@Article{Loscos:1997:IHS,
+  author =       "Celine Loscos and George Drettakis",
+  title =        "Interactive High-Quality Soft Shadows in Scenes with
+                 Moving Objects",
+  journal =      "Com{\-}pu{\-}ter Graphics Forum",
+  volume =       "16",
+  number =       "3",
+  pages =        "C219--C230",
+  month =        sep # " 4--8",
+  year =         "1997",
+  coden =        "CGFODY",
+  ISSN =         "0167-7055",
+  bibdate =      "Tue Mar 17 15:44:38 MST 1998",
+  acknowledgement = ack-nhfb,
+  affiliation =  "INRIA",
+  affiliationaddress = "Grenoble, Fr",
+  classification = "723.2; 723.5; 741.2",
+  journalabr =   "Comput Graphics Forum",
+  keywords =     "Algorithms; Backprojection structures; Computational
+                 geometry; Discontinuity mesh; Dynamic scenes; Image
+                 quality; Interactive computer graphics; Lighting; Soft
+                 shadows; Three dimensional computer graphics;
+                 Visibility",
+  who = "Havran Vlastimil: VIS-0016",
+}
+
+@InProceedings{Teller:1992:CAA,
+  author =       "Seth J. Teller",
+  title =        "Computing the antipenumbra of an area light source",
+  booktitle =      "Computer Graphics (Proceedings of SIGGRAPH '92)",
+  pages =        "139--148",
+  month =        jul,
+  year =         "1992",
+  conference =   "held in Chicago, Illinois; 26--31 July 1992",
+  keywords =     "radiosity, aspect graph, discontinuity meshing,
+                 stabbing lines, plucker coordinates",
+  who = "Havran Vlastimil: VIS-0015",
+}
+
+@Article{Naylor:1990:MBT,
+  author =       "Bruce Naylor and John Amanatides and William
+                 Thibault",
+  editor =       "Forest Baskett",
+  title =        "Merging {BSP} Trees Yields Polyhedral Set Operations",
+  journal =      "Computer Graphics",
+  volume =       "24",
+  number =       "4",
+  pages =        "115--124",
+  month =        aug,
+  year =         "1990",
+  coden =        "CGRADI, CPGPBZ",
+  ISSN =         "0097-8930",
+  conference =   "held in Dallas, Texas; 6--10 August 1990",
+  who = "Havran Vlastimil: VIS-0014",
+}
+
+@InProceedings{Chrysanthou:1997:IUS,
+  author =       "Yiorgos Chrysanthou and Mel Slater",
+  title =        "Incremental Updates to Scenes Illuminated by Area
+                 Light Sources",
+  booktitle =    "Proceedings of Eurographics Workshop on Rendering",
+  year =         "1997",
+  publisher =    "Springer Verlag",
+  month =        jun,
+  pages =        "103--114",
+  annote =       "An object space algorithm for computing shadows in
+                 dynamic scenes illuminated by area light sources is
+                 presented. A mesh with the shadow boundaries as well as
+                 other discontinuities in the illumination function, is
+                 built in a pre-processing stage and updated on-line
+                 after any interaction resulting in a change in the
+                 scene geometry. The mesh on each polygon is a 2D BSP
+                 tree stored in a winged edge data structure. To
+                 accelerate the mesh construction a number of new ideas
+                 are employed: sorting of the polygons in respect to the
+                 area source, the shadow overlap cube, BSP tree merging
+                 of the shadows. In addition a method for dynamically
+                 changing the BSP representation of the mesh and quickly
+                 identifying the vertices requiring intensity
+                 computations was developed. Preliminary experimental
+                 results indicate the strength and the potential of this
+                 method.",
+  who = "Havran Vlastimil: VIS-0013",
+}
+
+@InProceedings{Daubert:1997:HLS,
+  author =       "Katja Daubert and Hartmut Schirmacher and
+                 Fran{\c{c}}ois X. Sillion and George Drettakis",
+  title =        "Hierarchical Lighting Simulation for Outdoor Scenes",
+  booktitle =    "Eurographics Rendering Workshop 1997",
+  editor =       "Julie Dorsey and Philipp Slusallek",
+  year =         "1997",
+  organization = "Eurographics",
+  publisher =    "Springer Wein",
+  address =      "New York City, NY",
+  month =        jun,
+  pages =        "229--238",
+  note =         "ISBN 3-211-83001-4",
+  annote =       "Lighting algorithms for outdoor scenes suffer from the
+                 sheer geometric and lighting complexity of such
+                 environments. In this paper we introduce an efficient,
+                 hierarchical solution to the problem of outdoor
+                 illumination. Data structures and sampling algorithms
+                 are presented, permitting the integration of complex
+                 and natural objects in a hierarchical radiosity
+                 simulation system. This new approach allows the
+                 hierarchical simulation of radiant energy exchanges in
+                 outdoor scenes for the first time, including terrain
+                 and botanical models as well as sunlight and skylight.
+                 This is accomplished by providing the necessary tools
+                 to treat terrain meshes as a hierarchy of
+                 light-exchanging objects, as well as an efficient
+                 hierarchical representation for the sky dome. In
+                 addition, refinement criteria are adapted to the
+                 particular characteristics of natural lighting. Results
+                 of our implementation are presented including
+                 naturally-lit images of terrain-maps, trees and
+                 buildings.",
+  who = "Havran Vlastimil: VIS-0012",
+}
+
+@InProceedings{Drettakis:1996:AVM,
+  author =       "George Drettakis and Fran{\c{c}}ois Sillion",
+  title =        "Accurate Visibility and Meshing Calculations for
+                 Hierarchical Radiosity",
+  booktitle =    "Eurographics Rendering Workshop 1996",
+  editor =       "Xavier Pueyo and Peter Schr{\"{o}}der",
+  year =         "1996",
+  organization = "Eurographics",
+  publisher =    "Springer Wein",
+  address =      "New York City, NY",
+  month =        jun,
+  pages =        "269--278",
+  note =         "ISBN 3-211-82883-4",
+  annote =       "Precise quality control for hierarchical lighting
+                 simulations is still a hard problem, due in part to the
+                 difficulty of analysing the source of error and to the
+                 close interactions between different components of the
+                 algorithm. In this paper we attempt to address this
+                 issue by examining two of the most central components
+                 of these algorithms: visibility computation and the
+                 mesh. We first present an investigation tool in the
+                 form of a new hierarchical algorithm: this algorithmic
+                 extension encapsulates exact visibility information
+                 with respect to the light source in the form of the
+                 backprojection data structure, and allows the use of
+                 discontinuity meshes in the solution hierarchy. This
+                 tool permits us to study separately the effects of
+                 visibility and meshing error on image quality,
+                 computational expense as well as solution convergence.
+                 Initial experimental results are presented by comparing
+                 standard quadtree-based hierarchical radiosity with
+                 point-sampling visibility to the approaches
+                 incorporating backprojections, discontinuity meshes or
+                 both.",
+  who = "Havran Vlastimil: VIS-0011",
+}
+
+@Article{bib:naylor90,
+  author =       "B. Naylor", 
+  title =        "Binary Space Partitioning Trees as an Alternative
+                 Representation of Polytopes",
+  journal =      "Computer--Aided Design",
+  year =         "1990",
+  pages =        "250--252",
+  who  = "Havran Vlastimil: VIS-0010",
+}
+
+@InProceedings{Naylor:1992:PTI,
+  author =       "Bruce F. Naylor",
+  title =        "Partitioning tree image representation and generation
+                 from 3{D} geometric models",
+  pages =        "201--212",
+  booktitle =    "Proceedings of Graphics Interface '92",
+  year =         "1992",
+  month =        may,
+  conference =   "held in Vancouver, B.C.; 11-15 May 1992",
+  keywords =     "bsp trees",
+  who = "Havran Vlastimil: VIS-0009",
+}
+
+@InProceedings{Naylor:1993:CGP,
+        author =       "Bruce Naylor",
+        title =        "Constructing good partition trees",
+        booktitle =    "Proceedings of Graphics Interface '93",
+        year =         "1993",
+        pages =        "181--191",
+        organization = "Canadian Information Processing Society",
+        address =      "Toronto, Ontario, Canada",
+        month =        may,
+        who  = "Havran Vlastimil: VIS-0008",
+}
+
+@InProceedings{Naylor:1992:ISG,
+  author =       "Bruce F. Naylor",
+  title =        "Interactive solid geometry via partitioning trees",
+  pages =        "11--18",
+  booktitle =    "Proceedings of Graphics Interface '92",
+  year =         "1992",
+  month =        may,
+  conference =   "held in Vancouver, B.C.; 11-15 May 1992",
+  keywords =     "bsp trees",
+  who = "Havran Vlastimil: VIS-0007",
+}
+
+@InProceedings{Durand:1997:VSP,
+  author =       "Fr{\'{e}}do Durand and George Drettakis and Claude
+                 Puech",
+  title =        "The Visibility Skeleton: {A} Powerful and Efficient
+                 Multi-Purpose Global Visibility Tool",
+  booktitle =    "Computer Graphics (Proceedings of SIGGRAPH '97)",
+  year =         "1997",
+  pages =        "89--100",
+  keywords =     "Visibility, Global Visibility, Extremal Stabbing
+                 Lines, Aspect Graph, Global Illumination, Form Factor
+                 Calculation, Discontinuity Meshing, View Calculation",
+  annote =       "Many problems in computer graphics and computer vision
+                 require accurate global visibility information.
+                 Previous approaches have typically been complicated to
+                 implement and numerically unstable, and often too
+                 expensive in storage or computation. The Visibility
+                 Skeleton is a new powerful utility which can
+                 efficiently and accurately answer visibility queries
+                 for the entire scene. The Visibility Skeleton is a
+                 multi-purpose tool, which can solve numerous different
+                 problems. A simple construction algorithm is presented
+                 which only requires the use of well known computer
+                 graphics algorithmic components such as ray-casting and
+                 line/plane intersections. We provide an exhaustive
+                 catalogue of visual events which completely encode all
+                 possible visibility changes of a polygonal scene into a
+                 graph structure. The nodes of the graph are extremal
+                 stabbing lines, and the arcs are critical line swaths.
+                 Our implementation demonstrates the construction of the
+                 Visibility Skeleton for scenes of over a thousand
+                 polygons. We also show its use to compute exact visible
+                 boundaries of a vertex with respect to any polygon in
+                 the scene, the computation of global or on-the-fly
+                 discontinuity meshes by considering any scene polygon
+                 as a source, as well as the extraction of the exact
+                 blocker list between any polygon pair. The algorithm is
+                 shown to be manageable for the scenes tested, both in
+                 storage and in computation time. To address the
+                 potential complexity problems for large scenes,
+                 on-demand or lazy contruction is presented, its
+                 implementation showing encouraging first results.",
+    who = "Havran Vlastimil: VIS-0006",
+}
+
+@InProceedings{Drettakis94-FSAAL,
+  author =       "George Drettakis and Eugene Fiume",
+  year =         "1994",
+  title =        "A {Fast} {Shadow} {Algorithm} for {Area} {Light}
+                 {Sources} {Using} {Backprojection}",
+  booktitle =    "Computer Graphics (Proceedings of SIGGRAPH '94)",
+  pages =        "223--230",
+  keywords =     "shadows, umbra, penumbra, discontinuity meshing,
+                 global illumination, backprojection",
+  comments =     "available via the World Wide Web at:
+                 http://safran.imag.fr/Membres/George.Drettakis/pub.html",
+  who = "Havran Vlastimil: VIS-0005",
+}
+
+
+@InProceedings{Plantinga:1993:CVP,
+  author =       "Harry Plantinga",
+  title =        "Conservative visibility preprocessing for efficient
+                 walkthroughs of 3{D} scenes",
+  booktitle =    "Proceedings of Graphics Interface '93",
+  year =         "1993",
+  pages =        "166--173",
+  organization = "Canadian Information Processing Society",
+  address =      "Toronto, Ontario, Canada",
+  month =        may,
+  who = "Havran Vlastimil: VIS-0003",  
+}
+
+@InProceedings{Teller:1993:GVA,
+  author =       "Seth Teller and Pat Hanrahan",
+  booktitle =    "Computer Graphics Proceedings, Annual Conference
+                 Series, 1993",
+  title =        "Global Visibility Algorithms for Illumination
+                 Computations",
+  pages =        "239--246",
+  year =         "1993",
+  keywords =     "hidden surface removal, visibility space, radiosity,
+                 global illumination, algorithmic triage",
+  annote =       "The most expensive geometric operation in image
+                 synthesis is visibility determination. Classically this
+                 is solved with hidden surface removal algorithms that
+                 render only the parts of the scene visible from a
+                 point. Global illumination calculations, however, may
+                 require information between any two points in the
+                 scene. This paper describes global visibility
+                 algorithms that preprocess polygon databases in order
+                 to accelerate visibility determination during
+                 illumination calculations. These algorithms are
+                 sensitive to the output complexity in visibility space;
+                 that is, how many pairs of objects are mutually
+                 visible. Furthermore, the algorithms are incremental so
+                 that they work well with progressive refinement and
+                 hierarchical methods of image synthesis. The algorithms
+                 are conservative, but exact; that is, when they return
+                 visibility predicates they can be proved true. However
+                 sometimes they do not return either totally visible or
+                 totally invisible, but partially visible, even though
+                 in the same situation a better algorithm might return
+                 the exact answer. In this paper we describe the
+                 algorithms and their implementation, and show that, in
+                 a scene with low average visual complexity, they can
+                 dramatically accelerate conventional radiosity
+                 programs.",
+   who = "Havran Vlastimil: VIS-0002",
+}
+
+@InProceedings{Stewart:1994:FCSb,
+  author =       "A. James Stewart and Sherif Ghali",
+  booktitle =    "Computer Graphics (Proceedings of SIGGRAPH '94)",
+  title =        "Fast Computation of Shadow Boundaries Using Spatial
+                 Coherence and Backprojections",
+  pages =        "231--238",
+  year =         "1994",
+  who = "Havran Vlastimil: VIS-0001",
+}
+
+@Article{Cohen-Or:1995:VDZ,
+  author =       "D. Cohen-Or and A. Shaked",
+  title =        "Visibility and Dead-Zones in Digital Terrain Maps",
+  journal =      "Com{\-}pu{\-}ter Graphics Forum",
+  volume =       "14",
+  number =       "3",
+  pages =        "C/171--C/180",
+  month =        sep,
+  year =         "1995",
+  coden =        "CGFODY",
+  ISSN =         "0167-7055",
+  bibdate =      "Fri Jul 18 14:10:02 1997",
+  acknowledgement = ack-nhfb,
+  classification = "A9110D (Cartography); A9365 (Data and information;
+                 acquisition, processing, storage and dissemination in
+                 geophysics); C4240C (Computational complexity); C4260
+                 (Computational geometry); C6130B (Graphics techniques);
+                 C7340 (Geophysics computing); C7840 (Geography and
+                 cartography computing)",
+  conflocation = "Maastricht, Netherlands; 18 Aug.-1 Sept. 1995",
+  conftitle =    "EUROGRAPHICS '95",
+  corpsource =   "Sch. of Math. Sci., Tel Aviv Univ., Israel",
+  keywords =     "cartography; computational; computational complexity;
+                 Computational geometry; Dead-zones; dead-zones;
+                 detection; digital; Digital elevation map; digital
+                 terrain maps; Digital terrain maps; digital terrain
+                 maps; Discrete cross-sections; discrete cross-sections;
+                 discrete lines of sight; Discrete lines of sight;
+                 discrete lines of sight; elevation map; geographic
+                 information systems; Geographic information systems;
+                 geographic information systems; geometry; hidden area
+                 detection; Hidden area detection; hidden area
+                 detection; hidden feature; multiplication;
+                 Multiplication; multiplication; Polygonal surface
+                 representation; polygonal surface representation;
+                 removal; Surface perimeter; surface perimeter; terrain
+                 modelling; Terrain modelling; terrain modelling;
+                 Testing operations; testing operations; topographic
+                 surface; Topographic surface; topographic surface;
+                 Unit-sized terrain elements; unit-sized terrain
+                 elements; viewpoint; Viewpoint; viewpoint; Visibility;
+                 visibility; visible area; Visible area detection",
+  thesaurus =    "Cartography; Computational complexity; Computational
+                 geometry; Geographic information systems; Hidden
+                 feature removal; Visibility",
+  treatment =    "P Practical",
+  who  = "Havran Vlastimil: VIS-0091",
+}
Index: trunk/VUT/doc/SciReport/Bib/vlastaha.bib
===================================================================
--- trunk/VUT/doc/SciReport/Bib/vlastaha.bib	(revision 243)
+++ trunk/VUT/doc/SciReport/Bib/vlastaha.bib	(revision 243)
@@ -0,0 +1,218 @@
+
+# #######################
+#  Publications in 1998 #
+#    6 pieces		#
+#########################
+
+@misc{Havran98:d,
+   author = {Havran, V. and Kopal, T. and Bittner, J. and \v{Z}\'{a}ra, J.},
+   title = {FAST ROBUST BSP TREE TRAVERSAL ALGORITHM FOR RAY TRACING},
+   note = { 8 pages, Submitted to Journal of Graphics Tools},
+   year = { 1998 },
+   month = jul,
+}
+
+@inproceedings{bittner98b,
+  author = "Bittner, J. and Havran, V. and Slavik, P.",
+  title = "Hierarchical Visibility Culling with Occlusion Trees",
+  booktitle = "Proceedings of Computer Graphics International '98 (CGI'98)",
+  year = "1998",
+  month = jun,
+  pages = "207--219",
+  address = "Hannover, Germany",
+  publisher = "IEEE, New York",
+}
+
+@InProceedings{Kopal98:b,
+  author = {Kopal, T. and Havran, V. and Bittner, J. and \v{Z}\'{a}ra, J.},
+  title  = {Directionality in Ray Tracing},
+  booktitle = {Proceedings of Poster'98},
+  note = {2nd International Student Conference on Electrical Engineering},
+ organization = { CTU--FEE },
+  address = {Prague, Czech Republic},
+  pages = {2 pages, IC 24},
+  month = {May},
+  year  = {1998},
+}
+
+@InProceedings{Havran98:c,
+  author = {Havran, V.},
+  title  = {Constructing Surface Area Binary Space Partitioning with Rope
+            Trees for Ray Tracing},
+  booktitle = {Proceedings of Poster'98},
+  note = {2nd International Student Conference on Electrical Engineering},
+  organization = { CTU--FEE },
+  address = {Prague, Czech Republic},
+  pages = {2 pages, IC 15},
+  month = {May},
+  year  = {1998},
+}
+
+@InProceedings{Havran98:b,
+  author = { Havran, V. and Bittner, J. and \v{Z}\'{a}ra, J.},
+  title  = { Ray Tracing with Rope Trees},
+  booktitle = { Proceedings of 13th Spring Conference on Computer Graphics}, 
+  address = { Budme\v{r}ice},
+  month  = apr,
+  year  = {1998},
+  pages = "130--139",
+}
+
+@InProceedings{Havran98:a,
+   author = {Havran, V.},
+   title = {Statistically Optimized Traversal Algorithm for BSP trees},
+   booktitle = {Proceedings of Workshop'98},
+   organization = { CTU--FEE },
+   address = { Prague, Czech Republic },
+   editor= { A. Strejc },
+   month = { February},
+   pages = { 365--366},
+   year  = { 1998 },
+}
+
+# #######################
+#  Publications in 1997 #
+#    6 pieces		#
+#########################
+
+
+@InProceedings{Havran97:f,
+  author = {Havran, V.},
+  title = {Cache Sensitive Representation for the BSP Tree},
+  booktitle = {Proceedings of Compugraphics'97},
+  note  = {International Conference on Computer Graphics},
+  year  = {1997},
+  month  = dec,
+  pages = { 369--376 },
+  place = {Vilamoura, Algarve, Portugal},
+  anote = {Sixth International Conference on Computational Graphics
+           and Visualization Techniques},
+}
+
+@TechRep{Havran97:rep,
+  author = {Havran, V.},
+  title = {Spatial Data Structures for Visibility Computation},
+  institution = {CTU--FEE Prague},
+  number = {DC-PSR-97-05},
+  month = {May},
+  year = {1997},
+  note = {Postgraduate Study Report, 34 pages, available at 
+          ftp://www.cgg.cvut.cz/outgoing/havran/minimum/dc-psr-97-04.ps.gz},
+}
+
+@InProceedings{Havran97:d,
+  author = {Havran, V.},
+  title  = {Evaluation of BSP trees for ray--tracing},
+  booktitle = {Proceedings of Poster'97}, 
+  note = {1st International Student Conference on Electrical Engineering},
+  address = {Prague, Czech Republic},
+  pages = {2 pages, IC 12},
+  month = {May},
+  year  = {1997},
+}
+
+@InProceedings{Havran97:c,
+  author = "Havran, V. and \v{Z}\'{a}ra, J.",
+  title  = "Evaluation of BSP properties for ray--tracing",
+  booktitle = { Proceedings of 12th Spring Conference on Computer Graphics}, 
+  pages = { 155--162 },
+  address = { Budme\v{r}ice},
+  month  = jun,
+  year  = {1997},
+}
+
+@InProceedings{Havran97:b,
+  author = { Havran, V.},
+  title  = { Parallel Ray-tracer on Shared Memory Multiprocessor
+             Machines Connected via Internet},
+  booktitle = {Proceedings of Workshop'97},
+  organization = { CTU--FEE },
+  address = { Prague, Czech Republic },
+  editor= { A. Strejc },
+  month =  jan,
+  pages = { 321--322 },
+  year  = { 1997 },
+}
+
+@InProceedings{Havran97:a,
+  author = {Havran, V. and \v{S}och, M. and \v{S}imek, P. and Tvrd\'{\i}k, P.},
+  title  = {Parallel Merge Sort on Shared Memory Multicomputer.},
+  booktitle = {Proceedings of Workshop'97}, 
+  pages = {287--288},
+  editor= { A. Strejc},
+  address = {Prague, Czech Republic},
+  organization = { CTU--FEE },
+  month = jan,
+  year = {1997}, 
+}
+
+# #######################
+#  Publications in 1996 #
+#    4 pieces		#
+#########################
+
+
+@InProceedings{Havran96:d,
+  author = {Havran, V.},
+  title = {Parallel Implementation of Ray Tracing on Shared Memory
+           Architecture},
+  booktitle = {Poster Section at SOFSEM'96},
+  month = nov,
+  year = {1996},
+  address = {Milovy, Czech Republic},
+}
+
+@InProceedings{Havran96:c,
+  author = {Havran, V. and \v{Z}\'{a}ra, J.},
+  title = {Some Practical Aspects of Ray Tracing on Shared Memory Machine},
+  booktitle = {Poster Section at Eurographics Workshop on Parallel Rendering},
+  month = aug,
+  year = {1996},
+  address = {Bristol, UK},
+}
+
+@InProceedings{Havran96:b,
+  author = {Havran, V.},
+  title = {Load Balancing Techniques for Ray-tracer on Shared Memory
+           Machine},
+  booktitle = {Proceedings of Poster'96},
+  organization = { CTU--FEE },
+  address = {Prague, Czech Republic},
+  pages = {74--74}, 
+  month = {May},
+  year = {1996},
+}
+
+@MastersThesis{Havran96:a,
+  author = {Havran, V.},
+  title = {The simulation of Optical Effects},
+  month = feb,
+  school = {CTU--FEE, Department of Computer Science and Engineering,
+                 Prague, Czech Republic},
+  year = 1996,
+}
+
+# #######################
+#  Publications in 1995 #
+#    2 pieces		#
+#########################
+
+@InProceedings{Havran95:b,
+  author = {Havran, V. and \v{Z}\'{a}ra, J.},
+  title = {Effective Homogenous Transformation of Large Raster Images},
+  booktitle = {Poster Section at SOFSEM'95},
+  month =  nov,
+  address = {Milovy, Czech Republic},
+  year = 1995,
+}
+
+@InProceedings{Havran95:a,
+  author = {Havran, V. and \v{Z}\'{a}ra, J.},
+  title =  {The simulation of the Real Camera for Rendering},
+  booktitle = { Proceedings of  Workshop'95},
+  organization = {CTU--FEE},
+  address = {Prague, Czech Republic},
+  month = jan,
+  year = {1995}, 
+  pages = {183--184}, 
+}
Index: trunk/VUT/doc/SciReport/makefile
===================================================================
--- trunk/VUT/doc/SciReport/makefile	(revision 243)
+++ trunk/VUT/doc/SciReport/makefile	(revision 243)
@@ -0,0 +1,222 @@
+# ================================================================
+# $Id: makefile,v 1.8 2004/05/07 00:55:51 bittner Exp $
+# ================================================================
+#/** @author Jiri Bittner */
+
+### For Tex Files #####
+####################
+PROJECT   = report
+#####################
+
+BACKUPPATH = ./backup
+SHELL=/bin/sh
+
+##########################################
+
+
+
+#########################################
+PRINT      = lpr -Pduplex
+
+MAKE      = make
+TAR       = tar
+
+DVI       =$(PROJECT).dvi
+PS        =$(PROJECT).ps
+PDF       =$(PROJECT).pdf
+HP        =$(PROJECT).hp
+BIB       =$(PROJECT).bbl
+DEPEND    =  *.tex
+DEPALL    = $(DEPEND) *.ps
+ZIP = zip
+MAKE_GLOSSARY=./makeglossary
+
+
+$(DVI):	$(DEPEND) 
+	@make code
+	@make epsimages
+	-latex $(PROJECT)
+
+noimages:
+	-latex $(PROJECT)
+
+$(PS):	$(DVI)
+	@dvips -t a4 -o$(PS) $(DVI)
+
+$(MAKE_GLOSSARY):
+	gcc -o $(MAKE_GLOSSARY) $(MAKE_GLOSSARY).c
+
+
+gloss:	$(MAKE_GLOSSARY)
+	$(MAKE_GLOSSARY) $(PROJECT)
+
+$(PROJECT).gls: $(PROJECT).tex
+	make gloss
+
+$(BIB):	$(DVI)
+	bibtex $(PROJECT)
+
+bibl:	
+	make $(BIB)
+
+reb:	$(DEPEND) # $(PROJECT).gls
+	-latex $(PROJECT)
+	make bibl
+	-latex $(PROJECT)
+
+
+f:	$(DEPEND)
+	@rm $(DVI)
+	make $(DVI)
+
+show:   
+	$(MAKE) $(DVI)
+	@xdvi -shrinkbutton3 6 -shrinkbutton4 9 -s 9   $(DVI) &
+
+sshow:   
+	$(MAKE) $(DVI)
+	@xdvi -s 7   $(DVI) &
+
+#-mgs3 1100x600
+
+pshow:   
+	$(MAKE) $(PDF)
+	@acroread $(PDF) &
+
+kshow:   
+	$(MAKE) $(DVI)
+	@kdvi $(DVI) &
+
+tar: 
+	@if(test -e core) then rm core; fi
+	@$(TAR) Zcvf  "$(BACKUPPATH)/$(PROJECT)`date +%d.%b-%H.%M`.tar.Z" *
+
+zip:
+	@if(test -e core) then rm core; fi
+	@$(ZIP) -r "$(BACKUPPATH)/$(PROJECT)`date +%d.%b-%H.%M`.zip" *  -x backup/*
+
+ziptex:
+	@if(test -e core) then rm core; fi
+	@$(ZIP) "$(BACKUPPATH)/$(PROJECT)-tex`date +%d.%b-%H.%M`.zip" makefile *.tex *.bib *.mac *.sty *.cls *.bst Bib/*.bib code/* figs/* images/* plots/* -x backup/*
+
+
+clean: 	
+	-@rm -f *~ *.log *.dvi *.aux *.toc \
+	$(PROJECT).blg $(PROJECT).bbl $(PROJECT).out $(PROJECT).tpt \
+	$(PROJECT).brf
+	@if(test -e core) then rm core; fi 
+	@if(test -e $(MAKE_GLOSSARY)) then rm $(MAKE_GLOSSARY); fi 
+	@make -C images clean
+	@make -C figs clean
+	@make -C plots clean
+
+cleanall: 	
+	@make clean
+	@if(test -e $(PS)) then rm $(PS); fi  		
+	@if(test -e $(PDF)) then rm $(PDF); fi
+
+ps:     
+	make $(PS)
+
+pspdf: $(DVI)
+	dvips -Ppdf -G0 -t A4 -o$(PS) $(DVI)
+	ps2pdf -dMaxSubsetPct=100 -dCompatibilityLevel=1.3 \
+          -dSubsetFonts=true -dEmbedAllFonts=true \
+          -dAutoFilterColorImages=false \
+          -dAutoFilterGrayImages=false \
+          -dColorImageFilter=/FlateEncode \
+          -dGrayImageFilter=/FlateEncode \
+          -dMonoImageFilter=/FlateEncode $(PS) $(PDF)
+
+pdf:	
+	make $(PDF)
+
+fpdf:	
+	@rm -f $(PDF)
+	@make $(PDF)
+
+.PHONY: pdfimages
+pdfimages:
+	@make -C figs pdf
+	@make -C plots pdf
+	@make -C images pdf
+
+.PHONY: epsimages
+epsimages:
+	@make -C figs eps
+	@make -C plots eps
+	@make -C images eps
+
+
+.PHONY: images
+images:
+	@make pdfimages
+	@make epsimages
+
+.PHONY: code
+code:
+	@make -C code
+
+
+$(PDF): $(DEPEND)
+	@make code
+	@make pdfimages
+	@pdflatex $(PROJECT)
+
+pdfthumb:
+	@make pdf
+	@thumbpdf $(PROJECT)
+	@make fpdf
+
+
+
+
+#dvipdf $(DVI)
+
+lps:
+	@make $(DVI)
+	@dvips -o$(PS) $(DVI)
+
+4ps:     $(DEPALL) ps
+	rm -f 4$(PS)
+	pstops  '4:0@.5(0,0.45h)+1@.5(0,0)+2@0.5(0.5w,0.45h)+3@0.5(0.5w,0)' \
+	< $(PS) > 4$(PS)
+
+hp:      $(PS)
+	gs -q -dNOPAUSE -sPAPERSIZE=a4 -sOutputFile=$(HP) -sDEVICE=ljet4 -r600 $(PS)
+
+rotate: $(PS)
+	  @pstops -w1h -h1w '0L(1h,0)' $(PS) rotated-$(PS)
+
+print:	
+	$(MAKE) $(DVI)
+	@dvips -o$(PS) $(DVI)
+	$(PRINT) $(PS)
+
+help:
+	@echo "------------------------------------------------------"
+	@echo "implicit - rebuids the dvi"
+	@echo "reb      - rebuilds it twice"
+	@echo "show     - rebulds and runs xdvi"
+	@echo "tar      - makes a backup"
+	@echo "clean    - delets *~ *.log *.dvi *.aux *.toc"
+	@echo "ps       - generates ps from dvi"
+	@echo "print    - generates ps and sends it to the printer"
+	@echo "------------------------------------------------------"
+
+
+login:
+	cvs -d :pserver:$(CVSNAME)@sgi.felk.cvut.cz:/usr.sgi/CVS_archive login
+
+update:
+	@echo "Updating in . ..."
+	@export CVS_RSH=ssh ; cvs -z 8 update
+	@echo "done."
+	@echo
+
+commit:
+#	@echo "Type in the comment terminated by ENTER, Ctrl-Z, ENTER."
+	@echo "Commiting ...."
+	@export CVS_RSH=ssh ; cvs -z 8 commit -m ""
+	@echo "done."
+	@echo
