Project 3     CMSC 655        Nov. 6, 1996




      In this project you have three different choices of tasks. Two of
      the problems are to give you experience with interpolating functions,
      and the third is to give you experience with the spectral bisection
      method for partitioning graphs. All three tasks are worth 100 points.
      You may only do one.


      A) Corresponding to cubic splines work the case of quadratic splines.
         First do the analysis and then write code in a higher level
         language to generate them. Test your program out by interpolating
         the project 1 temperatures on the plate along the mesh points which
         are three rows up from the lower boundary. Produce a plot of your
         quadratic spline. You will be graded on your analysis, coding and
         presentation. 


      B) Using Matlab and two dimensional interpolating functions found in
         Matlab produce a  face in three dimensions. It will help to know some
         computer graphics for this task. You will be graded on how well a
         job you do with the face and the write-up of your methodology.

      C) In this task you need to implement the Recursive Spectral Bisection
         algorithm so that if input is any connected graph G with n nodes then
         G is partitioned into four subgraphs of approximately n/4 nodes
         each with the removal of a nearly minimal cutset. I will supply
         the adjacency matrix of G.


           All choices due on Nov. 18