Next: References Up: No Title Previous: Scope for Improvement

Results

Some sample results of the discussed algorithms from the various routines implemented in 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 486 DX2-66 with 8 MB RAM running Linux v. 1.3.47, the time taken was

Mushroom (N_i = 240) $\rightarrow$ 2 sec. (Figure )
Goblet (N_i = 470) $\rightarrow$ 5 sec. (Figure )
Seashell (N_i = 1680) $\rightarrow$ 8 sec. (Figure )
Teapot (N_i = 3751) $\rightarrow$ 42 sec. (Figure )

The artificial intersections due to BSP Tree construction are clearly seen in the output of the first few examples (Figures , , and ).

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

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

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

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

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

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

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

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

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

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

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

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

Next: References Up: No Title Previous: Scope for Improvement

Anirudh Modi
4/15/1998