In class we will discuss software design issues that come up in the 
CGAL arrangemets package. We will review <I> observers </I> and
<I> visitors </I> (see the book Design Patterns) and the generic
programming version of <I> adaptors </I> (see the book on Generic
Programming). A concrete adpator that will be discussed relates the
basic arrangement representation in CGAL with graphs from the BOOST
Graph Library.


<DL>

<DT>
<IMG SRC="http://www.math.tau.ac.il/icons/ball/red.gif" ALT=" ">
Erich Gamma, Richard Helm, Ralph Johnson, and John Vlissides,
<BR>
<I>Design Patterns</I>,
<BR>
Addison-Wesley, 1995.

<P>
<P>

<DT>
<IMG SRC="http://www.math.tau.ac.il/icons/ball/red.gif" ALT=" ">
Matthew H. Austern 
<BR>
<I> Generic Programming and the STL: Using and Extending the C++ Standard Template Library</I>,
<BR>
Addison-Wesley, 1999.

<P>

<DT>
<IMG SRC="http://www.math.tau.ac.il/icons/ball/red.gif" ALT=" ">
Jeremy G. Siek, Lie-Quan Lee, and Andrew Lumsdaine,
<BR>
<I>The Boost Graph Library User Guide and Reference Manual</I>,
<BR>
Addison-Wesley, 2002.

</DL>