updated bib + begin. of anisotropic

Packages/Tutorial/tutorial/Polyhedron/sgp2004/paper/paper.bib

@@ -119,6 +119,26 @@
 , year =        1999
 , pages =       "65--90"}
 
+@article{bbp-iayed-01
+, author =  "H. Br{\"o}nnimann and C. Burnikel and S. Pion"
+, title =   "Interval arithmetic yields efficient dynamic filters for computational geometry"
+, journal = "Discrete Applied Mathematics"
+, volume = 109
+, year = 2001
+, pages = "25--47"
+, succeeds = "bbp-iayed-98scg"
+}
+
+@inproceedings{p-iaeia-99
+, author =      "Sylvain Pion"
+, title =       "Interval Arithmetic: An efficient implementation and an application to computational geometry"
+, booktitle =   "Workshop on Applications of Interval Analysis to systems and Control"
+, year =        1999
+, pages =       "99--110"
+, url = "http://www-sop.inria.fr/prisme/biblio/search.html"
+, update =      "01.07 devillers, 00.03 devillers, 99.07 devillers"
+}
+
 %======================================================
 % == STL ==============================================
 %======================================================

Packages/Tutorial/tutorial/Polyhedron/sgp2004/paper/remeshing.tex

@@ -56,10 +56,10 @@ per halfedge in addition to the 3D coordinates per vertex.
 \item 
 After initial sampling the \emph{constrained Delaunay triangulation}
 has been used together with Lloyd's clustering algorithm to build a
-weighted centroidal Voronoi diagram over the newly sampled points in
+weighted centroidal Voronoi diagram over the new sample points in
 parameter space. The fast point location in a triangulation provided
-by CGAL has been used to determine the 3D coordinates of the sample
-points.
+by CGAL has been used to determine the final 3D coordinates of the
+sample points.
 
 \end{itemize}
 
@@ -68,13 +68,33 @@ as all algorithms involved in our remeshing technique
 (parameterization, error diffusion for sampling, Lloyd's clustering
 for sample placement and point location), which nicely unifies all
 components of the algorithm and provides us with genericity for all
-geometric entities and predications. Notice that the filtered kernel
-provided by CGAL (add ref) gives necessary robustness for complex
-models by mixing exact and floating point arithmetic in a transparent
-manner for the programmer.
+geometric entities and predications. An important feature provided by
+CGAL is the filtered kernel~\cite{bbp-iayed-01,p-iaeia-99}, which
+gives robustness required for complex models by mixing exact and
+floating point arithmetic in a transparent manner for the programmer.
 
 \subsection{Anisotropic Remeshing}
 
+% anisotropic remeshing, what is that ?
+
+Beside quality of the mesh elements, remeshing techniques are also
+concerned by approximation efficiency. When accurate representation is
+needed, a strategic sizing, alignement and aspect ratio of the mesh
+elements is crucial. This is a consequence of the natural anisotropic
+nature of generic surfaces.
+
+% main idea
+
+The main idea of the anisotropic remeshing technique described in
+\cite{acdld-apr-03} consists of tracing two orthogonal sets of streamlines
+in a conformal parameter space to align mesh edges along principal
+curvature lines and therefore respect the local symmetries. A careful
+control of the streamline density allows us to improve the mesh
+efficiency so as to match the optimality conditions for the $\Ltwo$
+metric in the limit. Such a strategy produces quad-dominant meshes as
+illustrated by Fig.\ref{fig:anisotropic}.
+
+
 Building blocks taken from CGAL:
 - Polyhedron (enriched primitives to store curvature tensors per
 vertex or per corner, plus uv coordinates)