Changeset 273 for trunk/VUT/doc/SciReport/mutual.tex

Timestamp:

09/15/05 18:31:13 (19 years ago)

Author:

bittner

Message:

sampling confict resolved

File:

• trunk/VUT/doc/SciReport/mutual.tex (modified) (9 diffs)

trunk/VUT/doc/SciReport/mutual.tex

@@ -40 +40 @@
 
 
-\section{Exact Mutual Visibility Test}
-
-The exact mutual visibility test computes exact visibility between two
-polyhedrons in the scene. This is computed by testing visibility
+\section{Exact Verifier}
+
+The exact mutual visibility verifier computes exact visibility between
+two polyhedrons in the scene. This is computed by testing visibility
 between all pairs of potentially visible polygons of these
 polyhedrons.  For each pair of tested polygons the computation is
@@ -49 +49 @@
 used to determine the set of relevant occluders~\cite{Haines94}.
 
-\section{Occlusion tree}
+\subsection{Occlusion tree}
 \label{sec:rot3d_ot}
 
@@ -89 +89 @@
 
 
-\section{Occlusion tree construction}
+\subsection{Occlusion tree construction}
 
 \label{sec:rot3d_construct}
@@ -109 +109 @@
 
 
-\subsection{Insertion with splitting}
+\subsubsection{Insertion with splitting}
 
 \label{sec:rot3_insertwithsplit}
@@ -136 +136 @@
 the new subtree.
 
-\subsection{Insertion without splitting}
+\subsubsection{Insertion without splitting}
 \label{sec:insertion_nosplit}
 
@@ -209 +209 @@
 and combining the resulting visibility states.
 
-\subsection{Exact visibility test}
-
- The exact visibility for a given polyhedral region proceeds as
+%\subsection{Exact visibility test}
+
+ The exact visibility test for a given polyhedral region proceeds as
 follows: for each face of the region facing the given source polygon
 we construct a blocker polyhedron. The blocker polyhedron is then
@@ -226 +226 @@
 
 
-\subsection{Conservative visibility test}
-
-\label{sec:rot3_conserva}
-
- The conservative visibility test provides a fast estimation of
-visibility of the given region since it does not require the 5D
-polyhedra enumeration. Visibility of the given face of the region is
-determined by a traversal of the occlusion tree and testing the
-position of the corresponding blocker polyhedron with respect to the
-encountered hyperplanes as described in
-Section~\ref{sec:insertion_nosplit}.  If the blocker polyhedron
-reaches only $in$-leaves and the face is behind the polygon(s)
-associated with the leaves, the face is classified invisible
-. Otherwise, it is conservatively classified as visible.  The
-visibility of the whole region is determined using a combination of
-visibility of its faces as mentioned in the previous section.
-
-\section{Optimizations}
+% \subsection{Conservative visibility test}
+
+% \label{sec:rot3_conserva}
+
+%  The conservative visibility test provides a fast estimation of
+% visibility of the given region since it does not require the 5D
+% polyhedra enumeration. Visibility of the given face of the region is
+% determined by a traversal of the occlusion tree and testing the
+% position of the corresponding blocker polyhedron with respect to the
+% encountered hyperplanes as described in
+% Section~\ref{sec:insertion_nosplit}.  If the blocker polyhedron
+% reaches only $in$-leaves and the face is behind the polygon(s)
+% associated with the leaves, the face is classified invisible
+% . Otherwise, it is conservatively classified as visible.  The
+% visibility of the whole region is determined using a combination of
+% visibility of its faces as mentioned in the previous section.
+
+\subsection{Optimizations}
 
 \label{sec:rot3d_optimizations}
@@ -278 +278 @@
 
 
-\subsection{Visibility estimation}
+\subsubsection{Visibility estimation}
 
  The visibility estimation aims to eliminate the polyhedron
@@ -312 +312 @@
 
 
-\subsection{Visibility merging}
+\subsubsection{Visibility merging}
 
  Visibility merging aims to propagate visibility classifications from