%% START

\chapter{Results}

Some sample results of the discussed algorithms from the various routines 
implemented in {\em ANSI C} are shown here. 

In all the BSP tree construction calculations,
MAX\_CANDIDATES = $10$. Also, $N_i$ denotes the number of polygons in the 
input and $N_o$ denotes the number of polygons in the output.
On a {\em 486 DX2-66} with {\em 8 MB RAM} running {\em Linux v. 1.3.47}, the
time taken was 
\begin{itemize}
\item Mushroom ($N_i = 240$) $\rightarrow$ $2$ {\em sec.} 
	(Figure~\ref{fig:Mushroom input})
\item Goblet ($N_i = 470$) $\rightarrow$ $5$ {\em sec.}
	(Figure~\ref{fig:Goblet input})
\item Seashell ($N_i = 1680$) $\rightarrow$ $8$ {\em sec.}
	(Figure~\ref{fig:Seashell input})
\item Teapot ($N_i = 3751$) $\rightarrow$ $42$ {\em sec.}
	(Figure~\ref{fig:Teapot input})
\end{itemize}

The artificial intersections due to BSP Tree construction are clearly 
seen in the output of the first few examples (Figures
\ref{fig:Mushroom output}, 
\ref{fig:Goblet output}, 
\ref{fig:Seashell output} and 
\ref{fig:Teapot output}).

\begin {figure}
\centerline{\psfig {figure=mushroomw.ps,height=9cm,width=10cm}}
\caption{Input - Mushroom wire frame ($N_i = 240$)}
\label{fig:Mushroom input}
\end {figure}

\begin {figure}
\centerline{\psfig {figure=mushroomh.ps,height=9cm,width=10cm}}
\caption{Output - Mushroom rendered after BSP sorting ($N_o = 481$)}
\label{fig:Mushroom output}
\end {figure}

\begin {figure}
\centerline{\psfig {figure=gobletw.ps,height=9cm,width=8cm}}
\caption{Input - Goblet wire frame ($N_i = 470$)}
\label{fig:Goblet input}
\end {figure}

\begin {figure}
\centerline{\psfig {figure=gobleth.ps,height=9cm,width=8cm}}
\caption{Output - Goblet rendered after BSP sorting ($N_o = 1109$)}
\label{fig:Goblet output}
\end {figure}

\begin {figure}
\centerline{\psfig {figure=seashellw.ps,height=9cm,width=10cm}}
\caption{Input - Seashell wire frame ($N_i = 1680$)}
\label{fig:Seashell input}
\end {figure}

\begin {figure}
\centerline{\psfig {figure=seashellh.ps,height=9cm,width=10cm}}
\caption{Output - Seashell rendered after BSP sorting ($N_o = 3706$)}
\label{fig:Seashell output}
\end {figure}

\begin {figure}
\centerline{\psfig {figure=teapot_original_wireframe.ps,height=9cm,width=10cm}}
\caption{Input - Teapot wire frame ($N_i = 3751$)}
\label{fig:Teapot input}
\end {figure}

\begin {figure}
\centerline{\psfig {figure=teapot_bsp_hidden.ps,height=9cm,width=10cm}}
\caption{Output - Teapot rendered after BSP sorting ($N_o = 7743$)}
\label{fig:Teapot output}
\end {figure}

\begin {figure}
\centerline{\psfig {figure=1w.ps,height=8cm,width=12cm}}
\caption{Example - Input to BSP routine ($N_i = 12$)}
\end {figure}

\begin {figure}
\centerline{\psfig {figure=1h.ps,height=8cm,width=12cm}}
\caption{Example - Output after BSP sorting ($N_o = 12$)}
\end {figure}

\begin {figure}
\centerline{\psfig {figure=2w.ps,height=8cm,width=12cm}}
\caption{Example - Input to Hidden Line Removal routine ($N_i = 10$)}
\end {figure}

\begin {figure}
\centerline{\psfig {figure=2bh.ps,height=8cm,width=12cm}}
\caption{Example - Output from Hidden Line Removal routine ($N_o = 7$)}
\end {figure}

%% END
